./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_unequal.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:57:43,368 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:57:43,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:57:43,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:57:43,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:57:43,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:57:43,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:57:43,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:57:43,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:57:43,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:57:43,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:57:43,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:57:43,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:57:43,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:57:43,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:57:43,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:57:43,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:57:43,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:57:43,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:57:43,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:57:43,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:57:43,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:57:43,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:57:43,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:57:43,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:57:43,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:57:43,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:57:43,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:57:43,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:57:43,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:57:43,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:57:43,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:57:43,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:57:43,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:57:43,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:57:43,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:57:43,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:57:43,428 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:57:43,428 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:57:43,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:57:43,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:57:43,429 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:57:43,452 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:57:43,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:57:43,453 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:57:43,453 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:57:43,454 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:57:43,454 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:57:43,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:57:43,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:57:43,455 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:57:43,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:57:43,456 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:57:43,456 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:57:43,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:57:43,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:57:43,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:57:43,457 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:57:43,457 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:57:43,457 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:57:43,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:57:43,457 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:57:43,457 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:57:43,458 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:57:43,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:57:43,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:57:43,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:57:43,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:57:43,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:57:43,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:57:43,463 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:57:43,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:57:43,463 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2022-02-20 23:57:43,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:57:43,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:57:43,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:57:43,684 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:57:43,685 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:57:43,686 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-02-20 23:57:43,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70fdae84c/472a0c256b484588938464c3e027fd5f/FLAG2f712f7b3 [2022-02-20 23:57:44,074 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:57:44,074 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-02-20 23:57:44,087 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70fdae84c/472a0c256b484588938464c3e027fd5f/FLAG2f712f7b3 [2022-02-20 23:57:44,492 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70fdae84c/472a0c256b484588938464c3e027fd5f [2022-02-20 23:57:44,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:57:44,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:57:44,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:57:44,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:57:44,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:57:44,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:57:44" (1/1) ... [2022-02-20 23:57:44,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@206cf05c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:44, skipping insertion in model container [2022-02-20 23:57:44,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:57:44" (1/1) ... [2022-02-20 23:57:44,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:57:44,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:57:44,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2022-02-20 23:57:44,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:57:44,793 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:57:44,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2022-02-20 23:57:44,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:57:44,851 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:57:44,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:44 WrapperNode [2022-02-20 23:57:44,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:57:44,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:57:44,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:57:44,854 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:57:44,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:44" (1/1) ... [2022-02-20 23:57:44,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:44" (1/1) ... [2022-02-20 23:57:44,905 INFO L137 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2022-02-20 23:57:44,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:57:44,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:57:44,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:57:44,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:57:44,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:44" (1/1) ... [2022-02-20 23:57:44,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:44" (1/1) ... [2022-02-20 23:57:44,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:44" (1/1) ... [2022-02-20 23:57:44,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:44" (1/1) ... [2022-02-20 23:57:44,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:44" (1/1) ... [2022-02-20 23:57:44,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:44" (1/1) ... [2022-02-20 23:57:44,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:44" (1/1) ... [2022-02-20 23:57:44,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:57:44,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:57:44,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:57:44,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:57:44,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:44" (1/1) ... [2022-02-20 23:57:44,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:57:44,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:57:44,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:57:44,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:57:45,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:57:45,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:57:45,009 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 23:57:45,009 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 23:57:45,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:57:45,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:57:45,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:57:45,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:57:45,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:57:45,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:57:45,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:57:45,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:57:45,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:57:45,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:57:45,089 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:57:45,094 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:57:45,499 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:57:45,504 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:57:45,506 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 23:57:45,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:57:45 BoogieIcfgContainer [2022-02-20 23:57:45,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:57:45,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:57:45,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:57:45,511 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:57:45,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:57:44" (1/3) ... [2022-02-20 23:57:45,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47eb248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:57:45, skipping insertion in model container [2022-02-20 23:57:45,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:44" (2/3) ... [2022-02-20 23:57:45,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47eb248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:57:45, skipping insertion in model container [2022-02-20 23:57:45,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:57:45" (3/3) ... [2022-02-20 23:57:45,513 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2022-02-20 23:57:45,517 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:57:45,517 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2022-02-20 23:57:45,550 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:57:45,556 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:57:45,557 INFO L340 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2022-02-20 23:57:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 57 states have (on average 2.087719298245614) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:45,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:57:45,578 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:45,578 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:45,579 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:57:45,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:45,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1815964311, now seen corresponding path program 1 times [2022-02-20 23:57:45,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:45,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590241852] [2022-02-20 23:57:45,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:45,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:45,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {111#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {111#true} is VALID [2022-02-20 23:57:45,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {111#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {111#true} is VALID [2022-02-20 23:57:45,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {111#true} assume !!(dll_create_~len#1 > 0); {111#true} is VALID [2022-02-20 23:57:45,711 INFO L272 TraceCheckUtils]: 3: Hoare triple {111#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {111#true} is VALID [2022-02-20 23:57:45,712 INFO L290 TraceCheckUtils]: 4: Hoare triple {111#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {113#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:45,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {113#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {113#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:45,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {113#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(1 == #valid[~temp~0#1.base]); {112#false} is VALID [2022-02-20 23:57:45,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:45,715 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:45,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590241852] [2022-02-20 23:57:45,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590241852] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:45,716 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:45,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:57:45,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697551129] [2022-02-20 23:57:45,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:45,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:57:45,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:45,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:45,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:45,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:57:45,732 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:45,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:57:45,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:57:45,748 INFO L87 Difference]: Start difference. First operand has 108 states, 57 states have (on average 2.087719298245614) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:45,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:45,919 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2022-02-20 23:57:45,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:57:45,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:57:45,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-20 23:57:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-20 23:57:45,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 123 transitions. [2022-02-20 23:57:46,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:46,023 INFO L225 Difference]: With dead ends: 105 [2022-02-20 23:57:46,023 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 23:57:46,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:57:46,026 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:46,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 164 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:57:46,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 23:57:46,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-02-20 23:57:46,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:46,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:46,056 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:46,057 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:46,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:46,066 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2022-02-20 23:57:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-02-20 23:57:46,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:46,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:46,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 102 states. [2022-02-20 23:57:46,069 INFO L87 Difference]: Start difference. First operand has 102 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 102 states. [2022-02-20 23:57:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:46,075 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2022-02-20 23:57:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-02-20 23:57:46,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:46,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:46,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:46,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:46,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2022-02-20 23:57:46,082 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 7 [2022-02-20 23:57:46,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:46,085 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2022-02-20 23:57:46,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:46,085 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-02-20 23:57:46,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:57:46,086 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:46,086 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:46,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:57:46,087 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:57:46,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:46,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1815964312, now seen corresponding path program 1 times [2022-02-20 23:57:46,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:46,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828313321] [2022-02-20 23:57:46,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:46,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:46,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {527#true} is VALID [2022-02-20 23:57:46,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {527#true} is VALID [2022-02-20 23:57:46,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#true} assume !!(dll_create_~len#1 > 0); {527#true} is VALID [2022-02-20 23:57:46,150 INFO L272 TraceCheckUtils]: 3: Hoare triple {527#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {527#true} is VALID [2022-02-20 23:57:46,151 INFO L290 TraceCheckUtils]: 4: Hoare triple {527#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {529#(and (= |node_create_~temp~0#1.offset| 0) (<= 12 (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:46,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#(and (= |node_create_~temp~0#1.offset| 0) (<= 12 (select |#length| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {529#(and (= |node_create_~temp~0#1.offset| 0) (<= 12 (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:46,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {529#(and (= |node_create_~temp~0#1.offset| 0) (<= 12 (select |#length| |node_create_~temp~0#1.base|)))} assume !(4 + (4 + ~temp~0#1.offset) <= #length[~temp~0#1.base] && 0 <= 4 + ~temp~0#1.offset); {528#false} is VALID [2022-02-20 23:57:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:46,152 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:46,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828313321] [2022-02-20 23:57:46,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828313321] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:46,153 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:46,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:57:46,154 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809753391] [2022-02-20 23:57:46,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:46,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:57:46,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:46,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:46,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:46,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:57:46,161 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:46,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:57:46,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:57:46,162 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:46,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:46,313 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-02-20 23:57:46,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:57:46,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:57:46,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-20 23:57:46,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:46,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-20 23:57:46,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-02-20 23:57:46,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:46,411 INFO L225 Difference]: With dead ends: 99 [2022-02-20 23:57:46,412 INFO L226 Difference]: Without dead ends: 99 [2022-02-20 23:57:46,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:57:46,413 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:46,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 164 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:57:46,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-20 23:57:46,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-02-20 23:57:46,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:46,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 99 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:46,417 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 99 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:46,418 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 99 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:46,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:46,420 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-02-20 23:57:46,420 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-02-20 23:57:46,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:46,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:46,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 99 states. [2022-02-20 23:57:46,422 INFO L87 Difference]: Start difference. First operand has 99 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 99 states. [2022-02-20 23:57:46,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:46,424 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-02-20 23:57:46,425 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-02-20 23:57:46,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:46,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:46,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:46,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2022-02-20 23:57:46,428 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 7 [2022-02-20 23:57:46,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:46,429 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2022-02-20 23:57:46,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:57:46,429 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-02-20 23:57:46,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:57:46,429 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:46,430 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:46,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:57:46,430 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:57:46,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:46,430 INFO L85 PathProgramCache]: Analyzing trace with hash -418267899, now seen corresponding path program 1 times [2022-02-20 23:57:46,431 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:46,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837213782] [2022-02-20 23:57:46,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:46,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:46,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 23:57:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:46,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {940#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {941#(= |node_create_~temp~0#1.offset| 0)} is VALID [2022-02-20 23:57:46,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {941#(= |node_create_~temp~0#1.offset| 0)} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {941#(= |node_create_~temp~0#1.offset| 0)} is VALID [2022-02-20 23:57:46,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {941#(= |node_create_~temp~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {941#(= |node_create_~temp~0#1.offset| 0)} is VALID [2022-02-20 23:57:46,557 INFO L290 TraceCheckUtils]: 3: Hoare triple {941#(= |node_create_~temp~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {942#(and (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:46,557 INFO L290 TraceCheckUtils]: 4: Hoare triple {942#(and (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {942#(and (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:46,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {942#(and (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {943#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:57:46,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {943#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|))} assume true; {943#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:57:46,559 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {943#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|))} {928#true} #188#return; {938#(and (= |ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:57:46,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {928#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {928#true} is VALID [2022-02-20 23:57:46,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {928#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {928#true} is VALID [2022-02-20 23:57:46,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {928#true} assume !!(dll_create_~len#1 > 0); {928#true} is VALID [2022-02-20 23:57:46,561 INFO L272 TraceCheckUtils]: 3: Hoare triple {928#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {940#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:57:46,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {940#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {941#(= |node_create_~temp~0#1.offset| 0)} is VALID [2022-02-20 23:57:46,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {941#(= |node_create_~temp~0#1.offset| 0)} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {941#(= |node_create_~temp~0#1.offset| 0)} is VALID [2022-02-20 23:57:46,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {941#(= |node_create_~temp~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {941#(= |node_create_~temp~0#1.offset| 0)} is VALID [2022-02-20 23:57:46,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {941#(= |node_create_~temp~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {942#(and (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:46,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {942#(and (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {942#(and (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:46,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {942#(and (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {943#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:57:46,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {943#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|))} assume true; {943#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 23:57:46,565 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {943#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|))} {928#true} #188#return; {938#(and (= |ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:57:46,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {938#(and (= |ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_create_#t~ret4#1.base|)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {939#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:57:46,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {939#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} assume !(4 + dll_create_~new_head~0#1.offset <= #length[dll_create_~new_head~0#1.base] && 0 <= dll_create_~new_head~0#1.offset); {929#false} is VALID [2022-02-20 23:57:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:46,567 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:46,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837213782] [2022-02-20 23:57:46,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837213782] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:46,567 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:46,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:57:46,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406290893] [2022-02-20 23:57:46,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:46,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 23:57:46,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:46,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:46,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:46,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:57:46,581 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:46,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:57:46,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:57:46,582 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:47,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:47,108 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-02-20 23:57:47,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:57:47,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 23:57:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:47,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:47,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2022-02-20 23:57:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2022-02-20 23:57:47,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 116 transitions. [2022-02-20 23:57:47,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:47,209 INFO L225 Difference]: With dead ends: 102 [2022-02-20 23:57:47,209 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 23:57:47,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:57:47,211 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 22 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:47,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 415 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:57:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 23:57:47,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2022-02-20 23:57:47,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:47,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 97 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 93 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:47,215 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 97 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 93 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:47,215 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 97 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 93 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:47,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:47,218 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-02-20 23:57:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2022-02-20 23:57:47,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:47,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:47,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 93 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 102 states. [2022-02-20 23:57:47,219 INFO L87 Difference]: Start difference. First operand has 97 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 93 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 102 states. [2022-02-20 23:57:47,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:47,222 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-02-20 23:57:47,222 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2022-02-20 23:57:47,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:47,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:47,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:47,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:47,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 93 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-02-20 23:57:47,225 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 14 [2022-02-20 23:57:47,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:47,225 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-02-20 23:57:47,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:47,226 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-02-20 23:57:47,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:57:47,226 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:47,226 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:47,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:57:47,226 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:57:47,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:47,227 INFO L85 PathProgramCache]: Analyzing trace with hash -418267900, now seen corresponding path program 1 times [2022-02-20 23:57:47,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:47,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917330134] [2022-02-20 23:57:47,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:47,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:47,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 23:57:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:47,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {1363#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1351#true} is VALID [2022-02-20 23:57:47,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {1351#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1351#true} is VALID [2022-02-20 23:57:47,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {1351#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {1364#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:47,321 INFO L290 TraceCheckUtils]: 3: Hoare triple {1364#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {1364#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:47,321 INFO L290 TraceCheckUtils]: 4: Hoare triple {1364#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {1364#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:47,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {1364#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1365#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:47,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {1365#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {1365#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:47,323 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1365#(= (select |#valid| |node_create_#res#1.base|) 1)} {1351#true} #188#return; {1361#(= (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:57:47,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {1351#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {1351#true} is VALID [2022-02-20 23:57:47,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {1351#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {1351#true} is VALID [2022-02-20 23:57:47,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {1351#true} assume !!(dll_create_~len#1 > 0); {1351#true} is VALID [2022-02-20 23:57:47,324 INFO L272 TraceCheckUtils]: 3: Hoare triple {1351#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {1363#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:57:47,324 INFO L290 TraceCheckUtils]: 4: Hoare triple {1363#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1351#true} is VALID [2022-02-20 23:57:47,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {1351#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1351#true} is VALID [2022-02-20 23:57:47,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {1351#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {1364#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:47,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {1364#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {1364#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:47,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {1364#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {1364#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:47,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {1364#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1365#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:47,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {1365#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {1365#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:47,327 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1365#(= (select |#valid| |node_create_#res#1.base|) 1)} {1351#true} #188#return; {1361#(= (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:57:47,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {1361#(= (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|) 1)} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {1362#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:57:47,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {1362#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} assume !(1 == #valid[dll_create_~new_head~0#1.base]); {1352#false} is VALID [2022-02-20 23:57:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:47,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:47,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917330134] [2022-02-20 23:57:47,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917330134] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:47,329 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:47,329 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:57:47,329 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297703018] [2022-02-20 23:57:47,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:47,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 23:57:47,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:47,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:47,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:47,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:57:47,340 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:47,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:57:47,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:57:47,340 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:47,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:47,840 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-02-20 23:57:47,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:57:47,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 23:57:47,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-02-20 23:57:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-02-20 23:57:47,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2022-02-20 23:57:47,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:47,915 INFO L225 Difference]: With dead ends: 100 [2022-02-20 23:57:47,915 INFO L226 Difference]: Without dead ends: 100 [2022-02-20 23:57:47,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:57:47,916 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 15 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:47,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 361 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:57:47,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-20 23:57:47,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-02-20 23:57:47,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:47,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 95 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 91 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:47,920 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 95 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 91 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:47,920 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 95 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 91 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:47,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:47,923 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-02-20 23:57:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2022-02-20 23:57:47,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:47,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:47,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 91 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 100 states. [2022-02-20 23:57:47,924 INFO L87 Difference]: Start difference. First operand has 95 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 91 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 100 states. [2022-02-20 23:57:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:47,927 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-02-20 23:57:47,927 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2022-02-20 23:57:47,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:47,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:47,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:47,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 91 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2022-02-20 23:57:47,931 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 14 [2022-02-20 23:57:47,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:47,931 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2022-02-20 23:57:47,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:47,932 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2022-02-20 23:57:47,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:57:47,932 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:47,932 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:47,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:57:47,932 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:57:47,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:47,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1186059880, now seen corresponding path program 1 times [2022-02-20 23:57:47,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:47,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636729999] [2022-02-20 23:57:47,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:47,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:47,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-20 23:57:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:47,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {1776#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1765#true} is VALID [2022-02-20 23:57:47,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {1765#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1765#true} is VALID [2022-02-20 23:57:47,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {1765#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {1765#true} is VALID [2022-02-20 23:57:47,973 INFO L290 TraceCheckUtils]: 3: Hoare triple {1765#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {1765#true} is VALID [2022-02-20 23:57:47,973 INFO L290 TraceCheckUtils]: 4: Hoare triple {1765#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {1765#true} is VALID [2022-02-20 23:57:47,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {1765#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1765#true} is VALID [2022-02-20 23:57:47,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {1765#true} assume true; {1765#true} is VALID [2022-02-20 23:57:47,973 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1765#true} {1766#false} #190#return; {1766#false} is VALID [2022-02-20 23:57:47,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {1765#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {1765#true} is VALID [2022-02-20 23:57:47,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {1765#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {1767#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:57:47,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {1767#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} assume !(dll_create_~len#1 > 0); {1766#false} is VALID [2022-02-20 23:57:47,975 INFO L290 TraceCheckUtils]: 3: Hoare triple {1766#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {1766#false} is VALID [2022-02-20 23:57:47,975 INFO L290 TraceCheckUtils]: 4: Hoare triple {1766#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {1766#false} is VALID [2022-02-20 23:57:47,975 INFO L272 TraceCheckUtils]: 5: Hoare triple {1766#false} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {1776#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:57:47,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {1776#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1765#true} is VALID [2022-02-20 23:57:47,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {1765#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1765#true} is VALID [2022-02-20 23:57:47,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {1765#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {1765#true} is VALID [2022-02-20 23:57:47,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {1765#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {1765#true} is VALID [2022-02-20 23:57:47,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {1765#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {1765#true} is VALID [2022-02-20 23:57:47,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {1765#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1765#true} is VALID [2022-02-20 23:57:47,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {1765#true} assume true; {1765#true} is VALID [2022-02-20 23:57:47,977 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1765#true} {1766#false} #190#return; {1766#false} is VALID [2022-02-20 23:57:47,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {1766#false} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {1766#false} is VALID [2022-02-20 23:57:47,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {1766#false} assume !(1 == #valid[dll_append_~head#1.base]); {1766#false} is VALID [2022-02-20 23:57:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:47,977 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:47,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636729999] [2022-02-20 23:57:47,978 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636729999] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:47,978 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:47,978 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:57:47,978 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306844555] [2022-02-20 23:57:47,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:47,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:57:47,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:47,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:47,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:47,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:57:47,989 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:47,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:57:47,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:57:47,989 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:48,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:48,167 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-02-20 23:57:48,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:57:48,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:57:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:48,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-02-20 23:57:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-02-20 23:57:48,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 117 transitions. [2022-02-20 23:57:48,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:48,246 INFO L225 Difference]: With dead ends: 105 [2022-02-20 23:57:48,246 INFO L226 Difference]: Without dead ends: 105 [2022-02-20 23:57:48,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:57:48,247 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 9 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:48,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 241 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:57:48,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-02-20 23:57:48,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2022-02-20 23:57:48,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:48,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 96 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:48,251 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 96 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:48,251 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 96 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:48,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:48,269 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-02-20 23:57:48,269 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2022-02-20 23:57:48,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:48,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:48,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 105 states. [2022-02-20 23:57:48,270 INFO L87 Difference]: Start difference. First operand has 96 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 105 states. [2022-02-20 23:57:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:48,273 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-02-20 23:57:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2022-02-20 23:57:48,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:48,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:48,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:48,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:48,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:57:48,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2022-02-20 23:57:48,276 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 16 [2022-02-20 23:57:48,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:48,276 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2022-02-20 23:57:48,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:48,277 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-02-20 23:57:48,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:57:48,277 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:48,278 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:48,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:57:48,278 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:57:48,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:48,279 INFO L85 PathProgramCache]: Analyzing trace with hash -918895952, now seen corresponding path program 1 times [2022-02-20 23:57:48,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:48,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669595832] [2022-02-20 23:57:48,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:48,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:48,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 23:57:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:48,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {2201#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2190#true} is VALID [2022-02-20 23:57:48,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {2190#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2190#true} is VALID [2022-02-20 23:57:48,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {2190#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2190#true} is VALID [2022-02-20 23:57:48,376 INFO L290 TraceCheckUtils]: 3: Hoare triple {2190#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {2190#true} is VALID [2022-02-20 23:57:48,377 INFO L290 TraceCheckUtils]: 4: Hoare triple {2190#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {2190#true} is VALID [2022-02-20 23:57:48,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {2190#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2190#true} is VALID [2022-02-20 23:57:48,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 23:57:48,378 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2190#true} {2192#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} #188#return; {2192#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:48,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {2190#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {2190#true} is VALID [2022-02-20 23:57:48,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {2190#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {2192#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:48,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {2192#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !!(dll_create_~len#1 > 0); {2192#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:48,380 INFO L272 TraceCheckUtils]: 3: Hoare triple {2192#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {2201#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:57:48,380 INFO L290 TraceCheckUtils]: 4: Hoare triple {2201#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2190#true} is VALID [2022-02-20 23:57:48,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {2190#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2190#true} is VALID [2022-02-20 23:57:48,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {2190#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2190#true} is VALID [2022-02-20 23:57:48,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {2190#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {2190#true} is VALID [2022-02-20 23:57:48,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {2190#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {2190#true} is VALID [2022-02-20 23:57:48,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {2190#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2190#true} is VALID [2022-02-20 23:57:48,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 23:57:48,382 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2190#true} {2192#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} #188#return; {2192#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:48,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {2192#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {2192#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:48,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {2192#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {2192#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:48,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {2192#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {2192#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:48,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {2192#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {2191#false} is VALID [2022-02-20 23:57:48,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {2191#false} assume !(1 == #valid[dll_create_~head~0#1.base]); {2191#false} is VALID [2022-02-20 23:57:48,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:48,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:48,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669595832] [2022-02-20 23:57:48,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669595832] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:57:48,387 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:57:48,388 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:57:48,388 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874060632] [2022-02-20 23:57:48,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:57:48,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 23:57:48,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:48,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:48,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:48,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:57:48,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:48,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:57:48,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:57:48,401 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:48,582 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:57:48,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:57:48,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 23:57:48,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-02-20 23:57:48,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-02-20 23:57:48,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 113 transitions. [2022-02-20 23:57:48,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:48,652 INFO L225 Difference]: With dead ends: 102 [2022-02-20 23:57:48,652 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 23:57:48,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:57:48,653 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:48,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 237 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:57:48,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 23:57:48,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-02-20 23:57:48,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:48,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 101 states, 60 states have (on average 1.75) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:48,657 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 101 states, 60 states have (on average 1.75) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:48,657 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 101 states, 60 states have (on average 1.75) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:48,659 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:57:48,659 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-02-20 23:57:48,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:48,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:48,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 60 states have (on average 1.75) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 102 states. [2022-02-20 23:57:48,660 INFO L87 Difference]: Start difference. First operand has 101 states, 60 states have (on average 1.75) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 102 states. [2022-02-20 23:57:48,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:48,662 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:57:48,662 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-02-20 23:57:48,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:48,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:48,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:48,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 60 states have (on average 1.75) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-02-20 23:57:48,664 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 17 [2022-02-20 23:57:48,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:48,664 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-02-20 23:57:48,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:57:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-02-20 23:57:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:57:48,673 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:48,673 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:48,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:57:48,673 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:57:48,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:48,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1802773707, now seen corresponding path program 1 times [2022-02-20 23:57:48,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:48,674 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69941374] [2022-02-20 23:57:48,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:48,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:48,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 23:57:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:48,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {2631#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2611#true} is VALID [2022-02-20 23:57:48,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {2611#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2611#true} is VALID [2022-02-20 23:57:48,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {2611#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2611#true} is VALID [2022-02-20 23:57:48,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {2611#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {2611#true} is VALID [2022-02-20 23:57:48,757 INFO L290 TraceCheckUtils]: 4: Hoare triple {2611#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {2611#true} is VALID [2022-02-20 23:57:48,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {2611#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2611#true} is VALID [2022-02-20 23:57:48,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {2611#true} assume true; {2611#true} is VALID [2022-02-20 23:57:48,758 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2611#true} {2613#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} #188#return; {2613#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:57:48,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 23:57:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:48,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {2631#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2611#true} is VALID [2022-02-20 23:57:48,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {2611#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2611#true} is VALID [2022-02-20 23:57:48,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {2611#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2611#true} is VALID [2022-02-20 23:57:48,784 INFO L290 TraceCheckUtils]: 3: Hoare triple {2611#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {2611#true} is VALID [2022-02-20 23:57:48,790 INFO L290 TraceCheckUtils]: 4: Hoare triple {2611#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {2611#true} is VALID [2022-02-20 23:57:48,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {2611#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2611#true} is VALID [2022-02-20 23:57:48,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {2611#true} assume true; {2611#true} is VALID [2022-02-20 23:57:48,791 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2611#true} {2612#false} #190#return; {2612#false} is VALID [2022-02-20 23:57:48,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {2611#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {2611#true} is VALID [2022-02-20 23:57:48,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {2611#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {2613#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:57:48,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {2613#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} assume !!(dll_create_~len#1 > 0); {2613#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:57:48,793 INFO L272 TraceCheckUtils]: 3: Hoare triple {2613#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {2631#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:57:48,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {2631#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2611#true} is VALID [2022-02-20 23:57:48,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {2611#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2611#true} is VALID [2022-02-20 23:57:48,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {2611#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2611#true} is VALID [2022-02-20 23:57:48,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {2611#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {2611#true} is VALID [2022-02-20 23:57:48,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {2611#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {2611#true} is VALID [2022-02-20 23:57:48,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {2611#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2611#true} is VALID [2022-02-20 23:57:48,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {2611#true} assume true; {2611#true} is VALID [2022-02-20 23:57:48,795 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2611#true} {2613#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} #188#return; {2613#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:57:48,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {2613#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {2613#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:57:48,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {2613#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {2613#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:57:48,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {2613#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {2613#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:57:48,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {2613#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {2613#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 23:57:48,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {2613#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {2622#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:57:48,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {2622#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~len#1 > 0); {2612#false} is VALID [2022-02-20 23:57:48,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {2612#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {2612#false} is VALID [2022-02-20 23:57:48,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {2612#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {2612#false} is VALID [2022-02-20 23:57:48,797 INFO L272 TraceCheckUtils]: 20: Hoare triple {2612#false} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {2631#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:57:48,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {2631#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2611#true} is VALID [2022-02-20 23:57:48,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {2611#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2611#true} is VALID [2022-02-20 23:57:48,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {2611#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2611#true} is VALID [2022-02-20 23:57:48,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {2611#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {2611#true} is VALID [2022-02-20 23:57:48,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {2611#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {2611#true} is VALID [2022-02-20 23:57:48,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {2611#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2611#true} is VALID [2022-02-20 23:57:48,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {2611#true} assume true; {2611#true} is VALID [2022-02-20 23:57:48,798 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2611#true} {2612#false} #190#return; {2612#false} is VALID [2022-02-20 23:57:48,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {2612#false} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {2612#false} is VALID [2022-02-20 23:57:48,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {2612#false} assume !(1 == #valid[dll_append_~head#1.base]); {2612#false} is VALID [2022-02-20 23:57:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:57:48,798 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:48,798 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69941374] [2022-02-20 23:57:48,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69941374] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:57:48,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270729717] [2022-02-20 23:57:48,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:48,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:48,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:57:48,800 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:57:48,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:57:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:48,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:57:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:48,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:49,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {2611#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {2611#true} is VALID [2022-02-20 23:57:49,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {2611#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:57:49,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !!(dll_create_~len#1 > 0); {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:57:49,060 INFO L272 TraceCheckUtils]: 3: Hoare triple {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {2611#true} is VALID [2022-02-20 23:57:49,061 INFO L290 TraceCheckUtils]: 4: Hoare triple {2611#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2611#true} is VALID [2022-02-20 23:57:49,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {2611#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2611#true} is VALID [2022-02-20 23:57:49,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {2611#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2611#true} is VALID [2022-02-20 23:57:49,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {2611#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {2611#true} is VALID [2022-02-20 23:57:49,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {2611#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {2611#true} is VALID [2022-02-20 23:57:49,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {2611#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2611#true} is VALID [2022-02-20 23:57:49,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {2611#true} assume true; {2611#true} is VALID [2022-02-20 23:57:49,062 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2611#true} {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} #188#return; {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:57:49,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:57:49,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:57:49,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:57:49,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:57:49,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {2622#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:57:49,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {2622#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~len#1 > 0); {2612#false} is VALID [2022-02-20 23:57:49,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {2612#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {2612#false} is VALID [2022-02-20 23:57:49,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {2612#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {2612#false} is VALID [2022-02-20 23:57:49,065 INFO L272 TraceCheckUtils]: 20: Hoare triple {2612#false} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {2612#false} is VALID [2022-02-20 23:57:49,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {2612#false} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2612#false} is VALID [2022-02-20 23:57:49,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {2612#false} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2612#false} is VALID [2022-02-20 23:57:49,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {2612#false} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2612#false} is VALID [2022-02-20 23:57:49,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {2612#false} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {2612#false} is VALID [2022-02-20 23:57:49,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {2612#false} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {2612#false} is VALID [2022-02-20 23:57:49,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {2612#false} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2612#false} is VALID [2022-02-20 23:57:49,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {2612#false} assume true; {2612#false} is VALID [2022-02-20 23:57:49,065 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2612#false} {2612#false} #190#return; {2612#false} is VALID [2022-02-20 23:57:49,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {2612#false} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {2612#false} is VALID [2022-02-20 23:57:49,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {2612#false} assume !(1 == #valid[dll_append_~head#1.base]); {2612#false} is VALID [2022-02-20 23:57:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:49,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:57:49,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {2612#false} assume !(1 == #valid[dll_append_~head#1.base]); {2612#false} is VALID [2022-02-20 23:57:49,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {2612#false} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {2612#false} is VALID [2022-02-20 23:57:49,163 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2611#true} {2612#false} #190#return; {2612#false} is VALID [2022-02-20 23:57:49,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {2611#true} assume true; {2611#true} is VALID [2022-02-20 23:57:49,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {2611#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2611#true} is VALID [2022-02-20 23:57:49,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {2611#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {2611#true} is VALID [2022-02-20 23:57:49,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {2611#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {2611#true} is VALID [2022-02-20 23:57:49,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {2611#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2611#true} is VALID [2022-02-20 23:57:49,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {2611#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2611#true} is VALID [2022-02-20 23:57:49,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {2611#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2611#true} is VALID [2022-02-20 23:57:49,164 INFO L272 TraceCheckUtils]: 20: Hoare triple {2612#false} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {2611#true} is VALID [2022-02-20 23:57:49,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {2612#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {2612#false} is VALID [2022-02-20 23:57:49,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {2612#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {2612#false} is VALID [2022-02-20 23:57:49,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {2622#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~len#1 > 0); {2612#false} is VALID [2022-02-20 23:57:49,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {2622#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:57:49,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:57:49,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:57:49,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:57:49,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:57:49,169 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2611#true} {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} #188#return; {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:57:49,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {2611#true} assume true; {2611#true} is VALID [2022-02-20 23:57:49,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {2611#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2611#true} is VALID [2022-02-20 23:57:49,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {2611#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {2611#true} is VALID [2022-02-20 23:57:49,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {2611#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {2611#true} is VALID [2022-02-20 23:57:49,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {2611#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {2611#true} is VALID [2022-02-20 23:57:49,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {2611#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2611#true} is VALID [2022-02-20 23:57:49,170 INFO L290 TraceCheckUtils]: 4: Hoare triple {2611#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2611#true} is VALID [2022-02-20 23:57:49,170 INFO L272 TraceCheckUtils]: 3: Hoare triple {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {2611#true} is VALID [2022-02-20 23:57:49,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !!(dll_create_~len#1 > 0); {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:57:49,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {2611#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {2638#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:57:49,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {2611#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {2611#true} is VALID [2022-02-20 23:57:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:57:49,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270729717] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:57:49,172 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:57:49,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-02-20 23:57:49,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032507045] [2022-02-20 23:57:49,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:57:49,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-02-20 23:57:49,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:49,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:57:49,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:49,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:57:49,203 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:49,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:57:49,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:57:49,204 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:57:49,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:49,444 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2022-02-20 23:57:49,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:57:49,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-02-20 23:57:49,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:57:49,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2022-02-20 23:57:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:57:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2022-02-20 23:57:49,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 114 transitions. [2022-02-20 23:57:49,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:49,537 INFO L225 Difference]: With dead ends: 103 [2022-02-20 23:57:49,537 INFO L226 Difference]: Without dead ends: 103 [2022-02-20 23:57:49,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:57:49,538 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 14 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:49,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 330 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:57:49,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-20 23:57:49,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-02-20 23:57:49,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:49,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 98 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:49,541 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 98 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:49,542 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 98 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:49,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:49,551 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2022-02-20 23:57:49,551 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2022-02-20 23:57:49,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:49,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:49,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 98 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 103 states. [2022-02-20 23:57:49,552 INFO L87 Difference]: Start difference. First operand has 103 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 98 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 103 states. [2022-02-20 23:57:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:49,554 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2022-02-20 23:57:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2022-02-20 23:57:49,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:49,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:49,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:49,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 98 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2022-02-20 23:57:49,567 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 31 [2022-02-20 23:57:49,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:49,567 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2022-02-20 23:57:49,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:57:49,567 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2022-02-20 23:57:49,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:57:49,568 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:49,568 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:49,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:57:49,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:49,769 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:57:49,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:49,769 INFO L85 PathProgramCache]: Analyzing trace with hash 916543363, now seen corresponding path program 1 times [2022-02-20 23:57:49,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:49,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801778866] [2022-02-20 23:57:49,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:49,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:49,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 23:57:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:49,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {3248#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3227#true} is VALID [2022-02-20 23:57:49,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {3227#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3227#true} is VALID [2022-02-20 23:57:49,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {3227#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:49,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:49,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:49,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3250#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:49,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {3250#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {3250#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:49,877 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3250#(= (select |#valid| |node_create_#res#1.base|) 1)} {3227#true} #188#return; {3237#(= (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:57:49,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 23:57:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:49,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {3248#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,930 INFO L290 TraceCheckUtils]: 3: Hoare triple {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,930 INFO L290 TraceCheckUtils]: 4: Hoare triple {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3252#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:49,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {3252#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {3252#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:49,933 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3252#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} #188#return; {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:49,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {3227#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {3227#true} is VALID [2022-02-20 23:57:49,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {3227#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {3227#true} is VALID [2022-02-20 23:57:49,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {3227#true} assume !!(dll_create_~len#1 > 0); {3227#true} is VALID [2022-02-20 23:57:49,934 INFO L272 TraceCheckUtils]: 3: Hoare triple {3227#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {3248#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:57:49,934 INFO L290 TraceCheckUtils]: 4: Hoare triple {3248#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3227#true} is VALID [2022-02-20 23:57:49,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {3227#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3227#true} is VALID [2022-02-20 23:57:49,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {3227#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:49,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:49,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:49,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3250#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:49,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {3250#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {3250#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:49,937 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3250#(= (select |#valid| |node_create_#res#1.base|) 1)} {3227#true} #188#return; {3237#(= (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:57:49,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {3237#(= (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|) 1)} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {3238#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:57:49,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {3238#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {3238#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:57:49,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {3238#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3238#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:57:49,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {3238#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {3238#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:57:49,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {3238#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:49,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume !!(dll_create_~len#1 > 0); {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:49,940 INFO L272 TraceCheckUtils]: 18: Hoare triple {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {3248#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:57:49,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {3248#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:49,944 INFO L290 TraceCheckUtils]: 24: Hoare triple {3251#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3252#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:49,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {3252#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {3252#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:49,945 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3252#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} #188#return; {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:49,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:49,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:49,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:49,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:49,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume !(1 == #valid[dll_create_~head~0#1.base]); {3228#false} is VALID [2022-02-20 23:57:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:57:49,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:49,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801778866] [2022-02-20 23:57:49,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801778866] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:57:49,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180928551] [2022-02-20 23:57:49,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:49,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:49,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:57:49,949 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:57:49,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:57:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:50,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 23:57:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:50,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:50,098 INFO L390 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 [2022-02-20 23:57:50,386 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:57:50,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-20 23:57:50,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {3227#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {3227#true} is VALID [2022-02-20 23:57:50,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {3227#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {3227#true} is VALID [2022-02-20 23:57:50,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {3227#true} assume !!(dll_create_~len#1 > 0); {3227#true} is VALID [2022-02-20 23:57:50,408 INFO L272 TraceCheckUtils]: 3: Hoare triple {3227#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {3227#true} is VALID [2022-02-20 23:57:50,409 INFO L290 TraceCheckUtils]: 4: Hoare triple {3227#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:50,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:50,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:50,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:50,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:57:50,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {3249#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3250#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:50,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {3250#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {3250#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:57:50,412 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3250#(= (select |#valid| |node_create_#res#1.base|) 1)} {3227#true} #188#return; {3237#(= (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 23:57:50,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {3237#(= (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|) 1)} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {3238#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:57:50,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {3238#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {3238#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:57:50,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {3238#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3238#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:57:50,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {3238#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {3238#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:57:50,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {3238#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:50,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume !!(dll_create_~len#1 > 0); {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:50,416 INFO L272 TraceCheckUtils]: 18: Hoare triple {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {3310#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:57:50,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {3310#(= |old(#valid)| |#valid|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3314#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_510 Int)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510)))))} is VALID [2022-02-20 23:57:50,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {3314#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_510 Int)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510)))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3314#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_510 Int)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510)))))} is VALID [2022-02-20 23:57:50,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {3314#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_510 Int)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510)))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {3314#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_510 Int)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510)))))} is VALID [2022-02-20 23:57:50,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {3314#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_510 Int)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510)))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {3314#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_510 Int)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510)))))} is VALID [2022-02-20 23:57:50,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {3314#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_510 Int)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510)))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {3314#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_510 Int)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510)))))} is VALID [2022-02-20 23:57:50,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {3314#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_510 Int)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510)))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3314#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_510 Int)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510)))))} is VALID [2022-02-20 23:57:50,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {3314#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_510 Int)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510)))))} assume true; {3314#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_510 Int)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510)))))} is VALID [2022-02-20 23:57:50,424 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3314#(exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_510 Int)) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510)))))} {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} #188#return; {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:50,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:50,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:50,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:50,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} is VALID [2022-02-20 23:57:50,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {3239#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)} assume !(1 == #valid[dll_create_~head~0#1.base]); {3228#false} is VALID [2022-02-20 23:57:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:50,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:57:50,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180928551] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:57:50,541 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:57:50,541 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-02-20 23:57:50,541 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074220898] [2022-02-20 23:57:50,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:57:50,542 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-02-20 23:57:50,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:50,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:50,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:50,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:57:50,577 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:50,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:57:50,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:57:50,577 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:51,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:51,391 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2022-02-20 23:57:51,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:57:51,391 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-02-20 23:57:51,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2022-02-20 23:57:51,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2022-02-20 23:57:51,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 125 transitions. [2022-02-20 23:57:51,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:51,486 INFO L225 Difference]: With dead ends: 114 [2022-02-20 23:57:51,486 INFO L226 Difference]: Without dead ends: 114 [2022-02-20 23:57:51,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:57:51,487 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 172 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:51,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 314 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 398 Invalid, 0 Unknown, 2 Unchecked, 0.3s Time] [2022-02-20 23:57:51,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-02-20 23:57:51,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2022-02-20 23:57:51,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:51,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 102 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 97 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:51,489 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 102 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 97 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:51,489 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 102 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 97 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:51,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:51,498 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2022-02-20 23:57:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2022-02-20 23:57:51,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:51,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:51,499 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 97 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 114 states. [2022-02-20 23:57:51,499 INFO L87 Difference]: Start difference. First operand has 102 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 97 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 114 states. [2022-02-20 23:57:51,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:51,501 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2022-02-20 23:57:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2022-02-20 23:57:51,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:51,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:51,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:51,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:51,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 97 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2022-02-20 23:57:51,503 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 32 [2022-02-20 23:57:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:51,503 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2022-02-20 23:57:51,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:51,503 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-02-20 23:57:51,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:57:51,504 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:51,504 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:51,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:57:51,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-02-20 23:57:51,713 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:57:51,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:51,713 INFO L85 PathProgramCache]: Analyzing trace with hash 916543364, now seen corresponding path program 1 times [2022-02-20 23:57:51,713 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:51,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147383476] [2022-02-20 23:57:51,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:51,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:51,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 23:57:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:51,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {3845#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3846#(= |node_create_~temp~0#1.offset| 0)} is VALID [2022-02-20 23:57:51,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {3846#(= |node_create_~temp~0#1.offset| 0)} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3846#(= |node_create_~temp~0#1.offset| 0)} is VALID [2022-02-20 23:57:51,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {3846#(= |node_create_~temp~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {3847#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0))} is VALID [2022-02-20 23:57:51,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {3847#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {3848#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:51,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {3848#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {3848#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:51,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {3848#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3849#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:57:51,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {3849#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {3849#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:57:51,886 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3849#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {3823#true} #188#return; {3833#(and (= (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:57:51,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 23:57:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:51,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {3845#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:51,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:51,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:51,937 INFO L290 TraceCheckUtils]: 3: Hoare triple {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:51,939 INFO L290 TraceCheckUtils]: 4: Hoare triple {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:51,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3851#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:57:51,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {3851#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} assume true; {3851#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:57:51,941 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3851#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} {3835#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} #188#return; {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:57:51,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {3823#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {3823#true} is VALID [2022-02-20 23:57:51,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {3823#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {3823#true} is VALID [2022-02-20 23:57:51,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {3823#true} assume !!(dll_create_~len#1 > 0); {3823#true} is VALID [2022-02-20 23:57:51,947 INFO L272 TraceCheckUtils]: 3: Hoare triple {3823#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {3845#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:57:51,947 INFO L290 TraceCheckUtils]: 4: Hoare triple {3845#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3846#(= |node_create_~temp~0#1.offset| 0)} is VALID [2022-02-20 23:57:51,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {3846#(= |node_create_~temp~0#1.offset| 0)} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3846#(= |node_create_~temp~0#1.offset| 0)} is VALID [2022-02-20 23:57:51,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {3846#(= |node_create_~temp~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {3847#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0))} is VALID [2022-02-20 23:57:51,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {3847#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {3848#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:51,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {3848#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {3848#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:51,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {3848#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3849#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:57:51,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {3849#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {3849#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:57:51,951 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3849#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {3823#true} #188#return; {3833#(and (= (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:57:51,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {3833#(and (= (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_create_#t~ret4#1.base|)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {3834#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:57:51,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {3834#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {3834#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:57:51,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {3834#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3834#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:57:51,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {3834#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {3834#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:57:51,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {3834#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {3835#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:57:51,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {3835#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !!(dll_create_~len#1 > 0); {3835#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:57:51,954 INFO L272 TraceCheckUtils]: 18: Hoare triple {3835#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {3845#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:57:51,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {3845#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:51,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:51,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:51,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:51,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:51,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {3850#(and (= (store |old(#length)| |node_create_~temp~0#1.base| (select |#length| |node_create_~temp~0#1.base|)) |#length|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3851#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:57:51,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {3851#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} assume true; {3851#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} is VALID [2022-02-20 23:57:51,963 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3851#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |old(#valid)| (@diff |old(#length)| |#length|)) 0)))} {3835#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} #188#return; {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:57:51,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:57:51,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:57:51,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:57:51,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:57:51,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !(4 + (8 + dll_create_~head~0#1.offset) <= #length[dll_create_~head~0#1.base] && 0 <= 8 + dll_create_~head~0#1.offset); {3824#false} is VALID [2022-02-20 23:57:51,966 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:57:51,966 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:51,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147383476] [2022-02-20 23:57:51,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147383476] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:57:51,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982851061] [2022-02-20 23:57:51,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:51,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:51,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:57:51,968 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:57:51,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 23:57:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:52,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-20 23:57:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:52,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:52,159 INFO L390 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 [2022-02-20 23:57:52,165 INFO L390 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 [2022-02-20 23:57:52,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:57:52,572 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:57:52,588 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:57:52,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:57:52,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {3823#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {3823#true} is VALID [2022-02-20 23:57:52,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {3823#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {3823#true} is VALID [2022-02-20 23:57:52,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {3823#true} assume !!(dll_create_~len#1 > 0); {3823#true} is VALID [2022-02-20 23:57:52,622 INFO L272 TraceCheckUtils]: 3: Hoare triple {3823#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {3823#true} is VALID [2022-02-20 23:57:52,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {3823#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3848#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:52,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {3848#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3848#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:52,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {3848#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {3848#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:52,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {3848#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {3848#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:52,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {3848#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {3848#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:52,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {3848#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0) (<= (+ |node_create_~temp~0#1.offset| 12) (select |#length| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3849#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:57:52,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {3849#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {3849#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 23:57:52,627 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3849#(and (<= 12 (select |#length| |node_create_#res#1.base|)) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {3823#true} #188#return; {3833#(and (= (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:57:52,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {3833#(and (= (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_dll_create_#t~ret4#1.base|)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {3834#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:57:52,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {3834#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {3834#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:57:52,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {3834#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3834#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:57:52,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {3834#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {3834#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 23:57:52,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {3834#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {3835#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:57:52,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {3835#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !!(dll_create_~len#1 > 0); {3835#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:57:52,631 INFO L272 TraceCheckUtils]: 18: Hoare triple {3835#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {3909#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:57:52,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {3909#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3913#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:52,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {3913#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3913#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:52,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {3913#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {3913#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:52,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {3913#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {3913#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:52,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {3913#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {3913#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:52,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {3913#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3913#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:52,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {3913#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume true; {3913#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:52,635 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3913#(exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))))} {3835#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} #188#return; {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:57:52,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:57:52,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:57:52,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:57:52,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 23:57:52,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {3844#(and (<= 12 (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !(4 + (8 + dll_create_~head~0#1.offset) <= #length[dll_create_~head~0#1.base] && 0 <= 8 + dll_create_~head~0#1.offset); {3824#false} is VALID [2022-02-20 23:57:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:57:52,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:57:52,820 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982851061] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:57:52,820 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:57:52,820 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 14 [2022-02-20 23:57:52,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91208467] [2022-02-20 23:57:52,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:57:52,821 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-02-20 23:57:52,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:52,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:52,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:52,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:57:52,858 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:52,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:57:52,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:57:52,859 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:53,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:53,766 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:57:53,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:57:53,766 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-02-20 23:57:53,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:53,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:53,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-02-20 23:57:53,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-02-20 23:57:53,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2022-02-20 23:57:53,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:53,853 INFO L225 Difference]: With dead ends: 102 [2022-02-20 23:57:53,853 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 23:57:53,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:57:53,854 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 112 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:53,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 395 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 449 Invalid, 0 Unknown, 49 Unchecked, 0.3s Time] [2022-02-20 23:57:53,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 23:57:53,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-02-20 23:57:53,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:53,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 101 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:53,866 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 101 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:53,868 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 101 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:53,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:53,874 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:57:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-02-20 23:57:53,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:53,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:53,875 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 102 states. [2022-02-20 23:57:53,875 INFO L87 Difference]: Start difference. First operand has 101 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 102 states. [2022-02-20 23:57:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:53,877 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:57:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-02-20 23:57:53,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:53,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:53,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:53,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:53,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-02-20 23:57:53,879 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 32 [2022-02-20 23:57:53,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:53,879 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-02-20 23:57:53,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:57:53,879 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-02-20 23:57:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 23:57:53,880 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:53,880 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:53,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 23:57:54,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:54,080 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:57:54,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:54,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2135424312, now seen corresponding path program 2 times [2022-02-20 23:57:54,081 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:54,081 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530838922] [2022-02-20 23:57:54,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:54,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:54,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 23:57:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:54,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {4416#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,168 INFO L290 TraceCheckUtils]: 3: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,169 INFO L290 TraceCheckUtils]: 4: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4418#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 23:57:54,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {4418#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} assume true; {4418#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 23:57:54,170 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4418#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} {4387#true} #188#return; {4397#(not (= |ULTIMATE.start_dll_create_#t~ret4#1.base| 0))} is VALID [2022-02-20 23:57:54,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 23:57:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:54,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {4416#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4387#true} is VALID [2022-02-20 23:57:54,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {4387#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4387#true} is VALID [2022-02-20 23:57:54,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {4387#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {4387#true} is VALID [2022-02-20 23:57:54,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {4387#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {4387#true} is VALID [2022-02-20 23:57:54,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {4387#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {4387#true} is VALID [2022-02-20 23:57:54,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {4387#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4387#true} is VALID [2022-02-20 23:57:54,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {4387#true} assume true; {4387#true} is VALID [2022-02-20 23:57:54,183 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4387#true} {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} #188#return; {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-20 23:57:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:54,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {4416#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4387#true} is VALID [2022-02-20 23:57:54,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {4387#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4387#true} is VALID [2022-02-20 23:57:54,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {4387#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {4387#true} is VALID [2022-02-20 23:57:54,204 INFO L290 TraceCheckUtils]: 3: Hoare triple {4387#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {4387#true} is VALID [2022-02-20 23:57:54,204 INFO L290 TraceCheckUtils]: 4: Hoare triple {4387#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {4387#true} is VALID [2022-02-20 23:57:54,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {4387#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4387#true} is VALID [2022-02-20 23:57:54,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {4387#true} assume true; {4387#true} is VALID [2022-02-20 23:57:54,204 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4387#true} {4388#false} #190#return; {4388#false} is VALID [2022-02-20 23:57:54,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {4387#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {4387#true} is VALID [2022-02-20 23:57:54,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {4387#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {4387#true} is VALID [2022-02-20 23:57:54,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {4387#true} assume !!(dll_create_~len#1 > 0); {4387#true} is VALID [2022-02-20 23:57:54,205 INFO L272 TraceCheckUtils]: 3: Hoare triple {4387#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {4416#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:57:54,206 INFO L290 TraceCheckUtils]: 4: Hoare triple {4416#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4418#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 23:57:54,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {4418#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} assume true; {4418#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 23:57:54,211 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4418#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} {4387#true} #188#return; {4397#(not (= |ULTIMATE.start_dll_create_#t~ret4#1.base| 0))} is VALID [2022-02-20 23:57:54,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {4397#(not (= |ULTIMATE.start_dll_create_#t~ret4#1.base| 0))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !!(dll_create_~len#1 > 0); {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,214 INFO L272 TraceCheckUtils]: 18: Hoare triple {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {4416#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:57:54,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {4416#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4387#true} is VALID [2022-02-20 23:57:54,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {4387#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4387#true} is VALID [2022-02-20 23:57:54,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {4387#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {4387#true} is VALID [2022-02-20 23:57:54,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {4387#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {4387#true} is VALID [2022-02-20 23:57:54,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {4387#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {4387#true} is VALID [2022-02-20 23:57:54,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {4387#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4387#true} is VALID [2022-02-20 23:57:54,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {4387#true} assume true; {4387#true} is VALID [2022-02-20 23:57:54,215 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4387#true} {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} #188#return; {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {4388#false} is VALID [2022-02-20 23:57:54,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {4388#false} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {4388#false} is VALID [2022-02-20 23:57:54,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {4388#false} assume !(dll_create_~len#1 > 0); {4388#false} is VALID [2022-02-20 23:57:54,217 INFO L290 TraceCheckUtils]: 33: Hoare triple {4388#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {4388#false} is VALID [2022-02-20 23:57:54,217 INFO L290 TraceCheckUtils]: 34: Hoare triple {4388#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {4388#false} is VALID [2022-02-20 23:57:54,217 INFO L272 TraceCheckUtils]: 35: Hoare triple {4388#false} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {4416#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:57:54,217 INFO L290 TraceCheckUtils]: 36: Hoare triple {4416#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4387#true} is VALID [2022-02-20 23:57:54,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {4387#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4387#true} is VALID [2022-02-20 23:57:54,217 INFO L290 TraceCheckUtils]: 38: Hoare triple {4387#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {4387#true} is VALID [2022-02-20 23:57:54,217 INFO L290 TraceCheckUtils]: 39: Hoare triple {4387#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {4387#true} is VALID [2022-02-20 23:57:54,217 INFO L290 TraceCheckUtils]: 40: Hoare triple {4387#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {4387#true} is VALID [2022-02-20 23:57:54,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {4387#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4387#true} is VALID [2022-02-20 23:57:54,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {4387#true} assume true; {4387#true} is VALID [2022-02-20 23:57:54,217 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4387#true} {4388#false} #190#return; {4388#false} is VALID [2022-02-20 23:57:54,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {4388#false} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {4388#false} is VALID [2022-02-20 23:57:54,218 INFO L290 TraceCheckUtils]: 45: Hoare triple {4388#false} assume !(1 == #valid[dll_append_~head#1.base]); {4388#false} is VALID [2022-02-20 23:57:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:57:54,218 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:54,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530838922] [2022-02-20 23:57:54,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530838922] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:57:54,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406394067] [2022-02-20 23:57:54,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:57:54,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:54,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:57:54,223 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:57:54,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 23:57:54,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:57:54,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:57:54,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:57:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:54,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:54,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {4387#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {4387#true} is VALID [2022-02-20 23:57:54,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {4387#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {4387#true} is VALID [2022-02-20 23:57:54,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {4387#true} assume !!(dll_create_~len#1 > 0); {4387#true} is VALID [2022-02-20 23:57:54,517 INFO L272 TraceCheckUtils]: 3: Hoare triple {4387#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {4387#true} is VALID [2022-02-20 23:57:54,518 INFO L290 TraceCheckUtils]: 4: Hoare triple {4387#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4418#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 23:57:54,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {4418#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} assume true; {4418#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 23:57:54,521 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4418#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} {4387#true} #188#return; {4397#(not (= |ULTIMATE.start_dll_create_#t~ret4#1.base| 0))} is VALID [2022-02-20 23:57:54,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {4397#(not (= |ULTIMATE.start_dll_create_#t~ret4#1.base| 0))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !!(dll_create_~len#1 > 0); {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,522 INFO L272 TraceCheckUtils]: 18: Hoare triple {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {4387#true} is VALID [2022-02-20 23:57:54,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {4387#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4387#true} is VALID [2022-02-20 23:57:54,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {4387#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4387#true} is VALID [2022-02-20 23:57:54,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {4387#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {4387#true} is VALID [2022-02-20 23:57:54,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {4387#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {4387#true} is VALID [2022-02-20 23:57:54,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {4387#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {4387#true} is VALID [2022-02-20 23:57:54,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {4387#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4387#true} is VALID [2022-02-20 23:57:54,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {4387#true} assume true; {4387#true} is VALID [2022-02-20 23:57:54,523 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4387#true} {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} #188#return; {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {4388#false} is VALID [2022-02-20 23:57:54,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {4388#false} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {4388#false} is VALID [2022-02-20 23:57:54,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {4388#false} assume !(dll_create_~len#1 > 0); {4388#false} is VALID [2022-02-20 23:57:54,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {4388#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {4388#false} is VALID [2022-02-20 23:57:54,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {4388#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {4388#false} is VALID [2022-02-20 23:57:54,525 INFO L272 TraceCheckUtils]: 35: Hoare triple {4388#false} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {4388#false} is VALID [2022-02-20 23:57:54,525 INFO L290 TraceCheckUtils]: 36: Hoare triple {4388#false} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4388#false} is VALID [2022-02-20 23:57:54,525 INFO L290 TraceCheckUtils]: 37: Hoare triple {4388#false} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4388#false} is VALID [2022-02-20 23:57:54,525 INFO L290 TraceCheckUtils]: 38: Hoare triple {4388#false} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {4388#false} is VALID [2022-02-20 23:57:54,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {4388#false} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {4388#false} is VALID [2022-02-20 23:57:54,525 INFO L290 TraceCheckUtils]: 40: Hoare triple {4388#false} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {4388#false} is VALID [2022-02-20 23:57:54,525 INFO L290 TraceCheckUtils]: 41: Hoare triple {4388#false} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4388#false} is VALID [2022-02-20 23:57:54,526 INFO L290 TraceCheckUtils]: 42: Hoare triple {4388#false} assume true; {4388#false} is VALID [2022-02-20 23:57:54,526 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4388#false} {4388#false} #190#return; {4388#false} is VALID [2022-02-20 23:57:54,526 INFO L290 TraceCheckUtils]: 44: Hoare triple {4388#false} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {4388#false} is VALID [2022-02-20 23:57:54,526 INFO L290 TraceCheckUtils]: 45: Hoare triple {4388#false} assume !(1 == #valid[dll_append_~head#1.base]); {4388#false} is VALID [2022-02-20 23:57:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:57:54,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:57:54,761 INFO L290 TraceCheckUtils]: 45: Hoare triple {4388#false} assume !(1 == #valid[dll_append_~head#1.base]); {4388#false} is VALID [2022-02-20 23:57:54,761 INFO L290 TraceCheckUtils]: 44: Hoare triple {4388#false} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {4388#false} is VALID [2022-02-20 23:57:54,761 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4387#true} {4388#false} #190#return; {4388#false} is VALID [2022-02-20 23:57:54,761 INFO L290 TraceCheckUtils]: 42: Hoare triple {4387#true} assume true; {4387#true} is VALID [2022-02-20 23:57:54,761 INFO L290 TraceCheckUtils]: 41: Hoare triple {4387#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4387#true} is VALID [2022-02-20 23:57:54,761 INFO L290 TraceCheckUtils]: 40: Hoare triple {4387#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {4387#true} is VALID [2022-02-20 23:57:54,761 INFO L290 TraceCheckUtils]: 39: Hoare triple {4387#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {4387#true} is VALID [2022-02-20 23:57:54,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {4387#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {4387#true} is VALID [2022-02-20 23:57:54,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {4387#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4387#true} is VALID [2022-02-20 23:57:54,761 INFO L290 TraceCheckUtils]: 36: Hoare triple {4387#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4387#true} is VALID [2022-02-20 23:57:54,762 INFO L272 TraceCheckUtils]: 35: Hoare triple {4388#false} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {4387#true} is VALID [2022-02-20 23:57:54,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {4388#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {4388#false} is VALID [2022-02-20 23:57:54,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {4388#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {4388#false} is VALID [2022-02-20 23:57:54,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {4388#false} assume !(dll_create_~len#1 > 0); {4388#false} is VALID [2022-02-20 23:57:54,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {4388#false} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {4388#false} is VALID [2022-02-20 23:57:54,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {4388#false} is VALID [2022-02-20 23:57:54,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,766 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4387#true} {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} #188#return; {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {4387#true} assume true; {4387#true} is VALID [2022-02-20 23:57:54,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {4387#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4387#true} is VALID [2022-02-20 23:57:54,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {4387#true} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {4387#true} is VALID [2022-02-20 23:57:54,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {4387#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {4387#true} is VALID [2022-02-20 23:57:54,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {4387#true} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {4387#true} is VALID [2022-02-20 23:57:54,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {4387#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4387#true} is VALID [2022-02-20 23:57:54,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {4387#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4387#true} is VALID [2022-02-20 23:57:54,767 INFO L272 TraceCheckUtils]: 18: Hoare triple {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {4387#true} is VALID [2022-02-20 23:57:54,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !!(dll_create_~len#1 > 0); {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {4399#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {4397#(not (= |ULTIMATE.start_dll_create_#t~ret4#1.base| 0))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {4398#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 23:57:54,777 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4418#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} {4387#true} #188#return; {4397#(not (= |ULTIMATE.start_dll_create_#t~ret4#1.base| 0))} is VALID [2022-02-20 23:57:54,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {4418#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} assume true; {4418#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 23:57:54,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4418#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 23:57:54,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,780 INFO L290 TraceCheckUtils]: 4: Hoare triple {4387#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4417#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 23:57:54,780 INFO L272 TraceCheckUtils]: 3: Hoare triple {4387#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {4387#true} is VALID [2022-02-20 23:57:54,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {4387#true} assume !!(dll_create_~len#1 > 0); {4387#true} is VALID [2022-02-20 23:57:54,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {4387#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {4387#true} is VALID [2022-02-20 23:57:54,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {4387#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {4387#true} is VALID [2022-02-20 23:57:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:57:54,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406394067] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:57:54,780 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:57:54,781 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2022-02-20 23:57:54,781 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92991363] [2022-02-20 23:57:54,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:57:54,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2022-02-20 23:57:54,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:57:54,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:57:54,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:54,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:57:54,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:57:54,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:57:54,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:57:54,816 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:57:55,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:55,250 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-02-20 23:57:55,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:57:55,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2022-02-20 23:57:55,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:57:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:57:55,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2022-02-20 23:57:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:57:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2022-02-20 23:57:55,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 110 transitions. [2022-02-20 23:57:55,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:57:55,325 INFO L225 Difference]: With dead ends: 101 [2022-02-20 23:57:55,325 INFO L226 Difference]: Without dead ends: 101 [2022-02-20 23:57:55,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:57:55,326 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 170 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:57:55,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 414 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:57:55,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-20 23:57:55,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-02-20 23:57:55,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:57:55,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:55,328 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:55,328 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:55,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:55,330 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-02-20 23:57:55,330 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-02-20 23:57:55,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:55,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:55,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 101 states. [2022-02-20 23:57:55,331 INFO L87 Difference]: Start difference. First operand has 101 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 101 states. [2022-02-20 23:57:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:57:55,332 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-02-20 23:57:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-02-20 23:57:55,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:57:55,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:57:55,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:57:55,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:57:55,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:57:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2022-02-20 23:57:55,334 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 46 [2022-02-20 23:57:55,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:57:55,334 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2022-02-20 23:57:55,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:57:55,334 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-02-20 23:57:55,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 23:57:55,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:57:55,335 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:57:55,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:57:55,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:55,551 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:57:55,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:57:55,552 INFO L85 PathProgramCache]: Analyzing trace with hash 568631680, now seen corresponding path program 1 times [2022-02-20 23:57:55,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:57:55,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396728713] [2022-02-20 23:57:55,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:55,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:57:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:55,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 23:57:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:55,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {5131#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,676 INFO L290 TraceCheckUtils]: 3: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,676 INFO L290 TraceCheckUtils]: 4: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5133#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:55,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {5133#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {5133#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:55,679 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5133#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #188#return; {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:57:55,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 23:57:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:55,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {5131#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,702 INFO L290 TraceCheckUtils]: 3: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,703 INFO L290 TraceCheckUtils]: 4: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5133#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:55,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {5133#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {5133#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:55,705 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5133#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #188#return; {5121#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:55,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-20 23:57:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:55,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {5131#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:55,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:55,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:55,751 INFO L290 TraceCheckUtils]: 3: Hoare triple {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:55,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:55,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5135#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:55,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {5135#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {5135#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:55,754 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5135#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {5122#(= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1)} #190#return; {5122#(= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1)} is VALID [2022-02-20 23:57:55,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {5102#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {5102#true} is VALID [2022-02-20 23:57:55,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {5102#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:57:55,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume !!(dll_create_~len#1 > 0); {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:57:55,757 INFO L272 TraceCheckUtils]: 3: Hoare triple {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {5131#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:57:55,757 INFO L290 TraceCheckUtils]: 4: Hoare triple {5131#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5133#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:55,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {5133#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {5133#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:55,762 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5133#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #188#return; {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:57:55,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:57:55,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:57:55,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:57:55,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:57:55,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:57:55,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume !!(dll_create_~len#1 > 0); {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:57:55,765 INFO L272 TraceCheckUtils]: 18: Hoare triple {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {5131#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:57:55,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {5131#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:57:55,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {5132#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5133#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:55,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {5133#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {5133#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:55,770 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5133#(and (or (<= (+ (@diff |old(#valid)| |#valid|) 1) |#StackHeapBarrier|) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {5104#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #188#return; {5121#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:55,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {5121#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {5121#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:55,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {5121#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4); srcloc: L589 {5121#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:55,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {5121#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4); srcloc: L589-1 {5121#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:55,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {5121#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0; {5121#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:55,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {5121#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); srcloc: L592 {5121#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:55,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {5121#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {5121#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:55,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {5121#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(dll_create_~len#1 > 0); {5121#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:55,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {5121#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {5121#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:57:55,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {5121#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {5122#(= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1)} is VALID [2022-02-20 23:57:55,776 INFO L272 TraceCheckUtils]: 36: Hoare triple {5122#(= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1)} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {5131#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:57:55,776 INFO L290 TraceCheckUtils]: 37: Hoare triple {5131#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:55,777 INFO L290 TraceCheckUtils]: 38: Hoare triple {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:55,777 INFO L290 TraceCheckUtils]: 39: Hoare triple {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4); srcloc: L577-1 {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:55,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4); srcloc: L580 {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:55,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} SUMMARY for call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4); srcloc: L581 {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 23:57:55,779 INFO L290 TraceCheckUtils]: 42: Hoare triple {5134#(and (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5135#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:55,780 INFO L290 TraceCheckUtils]: 43: Hoare triple {5135#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} assume true; {5135#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} is VALID [2022-02-20 23:57:55,781 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5135#(and (or (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0) (= |old(#valid)| |#valid|)) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))} {5122#(= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1)} #190#return; {5122#(= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1)} is VALID [2022-02-20 23:57:55,781 INFO L290 TraceCheckUtils]: 45: Hoare triple {5122#(= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1)} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {5122#(= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1)} is VALID [2022-02-20 23:57:55,781 INFO L290 TraceCheckUtils]: 46: Hoare triple {5122#(= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1)} assume !(1 == #valid[dll_append_~head#1.base]); {5103#false} is VALID [2022-02-20 23:57:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 23:57:55,782 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:57:55,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396728713] [2022-02-20 23:57:55,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396728713] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:57:55,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502004287] [2022-02-20 23:57:55,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:57:55,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:57:55,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:57:55,783 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:57:55,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 23:57:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:55,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 23:57:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:57:55,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:57:55,957 INFO L390 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 [2022-02-20 23:57:56,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:57:56,272 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 23:57:56,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:57:56,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-20 23:57:56,474 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 209641 column 46: unknown constant v_#valid_BEFORE_CALL_10 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 23:57:56,477 INFO L158 Benchmark]: Toolchain (without parser) took 11982.59ms. Allocated memory was 96.5MB in the beginning and 174.1MB in the end (delta: 77.6MB). Free memory was 65.4MB in the beginning and 119.9MB in the end (delta: -54.5MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2022-02-20 23:57:56,478 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:57:56,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.16ms. Allocated memory is still 96.5MB. Free memory was 65.2MB in the beginning and 63.1MB in the end (delta: 2.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:57:56,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.89ms. Allocated memory is still 96.5MB. Free memory was 63.1MB in the beginning and 60.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:57:56,478 INFO L158 Benchmark]: Boogie Preprocessor took 39.59ms. Allocated memory is still 96.5MB. Free memory was 60.7MB in the beginning and 58.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:57:56,478 INFO L158 Benchmark]: RCFGBuilder took 561.85ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 58.2MB in the beginning and 84.0MB in the end (delta: -25.8MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2022-02-20 23:57:56,478 INFO L158 Benchmark]: TraceAbstraction took 10967.75ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 83.4MB in the beginning and 119.9MB in the end (delta: -36.5MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2022-02-20 23:57:56,479 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.16ms. Allocated memory is still 96.5MB. Free memory was 65.2MB in the beginning and 63.1MB in the end (delta: 2.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.89ms. Allocated memory is still 96.5MB. Free memory was 63.1MB in the beginning and 60.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.59ms. Allocated memory is still 96.5MB. Free memory was 60.7MB in the beginning and 58.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 561.85ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 58.2MB in the beginning and 84.0MB in the end (delta: -25.8MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10967.75ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 83.4MB in the beginning and 119.9MB in the end (delta: -36.5MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 209641 column 46: unknown constant v_#valid_BEFORE_CALL_10 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 209641 column 46: unknown constant v_#valid_BEFORE_CALL_10: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 23:57:56,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:57:58,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:57:58,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:57:58,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:57:58,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:57:58,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:57:58,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:57:58,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:57:58,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:57:58,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:57:58,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:57:58,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:57:58,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:57:58,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:57:58,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:57:58,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:57:58,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:57:58,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:57:58,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:57:58,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:57:58,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:57:58,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:57:58,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:57:58,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:57:58,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:57:58,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:57:58,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:57:58,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:57:58,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:57:58,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:57:58,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:57:58,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:57:58,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:57:58,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:57:58,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:57:58,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:57:58,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:57:58,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:57:58,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:57:58,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:57:58,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:57:58,202 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:57:58,230 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:57:58,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:57:58,231 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:57:58,231 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:57:58,232 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:57:58,232 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:57:58,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:57:58,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:57:58,233 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:57:58,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:57:58,234 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:57:58,234 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:57:58,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:57:58,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:57:58,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:57:58,235 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:57:58,235 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:57:58,235 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:57:58,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:57:58,235 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:57:58,235 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:57:58,236 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:57:58,236 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:57:58,236 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:57:58,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:57:58,236 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:57:58,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:57:58,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:57:58,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:57:58,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:57:58,237 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:57:58,237 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:57:58,237 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:57:58,237 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2022-02-20 23:57:58,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:57:58,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:57:58,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:57:58,503 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:57:58,503 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:57:58,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-02-20 23:57:58,559 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9760373c6/a256d74e8245433584a6fdc91f36e0fa/FLAG83aab9608 [2022-02-20 23:57:58,956 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:57:58,957 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-02-20 23:57:58,965 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9760373c6/a256d74e8245433584a6fdc91f36e0fa/FLAG83aab9608 [2022-02-20 23:57:58,973 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9760373c6/a256d74e8245433584a6fdc91f36e0fa [2022-02-20 23:57:58,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:57:58,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:57:58,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:57:58,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:57:58,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:57:58,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:57:58" (1/1) ... [2022-02-20 23:57:58,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52307548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:58, skipping insertion in model container [2022-02-20 23:57:58,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:57:58" (1/1) ... [2022-02-20 23:57:59,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:57:59,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:57:59,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2022-02-20 23:57:59,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:57:59,345 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:57:59,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2022-02-20 23:57:59,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:57:59,427 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:57:59,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:59 WrapperNode [2022-02-20 23:57:59,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:57:59,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:57:59,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:57:59,430 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:57:59,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:59" (1/1) ... [2022-02-20 23:57:59,468 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:59" (1/1) ... [2022-02-20 23:57:59,507 INFO L137 Inliner]: procedures = 130, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2022-02-20 23:57:59,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:57:59,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:57:59,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:57:59,508 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:57:59,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:59" (1/1) ... [2022-02-20 23:57:59,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:59" (1/1) ... [2022-02-20 23:57:59,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:59" (1/1) ... [2022-02-20 23:57:59,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:59" (1/1) ... [2022-02-20 23:57:59,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:59" (1/1) ... [2022-02-20 23:57:59,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:59" (1/1) ... [2022-02-20 23:57:59,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:59" (1/1) ... [2022-02-20 23:57:59,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:57:59,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:57:59,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:57:59,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:57:59,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:59" (1/1) ... [2022-02-20 23:57:59,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:57:59,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:57:59,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:57:59,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:57:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:57:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 23:57:59,632 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 23:57:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:57:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:57:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:57:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:57:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:57:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:57:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:57:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:57:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:57:59,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:57:59,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:57:59,771 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:57:59,772 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:58:00,242 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:58:00,247 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:58:00,248 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 23:58:00,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:58:00 BoogieIcfgContainer [2022-02-20 23:58:00,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:58:00,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:58:00,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:58:00,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:58:00,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:57:58" (1/3) ... [2022-02-20 23:58:00,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d89a2d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:58:00, skipping insertion in model container [2022-02-20 23:58:00,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:57:59" (2/3) ... [2022-02-20 23:58:00,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d89a2d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:58:00, skipping insertion in model container [2022-02-20 23:58:00,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:58:00" (3/3) ... [2022-02-20 23:58:00,263 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2022-02-20 23:58:00,267 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:58:00,267 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2022-02-20 23:58:00,298 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:58:00,302 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:58:00,302 INFO L340 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2022-02-20 23:58:00,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 57 states have (on average 2.087719298245614) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:00,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:58:00,325 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:00,325 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:00,326 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:58:00,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:00,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1815964311, now seen corresponding path program 1 times [2022-02-20 23:58:00,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:00,339 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423388337] [2022-02-20 23:58:00,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:00,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:00,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:00,342 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:58:00,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:58:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:00,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:58:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:00,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:00,527 INFO L390 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 [2022-02-20 23:58:00,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {111#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {111#true} is VALID [2022-02-20 23:58:00,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {111#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {111#true} is VALID [2022-02-20 23:58:00,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {111#true} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {111#true} is VALID [2022-02-20 23:58:00,549 INFO L272 TraceCheckUtils]: 3: Hoare triple {111#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {111#true} is VALID [2022-02-20 23:58:00,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {111#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {128#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:00,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {128#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {128#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:00,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[~temp~0#1.base]); {112#false} is VALID [2022-02-20 23:58:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:00,552 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:00,552 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:00,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423388337] [2022-02-20 23:58:00,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423388337] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:00,553 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:00,554 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:58:00,555 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763416852] [2022-02-20 23:58:00,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:00,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:58:00,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:00,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:00,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:00,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:58:00,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:00,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:58:00,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:00,594 INFO L87 Difference]: Start difference. First operand has 108 states, 57 states have (on average 2.087719298245614) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:00,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:00,979 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2022-02-20 23:58:00,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:58:00,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:58:00,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-20 23:58:00,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:00,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-20 23:58:00,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 123 transitions. [2022-02-20 23:58:01,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:01,134 INFO L225 Difference]: With dead ends: 105 [2022-02-20 23:58:01,134 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 23:58:01,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:01,141 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:01,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 164 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:01,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 23:58:01,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-02-20 23:58:01,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:01,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:01,179 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:01,180 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:01,184 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2022-02-20 23:58:01,185 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-02-20 23:58:01,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:01,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:01,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 102 states. [2022-02-20 23:58:01,186 INFO L87 Difference]: Start difference. First operand has 102 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 102 states. [2022-02-20 23:58:01,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:01,190 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2022-02-20 23:58:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-02-20 23:58:01,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:01,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:01,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:01,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:01,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2022-02-20 23:58:01,196 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 7 [2022-02-20 23:58:01,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:01,197 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2022-02-20 23:58:01,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:01,197 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-02-20 23:58:01,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:58:01,198 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:01,198 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:01,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:01,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:58:01,405 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:58:01,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:01,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1815964312, now seen corresponding path program 1 times [2022-02-20 23:58:01,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:01,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619015010] [2022-02-20 23:58:01,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:01,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:01,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:01,407 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:58:01,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:58:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:01,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:58:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:01,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:01,481 INFO L390 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 [2022-02-20 23:58:01,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {545#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {545#true} is VALID [2022-02-20 23:58:01,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {545#true} is VALID [2022-02-20 23:58:01,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {545#true} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {545#true} is VALID [2022-02-20 23:58:01,503 INFO L272 TraceCheckUtils]: 3: Hoare triple {545#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {545#true} is VALID [2022-02-20 23:58:01,504 INFO L290 TraceCheckUtils]: 4: Hoare triple {545#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {562#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:01,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {562#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {562#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:01,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {562#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, ~temp~0#1.offset)), #length[~temp~0#1.base]) && ~bvule32(~bvadd32(4bv32, ~temp~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, ~temp~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, ~temp~0#1.offset))); {546#false} is VALID [2022-02-20 23:58:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:01,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:01,505 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:01,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619015010] [2022-02-20 23:58:01,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619015010] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:01,505 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:01,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:58:01,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533161150] [2022-02-20 23:58:01,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:01,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:58:01,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:01,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:01,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:01,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:58:01,513 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:01,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:58:01,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:01,514 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:01,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:01,902 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-02-20 23:58:01,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:58:01,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:58:01,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:01,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:01,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-20 23:58:01,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:01,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-20 23:58:01,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-02-20 23:58:02,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:02,038 INFO L225 Difference]: With dead ends: 99 [2022-02-20 23:58:02,038 INFO L226 Difference]: Without dead ends: 99 [2022-02-20 23:58:02,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:02,039 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:02,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 164 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-20 23:58:02,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-02-20 23:58:02,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:02,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 99 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:02,044 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 99 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:02,044 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 99 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:02,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:02,047 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-02-20 23:58:02,047 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-02-20 23:58:02,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:02,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:02,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 99 states. [2022-02-20 23:58:02,049 INFO L87 Difference]: Start difference. First operand has 99 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 99 states. [2022-02-20 23:58:02,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:02,051 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-02-20 23:58:02,052 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-02-20 23:58:02,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:02,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:02,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:02,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:02,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2022-02-20 23:58:02,055 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 7 [2022-02-20 23:58:02,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:02,056 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2022-02-20 23:58:02,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:58:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-02-20 23:58:02,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:58:02,056 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:02,057 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:02,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:02,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:58:02,265 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:58:02,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:02,266 INFO L85 PathProgramCache]: Analyzing trace with hash -418267899, now seen corresponding path program 1 times [2022-02-20 23:58:02,266 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:02,266 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806682994] [2022-02-20 23:58:02,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:02,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:02,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:02,268 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:58:02,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:58:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:02,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:58:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:02,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:02,364 INFO L390 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 [2022-02-20 23:58:02,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {964#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {964#true} is VALID [2022-02-20 23:58:02,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {964#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {964#true} is VALID [2022-02-20 23:58:02,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {964#true} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {964#true} is VALID [2022-02-20 23:58:02,475 INFO L272 TraceCheckUtils]: 3: Hoare triple {964#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {964#true} is VALID [2022-02-20 23:58:02,475 INFO L290 TraceCheckUtils]: 4: Hoare triple {964#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {981#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:02,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {981#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {981#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:02,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {981#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {981#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:02,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {981#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {981#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:02,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {981#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {981#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:02,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {981#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {997#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:02,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {997#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)))} assume true; {997#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:02,486 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {997#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)))} {964#true} #188#return; {1004#(and (= |ULTIMATE.start_dll_create_#t~ret4#1.offset| (_ bv0 32)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_dll_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:58:02,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {1004#(and (= |ULTIMATE.start_dll_create_#t~ret4#1.offset| (_ bv0 32)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_dll_create_#t~ret4#1.base|)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {1008#(and (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:02,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {1008#(and (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, dll_create_~new_head~0#1.offset), #length[dll_create_~new_head~0#1.base]) && ~bvule32(dll_create_~new_head~0#1.offset, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset))) && ~bvule32(0bv32, dll_create_~new_head~0#1.offset)); {965#false} is VALID [2022-02-20 23:58:02,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:02,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:02,488 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:02,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806682994] [2022-02-20 23:58:02,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806682994] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:02,488 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:02,489 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:58:02,489 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650115841] [2022-02-20 23:58:02,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:02,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 23:58:02,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:02,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:02,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:02,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:58:02,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:02,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:58:02,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:58:02,512 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:03,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:03,720 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-02-20 23:58:03,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:58:03,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 23:58:03,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:03,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2022-02-20 23:58:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2022-02-20 23:58:03,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 116 transitions. [2022-02-20 23:58:03,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:03,825 INFO L225 Difference]: With dead ends: 102 [2022-02-20 23:58:03,825 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 23:58:03,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:03,826 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 16 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:03,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 340 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:58:03,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 23:58:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2022-02-20 23:58:03,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:03,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 97 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 93 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:03,830 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 97 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 93 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:03,830 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 97 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 93 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:03,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:03,833 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-02-20 23:58:03,833 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2022-02-20 23:58:03,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:03,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:03,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 93 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 102 states. [2022-02-20 23:58:03,834 INFO L87 Difference]: Start difference. First operand has 97 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 93 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 102 states. [2022-02-20 23:58:03,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:03,837 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-02-20 23:58:03,837 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2022-02-20 23:58:03,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:03,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:03,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:03,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 93 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-02-20 23:58:03,842 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 14 [2022-02-20 23:58:03,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:03,843 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-02-20 23:58:03,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-02-20 23:58:03,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:58:03,843 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:03,843 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:03,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 23:58:04,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:58:04,052 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:58:04,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:04,052 INFO L85 PathProgramCache]: Analyzing trace with hash -418267900, now seen corresponding path program 1 times [2022-02-20 23:58:04,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:04,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837069253] [2022-02-20 23:58:04,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:04,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:04,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:04,053 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:58:04,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:58:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:04,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:58:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:04,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:04,146 INFO L390 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 [2022-02-20 23:58:04,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {1416#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {1416#true} is VALID [2022-02-20 23:58:04,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {1416#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {1416#true} is VALID [2022-02-20 23:58:04,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {1416#true} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {1416#true} is VALID [2022-02-20 23:58:04,194 INFO L272 TraceCheckUtils]: 3: Hoare triple {1416#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {1416#true} is VALID [2022-02-20 23:58:04,195 INFO L290 TraceCheckUtils]: 4: Hoare triple {1416#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1433#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {1433#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1433#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {1433#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {1433#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {1433#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {1433#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {1433#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {1433#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {1433#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1449#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {1449#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} assume true; {1449#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,198 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1449#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} {1416#true} #188#return; {1456#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|))} is VALID [2022-02-20 23:58:04,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {1456#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {1460#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:04,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {1460#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[dll_create_~new_head~0#1.base]); {1417#false} is VALID [2022-02-20 23:58:04,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:04,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:04,200 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:04,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837069253] [2022-02-20 23:58:04,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837069253] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:04,200 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:04,200 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:58:04,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089839043] [2022-02-20 23:58:04,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:04,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 23:58:04,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:04,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:04,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:04,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:58:04,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:04,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:58:04,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:58:04,222 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:05,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:05,183 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-02-20 23:58:05,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:58:05,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 23:58:05,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:05,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2022-02-20 23:58:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:05,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2022-02-20 23:58:05,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 114 transitions. [2022-02-20 23:58:05,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:05,294 INFO L225 Difference]: With dead ends: 100 [2022-02-20 23:58:05,294 INFO L226 Difference]: Without dead ends: 100 [2022-02-20 23:58:05,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:05,295 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 14 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:05,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 324 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:58:05,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-20 23:58:05,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-02-20 23:58:05,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:05,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 95 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 91 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:05,298 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 95 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 91 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:05,299 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 95 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 91 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:05,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:05,301 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-02-20 23:58:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2022-02-20 23:58:05,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:05,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:05,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 91 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 100 states. [2022-02-20 23:58:05,301 INFO L87 Difference]: Start difference. First operand has 95 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 91 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 100 states. [2022-02-20 23:58:05,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:05,305 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-02-20 23:58:05,305 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2022-02-20 23:58:05,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:05,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:05,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:05,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 91 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2022-02-20 23:58:05,320 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 14 [2022-02-20 23:58:05,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:05,321 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2022-02-20 23:58:05,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:05,321 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2022-02-20 23:58:05,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:58:05,321 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:05,321 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:05,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:05,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:58:05,532 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:58:05,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:05,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1186059880, now seen corresponding path program 1 times [2022-02-20 23:58:05,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:05,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551174521] [2022-02-20 23:58:05,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:05,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:05,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:05,534 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:58:05,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:58:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:05,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:58:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:05,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:05,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {1860#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {1860#true} is VALID [2022-02-20 23:58:05,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {1860#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {1868#(= (_ bv2 32) |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:05,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {1868#(= (_ bv2 32) |ULTIMATE.start_dll_create_~len#1|)} assume !~bvsgt32(dll_create_~len#1, 0bv32); {1861#false} is VALID [2022-02-20 23:58:05,646 INFO L290 TraceCheckUtils]: 3: Hoare triple {1861#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {1861#false} is VALID [2022-02-20 23:58:05,646 INFO L290 TraceCheckUtils]: 4: Hoare triple {1861#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {1861#false} is VALID [2022-02-20 23:58:05,646 INFO L272 TraceCheckUtils]: 5: Hoare triple {1861#false} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {1861#false} is VALID [2022-02-20 23:58:05,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {1861#false} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1861#false} is VALID [2022-02-20 23:58:05,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {1861#false} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1861#false} is VALID [2022-02-20 23:58:05,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {1861#false} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {1861#false} is VALID [2022-02-20 23:58:05,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {1861#false} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {1861#false} is VALID [2022-02-20 23:58:05,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {1861#false} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {1861#false} is VALID [2022-02-20 23:58:05,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {1861#false} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1861#false} is VALID [2022-02-20 23:58:05,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {1861#false} assume true; {1861#false} is VALID [2022-02-20 23:58:05,647 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1861#false} {1861#false} #190#return; {1861#false} is VALID [2022-02-20 23:58:05,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {1861#false} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {1861#false} is VALID [2022-02-20 23:58:05,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {1861#false} assume !(1bv1 == #valid[dll_append_~head#1.base]); {1861#false} is VALID [2022-02-20 23:58:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:05,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:05,648 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:05,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551174521] [2022-02-20 23:58:05,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551174521] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:05,648 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:05,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:58:05,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124764501] [2022-02-20 23:58:05,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:05,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:58:05,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:05,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:05,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:05,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:58:05,663 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:05,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:58:05,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:05,664 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:05,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:05,891 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-02-20 23:58:05,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:58:05,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:58:05,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2022-02-20 23:58:05,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:05,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2022-02-20 23:58:05,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 117 transitions. [2022-02-20 23:58:06,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:06,008 INFO L225 Difference]: With dead ends: 105 [2022-02-20 23:58:06,008 INFO L226 Difference]: Without dead ends: 105 [2022-02-20 23:58:06,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:06,009 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 9 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:06,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 203 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:58:06,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-02-20 23:58:06,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2022-02-20 23:58:06,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:06,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 96 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:06,012 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 96 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:06,013 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 96 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:06,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:06,015 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-02-20 23:58:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2022-02-20 23:58:06,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:06,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:06,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 105 states. [2022-02-20 23:58:06,015 INFO L87 Difference]: Start difference. First operand has 96 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 105 states. [2022-02-20 23:58:06,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:06,020 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-02-20 23:58:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2022-02-20 23:58:06,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:06,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:06,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:06,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:06,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2022-02-20 23:58:06,031 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 16 [2022-02-20 23:58:06,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:06,031 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2022-02-20 23:58:06,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:06,031 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-02-20 23:58:06,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:58:06,032 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:06,032 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:06,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:06,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:58:06,238 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:58:06,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:06,239 INFO L85 PathProgramCache]: Analyzing trace with hash -918895952, now seen corresponding path program 1 times [2022-02-20 23:58:06,239 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:06,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349388943] [2022-02-20 23:58:06,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:06,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:06,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:06,240 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:58:06,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:58:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:06,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:58:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:06,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:06,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {2321#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {2321#true} is VALID [2022-02-20 23:58:06,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {2321#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {2329#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:06,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {2329#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {2329#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:06,394 INFO L272 TraceCheckUtils]: 3: Hoare triple {2329#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {2321#true} is VALID [2022-02-20 23:58:06,394 INFO L290 TraceCheckUtils]: 4: Hoare triple {2321#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2321#true} is VALID [2022-02-20 23:58:06,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {2321#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2321#true} is VALID [2022-02-20 23:58:06,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {2321#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {2321#true} is VALID [2022-02-20 23:58:06,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {2321#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {2321#true} is VALID [2022-02-20 23:58:06,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {2321#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {2321#true} is VALID [2022-02-20 23:58:06,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {2321#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2321#true} is VALID [2022-02-20 23:58:06,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {2321#true} assume true; {2321#true} is VALID [2022-02-20 23:58:06,395 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2321#true} {2329#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} #188#return; {2329#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:06,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {2329#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {2329#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:06,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {2329#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {2329#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:06,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {2329#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {2329#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:06,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {2329#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} assume dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32; {2322#false} is VALID [2022-02-20 23:58:06,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {2322#false} assume !(1bv1 == #valid[dll_create_~head~0#1.base]); {2322#false} is VALID [2022-02-20 23:58:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:06,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:06,398 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:06,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349388943] [2022-02-20 23:58:06,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349388943] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:06,398 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:06,398 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:58:06,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493048112] [2022-02-20 23:58:06,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:06,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 23:58:06,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:06,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:06,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:06,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:58:06,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:06,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:58:06,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:06,415 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:06,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:06,671 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:58:06,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:58:06,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 23:58:06,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-02-20 23:58:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:06,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-02-20 23:58:06,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-02-20 23:58:06,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:06,776 INFO L225 Difference]: With dead ends: 102 [2022-02-20 23:58:06,776 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 23:58:06,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:06,777 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:06,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 198 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:58:06,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 23:58:06,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-02-20 23:58:06,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:06,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 101 states, 60 states have (on average 1.75) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:06,782 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 101 states, 60 states have (on average 1.75) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:06,782 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 101 states, 60 states have (on average 1.75) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:06,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:06,784 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:58:06,784 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-02-20 23:58:06,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:06,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:06,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 60 states have (on average 1.75) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 102 states. [2022-02-20 23:58:06,785 INFO L87 Difference]: Start difference. First operand has 101 states, 60 states have (on average 1.75) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 102 states. [2022-02-20 23:58:06,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:06,787 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:58:06,787 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-02-20 23:58:06,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:06,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:06,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:06,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:06,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 60 states have (on average 1.75) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-02-20 23:58:06,789 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 17 [2022-02-20 23:58:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:06,789 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-02-20 23:58:06,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:58:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-02-20 23:58:06,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:58:06,790 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:06,790 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:06,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-02-20 23:58:06,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:58:06,997 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:58:06,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:06,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1802773707, now seen corresponding path program 1 times [2022-02-20 23:58:06,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:06,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371821493] [2022-02-20 23:58:06,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:06,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:06,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:06,999 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:58:07,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:58:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:07,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:58:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:07,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:07,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {2781#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {2781#true} is VALID [2022-02-20 23:58:07,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {2781#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {2789#(= (_ bv2 32) |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:07,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {2789#(= (_ bv2 32) |ULTIMATE.start_dll_create_~len#1|)} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {2789#(= (_ bv2 32) |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:07,193 INFO L272 TraceCheckUtils]: 3: Hoare triple {2789#(= (_ bv2 32) |ULTIMATE.start_dll_create_~len#1|)} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {2781#true} is VALID [2022-02-20 23:58:07,194 INFO L290 TraceCheckUtils]: 4: Hoare triple {2781#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2781#true} is VALID [2022-02-20 23:58:07,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {2781#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2781#true} is VALID [2022-02-20 23:58:07,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {2781#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {2781#true} is VALID [2022-02-20 23:58:07,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {2781#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {2781#true} is VALID [2022-02-20 23:58:07,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {2781#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {2781#true} is VALID [2022-02-20 23:58:07,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {2781#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2781#true} is VALID [2022-02-20 23:58:07,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-02-20 23:58:07,197 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2781#true} {2789#(= (_ bv2 32) |ULTIMATE.start_dll_create_~len#1|)} #188#return; {2789#(= (_ bv2 32) |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:07,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {2789#(= (_ bv2 32) |ULTIMATE.start_dll_create_~len#1|)} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {2789#(= (_ bv2 32) |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:07,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {2789#(= (_ bv2 32) |ULTIMATE.start_dll_create_~len#1|)} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {2789#(= (_ bv2 32) |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:07,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {2789#(= (_ bv2 32) |ULTIMATE.start_dll_create_~len#1|)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {2789#(= (_ bv2 32) |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:07,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {2789#(= (_ bv2 32) |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {2789#(= (_ bv2 32) |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 23:58:07,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {2789#(= (_ bv2 32) |ULTIMATE.start_dll_create_~len#1|)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {2835#(= (_ bv2 32) (bvadd |ULTIMATE.start_dll_create_~len#1| (_ bv1 32)))} is VALID [2022-02-20 23:58:07,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {2835#(= (_ bv2 32) (bvadd |ULTIMATE.start_dll_create_~len#1| (_ bv1 32)))} assume !~bvsgt32(dll_create_~len#1, 0bv32); {2782#false} is VALID [2022-02-20 23:58:07,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {2782#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {2782#false} is VALID [2022-02-20 23:58:07,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {2782#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {2782#false} is VALID [2022-02-20 23:58:07,200 INFO L272 TraceCheckUtils]: 20: Hoare triple {2782#false} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {2782#false} is VALID [2022-02-20 23:58:07,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {2782#false} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2782#false} is VALID [2022-02-20 23:58:07,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {2782#false} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2782#false} is VALID [2022-02-20 23:58:07,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {2782#false} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {2782#false} is VALID [2022-02-20 23:58:07,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {2782#false} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {2782#false} is VALID [2022-02-20 23:58:07,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {2782#false} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {2782#false} is VALID [2022-02-20 23:58:07,201 INFO L290 TraceCheckUtils]: 26: Hoare triple {2782#false} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2782#false} is VALID [2022-02-20 23:58:07,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {2782#false} assume true; {2782#false} is VALID [2022-02-20 23:58:07,201 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2782#false} {2782#false} #190#return; {2782#false} is VALID [2022-02-20 23:58:07,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {2782#false} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {2782#false} is VALID [2022-02-20 23:58:07,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {2782#false} assume !(1bv1 == #valid[dll_append_~head#1.base]); {2782#false} is VALID [2022-02-20 23:58:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:07,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:07,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {2782#false} assume !(1bv1 == #valid[dll_append_~head#1.base]); {2782#false} is VALID [2022-02-20 23:58:07,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {2782#false} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {2782#false} is VALID [2022-02-20 23:58:07,298 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2781#true} {2782#false} #190#return; {2782#false} is VALID [2022-02-20 23:58:07,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-02-20 23:58:07,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {2781#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2781#true} is VALID [2022-02-20 23:58:07,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {2781#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {2781#true} is VALID [2022-02-20 23:58:07,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {2781#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {2781#true} is VALID [2022-02-20 23:58:07,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {2781#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {2781#true} is VALID [2022-02-20 23:58:07,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {2781#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2781#true} is VALID [2022-02-20 23:58:07,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {2781#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2781#true} is VALID [2022-02-20 23:58:07,299 INFO L272 TraceCheckUtils]: 20: Hoare triple {2782#false} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {2781#true} is VALID [2022-02-20 23:58:07,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {2782#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {2782#false} is VALID [2022-02-20 23:58:07,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {2782#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {2782#false} is VALID [2022-02-20 23:58:07,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {2917#(bvsgt |ULTIMATE.start_dll_create_~len#1| (_ bv0 32))} assume !~bvsgt32(dll_create_~len#1, 0bv32); {2782#false} is VALID [2022-02-20 23:58:07,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {2921#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_create_~len#1|) (_ bv0 32))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {2917#(bvsgt |ULTIMATE.start_dll_create_~len#1| (_ bv0 32))} is VALID [2022-02-20 23:58:07,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {2921#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_create_~len#1|) (_ bv0 32))} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {2921#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 23:58:07,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {2921#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_create_~len#1|) (_ bv0 32))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {2921#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 23:58:07,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {2921#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_create_~len#1|) (_ bv0 32))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {2921#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 23:58:07,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {2921#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_create_~len#1|) (_ bv0 32))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {2921#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 23:58:07,302 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2781#true} {2921#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_create_~len#1|) (_ bv0 32))} #188#return; {2921#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 23:58:07,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {2781#true} assume true; {2781#true} is VALID [2022-02-20 23:58:07,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {2781#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2781#true} is VALID [2022-02-20 23:58:07,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {2781#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {2781#true} is VALID [2022-02-20 23:58:07,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {2781#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {2781#true} is VALID [2022-02-20 23:58:07,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {2781#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {2781#true} is VALID [2022-02-20 23:58:07,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {2781#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {2781#true} is VALID [2022-02-20 23:58:07,303 INFO L290 TraceCheckUtils]: 4: Hoare triple {2781#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {2781#true} is VALID [2022-02-20 23:58:07,303 INFO L272 TraceCheckUtils]: 3: Hoare triple {2921#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_create_~len#1|) (_ bv0 32))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {2781#true} is VALID [2022-02-20 23:58:07,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {2921#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_create_~len#1|) (_ bv0 32))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {2921#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 23:58:07,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {2781#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {2921#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_dll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 23:58:07,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {2781#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {2781#true} is VALID [2022-02-20 23:58:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:58:07,304 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:07,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371821493] [2022-02-20 23:58:07,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371821493] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:07,304 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:58:07,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-02-20 23:58:07,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887985012] [2022-02-20 23:58:07,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:07,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-02-20 23:58:07,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:07,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:58:07,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:07,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:58:07,358 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:07,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:58:07,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:58:07,358 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:58:07,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:07,998 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2022-02-20 23:58:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:58:07,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-02-20 23:58:07,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:58:08,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2022-02-20 23:58:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:58:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2022-02-20 23:58:08,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 125 transitions. [2022-02-20 23:58:08,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:08,143 INFO L225 Difference]: With dead ends: 112 [2022-02-20 23:58:08,143 INFO L226 Difference]: Without dead ends: 112 [2022-02-20 23:58:08,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:58:08,144 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 22 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:08,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 501 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:58:08,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-02-20 23:58:08,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2022-02-20 23:58:08,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:08,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 103 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 98 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:08,147 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 103 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 98 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:08,147 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 103 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 98 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:08,149 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2022-02-20 23:58:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2022-02-20 23:58:08,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:08,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:08,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 98 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 112 states. [2022-02-20 23:58:08,150 INFO L87 Difference]: Start difference. First operand has 103 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 98 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 112 states. [2022-02-20 23:58:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:08,152 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2022-02-20 23:58:08,152 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2022-02-20 23:58:08,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:08,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:08,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:08,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 98 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2022-02-20 23:58:08,155 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 31 [2022-02-20 23:58:08,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:08,155 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2022-02-20 23:58:08,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:58:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2022-02-20 23:58:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:58:08,156 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:08,156 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:08,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:08,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:58:08,366 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:58:08,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:08,366 INFO L85 PathProgramCache]: Analyzing trace with hash 916543363, now seen corresponding path program 1 times [2022-02-20 23:58:08,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:08,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701884832] [2022-02-20 23:58:08,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:08,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:08,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:08,368 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:58:08,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:58:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:08,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:58:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:08,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:08,540 INFO L390 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 [2022-02-20 23:58:08,705 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:58:08,706 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-02-20 23:58:08,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {3408#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {3408#true} is VALID [2022-02-20 23:58:08,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {3408#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {3408#true} is VALID [2022-02-20 23:58:08,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {3408#true} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {3408#true} is VALID [2022-02-20 23:58:08,731 INFO L272 TraceCheckUtils]: 3: Hoare triple {3408#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {3408#true} is VALID [2022-02-20 23:58:08,732 INFO L290 TraceCheckUtils]: 4: Hoare triple {3408#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:08,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:08,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:08,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:08,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:08,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3441#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:08,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {3441#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} assume true; {3441#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:08,737 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3441#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} {3408#true} #188#return; {3448#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|))} is VALID [2022-02-20 23:58:08,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {3448#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {3452#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:08,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {3452#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {3452#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:08,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {3452#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {3452#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:08,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {3452#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1))} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {3452#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:08,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {3452#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:08,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:08,740 INFO L272 TraceCheckUtils]: 18: Hoare triple {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {3472#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:58:08,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {3472#(= |old(#valid)| |#valid|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3476#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:58:08,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {3476#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3476#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:58:08,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {3476#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {3476#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:58:08,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {3476#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {3476#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:58:08,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {3476#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {3476#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:58:08,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {3476#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3476#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:58:08,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {3476#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} assume true; {3476#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:58:08,749 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3476#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} #188#return; {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:08,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:08,750 INFO L290 TraceCheckUtils]: 28: Hoare triple {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:08,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:08,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} assume dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32; {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:08,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[dll_create_~head~0#1.base]); {3409#false} is VALID [2022-02-20 23:58:08,751 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:08,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:09,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[dll_create_~head~0#1.base]); {3409#false} is VALID [2022-02-20 23:58:09,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} assume dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32; {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:09,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:09,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:09,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:09,041 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3531#(forall ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} #188#return; {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:09,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {3531#(forall ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} assume true; {3531#(forall ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} is VALID [2022-02-20 23:58:09,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {3531#(forall ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3531#(forall ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} is VALID [2022-02-20 23:58:09,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {3531#(forall ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {3531#(forall ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} is VALID [2022-02-20 23:58:09,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {3531#(forall ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {3531#(forall ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} is VALID [2022-02-20 23:58:09,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {3531#(forall ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {3531#(forall ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} is VALID [2022-02-20 23:58:09,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {3531#(forall ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3531#(forall ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} is VALID [2022-02-20 23:58:09,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {3531#(forall ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3531#(forall ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} is VALID [2022-02-20 23:58:09,051 INFO L272 TraceCheckUtils]: 18: Hoare triple {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {3531#(forall ((|v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))) (= (select |#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_BEFORE_CALL_3|) (_ bv1 1))))} is VALID [2022-02-20 23:58:09,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:09,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {3452#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {3465#(= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:09,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {3452#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1))} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {3452#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:09,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {3452#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {3452#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:09,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {3452#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {3452#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:09,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {3448#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {3452#(= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:09,055 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3441#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} {3408#true} #188#return; {3448#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|))} is VALID [2022-02-20 23:58:09,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {3441#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} assume true; {3441#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:09,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3441#(= (select |#valid| |node_create_#res#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:09,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:09,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:09,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:09,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:09,058 INFO L290 TraceCheckUtils]: 4: Hoare triple {3408#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {3425#(= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:58:09,058 INFO L272 TraceCheckUtils]: 3: Hoare triple {3408#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {3408#true} is VALID [2022-02-20 23:58:09,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {3408#true} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {3408#true} is VALID [2022-02-20 23:58:09,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {3408#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {3408#true} is VALID [2022-02-20 23:58:09,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {3408#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {3408#true} is VALID [2022-02-20 23:58:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:09,060 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:09,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701884832] [2022-02-20 23:58:09,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701884832] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:09,060 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:58:09,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2022-02-20 23:58:09,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366290191] [2022-02-20 23:58:09,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:09,061 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-02-20 23:58:09,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:09,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:58:09,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:09,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:58:09,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:09,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:58:09,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:58:09,110 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:58:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:10,468 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:58:10,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:58:10,468 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-02-20 23:58:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:58:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-02-20 23:58:10,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:58:10,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-02-20 23:58:10,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 112 transitions. [2022-02-20 23:58:10,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:10,580 INFO L225 Difference]: With dead ends: 102 [2022-02-20 23:58:10,580 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 23:58:10,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:58:10,581 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 14 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:10,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 435 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 301 Invalid, 0 Unknown, 64 Unchecked, 0.4s Time] [2022-02-20 23:58:10,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 23:58:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-02-20 23:58:10,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:10,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 97 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:10,584 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 97 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:10,584 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 97 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:10,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:10,586 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:58:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-02-20 23:58:10,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:10,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:10,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 97 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 102 states. [2022-02-20 23:58:10,587 INFO L87 Difference]: Start difference. First operand has 102 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 97 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 102 states. [2022-02-20 23:58:10,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:10,589 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:58:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-02-20 23:58:10,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:10,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:10,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:10,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:10,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 97 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2022-02-20 23:58:10,602 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 32 [2022-02-20 23:58:10,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:10,602 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2022-02-20 23:58:10,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:58:10,602 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-02-20 23:58:10,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:58:10,603 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:10,603 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:10,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-02-20 23:58:10,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:58:10,811 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:58:10,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:10,811 INFO L85 PathProgramCache]: Analyzing trace with hash 916543364, now seen corresponding path program 1 times [2022-02-20 23:58:10,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:10,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426734123] [2022-02-20 23:58:10,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:10,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:10,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:10,813 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:58:10,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:58:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:10,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:58:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:10,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:10,999 INFO L390 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 [2022-02-20 23:58:11,004 INFO L390 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 [2022-02-20 23:58:11,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:11,374 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:58:11,381 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:58:11,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:58:11,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {4023#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {4023#true} is VALID [2022-02-20 23:58:11,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {4023#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {4023#true} is VALID [2022-02-20 23:58:11,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {4023#true} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {4023#true} is VALID [2022-02-20 23:58:11,442 INFO L272 TraceCheckUtils]: 3: Hoare triple {4023#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {4023#true} is VALID [2022-02-20 23:58:11,442 INFO L290 TraceCheckUtils]: 4: Hoare triple {4023#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:11,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:11,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:11,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:11,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:11,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4056#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:11,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {4056#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} assume true; {4056#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:11,450 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4056#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} {4023#true} #188#return; {4063#(and (= |ULTIMATE.start_dll_create_#t~ret4#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_dll_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:58:11,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {4063#(and (= |ULTIMATE.start_dll_create_#t~ret4#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_dll_create_#t~ret4#1.base|)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {4067#(and (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:11,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {4067#(and (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {4067#(and (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:11,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {4067#(and (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {4067#(and (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:11,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {4067#(and (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)))} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {4067#(and (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:11,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {4067#(and (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {4080#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1)) (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:11,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {4080#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1)) (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {4080#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1)) (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:11,454 INFO L272 TraceCheckUtils]: 18: Hoare triple {4080#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1)) (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {4087#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:58:11,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {4087#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:58:11,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:58:11,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:58:11,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:58:11,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:58:11,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:58:11,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume true; {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:58:11,458 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} {4080#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1)) (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} #188#return; {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:11,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:11,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:11,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:11,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} assume dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32; {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:11,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(8bv32, dll_create_~head~0#1.offset)), #length[dll_create_~head~0#1.base]) && ~bvule32(~bvadd32(8bv32, dll_create_~head~0#1.offset), ~bvadd32(4bv32, ~bvadd32(8bv32, dll_create_~head~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(8bv32, dll_create_~head~0#1.offset))); {4024#false} is VALID [2022-02-20 23:58:11,461 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:11,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:11,678 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:11,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426734123] [2022-02-20 23:58:11,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426734123] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:11,679 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [929205617] [2022-02-20 23:58:11,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:11,679 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:58:11,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:58:11,680 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:58:11,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-02-20 23:58:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:11,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:58:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:11,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:11,964 INFO L390 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 [2022-02-20 23:58:11,969 INFO L390 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 [2022-02-20 23:58:12,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:12,251 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:58:12,258 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:58:12,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:58:12,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {4023#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {4023#true} is VALID [2022-02-20 23:58:12,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {4023#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {4023#true} is VALID [2022-02-20 23:58:12,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {4023#true} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {4023#true} is VALID [2022-02-20 23:58:12,291 INFO L272 TraceCheckUtils]: 3: Hoare triple {4023#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {4023#true} is VALID [2022-02-20 23:58:12,293 INFO L290 TraceCheckUtils]: 4: Hoare triple {4023#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:12,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:12,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:12,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:12,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:12,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {4040#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4056#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:12,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {4056#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} assume true; {4056#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:12,303 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4056#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} {4023#true} #188#return; {4063#(and (= |ULTIMATE.start_dll_create_#t~ret4#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_dll_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:58:12,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {4063#(and (= |ULTIMATE.start_dll_create_#t~ret4#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|)) (= (_ bv12 32) (select |#length| |ULTIMATE.start_dll_create_#t~ret4#1.base|)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {4067#(and (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:12,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {4067#(and (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {4067#(and (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:12,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {4067#(and (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {4067#(and (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:12,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {4067#(and (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)))} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {4067#(and (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:12,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {4067#(and (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {4080#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1)) (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:12,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {4080#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1)) (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {4080#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1)) (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:12,307 INFO L272 TraceCheckUtils]: 18: Hoare triple {4080#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1)) (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {4087#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:58:12,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {4087#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:58:12,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:58:12,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:58:12,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:58:12,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:58:12,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:58:12,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume true; {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 23:58:12,311 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4091#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_305 (_ BitVec 32))) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_305) |#length|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|))))} {4080#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1)) (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} #188#return; {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:12,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:12,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:12,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:12,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} assume dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32; {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:12,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {4113#(and (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(8bv32, dll_create_~head~0#1.offset)), #length[dll_create_~head~0#1.base]) && ~bvule32(~bvadd32(8bv32, dll_create_~head~0#1.offset), ~bvadd32(4bv32, ~bvadd32(8bv32, dll_create_~head~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(8bv32, dll_create_~head~0#1.offset))); {4024#false} is VALID [2022-02-20 23:58:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:12,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:12,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [929205617] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:12,537 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:58:12,537 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2022-02-20 23:58:12,538 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838503495] [2022-02-20 23:58:12,538 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:12,538 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-02-20 23:58:12,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:12,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:12,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:12,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:58:12,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:12,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:58:12,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:58:12,582 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:14,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:14,605 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:58:14,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:58:14,606 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-02-20 23:58:14,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-02-20 23:58:14,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-02-20 23:58:14,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 112 transitions. [2022-02-20 23:58:14,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:14,727 INFO L225 Difference]: With dead ends: 102 [2022-02-20 23:58:14,727 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 23:58:14,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:58:14,728 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 12 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:14,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 400 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 435 Invalid, 0 Unknown, 62 Unchecked, 0.7s Time] [2022-02-20 23:58:14,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 23:58:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-02-20 23:58:14,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:14,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 101 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:14,738 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 101 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:14,740 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 101 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:14,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:14,747 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:58:14,747 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-02-20 23:58:14,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:14,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:14,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 102 states. [2022-02-20 23:58:14,748 INFO L87 Difference]: Start difference. First operand has 101 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 102 states. [2022-02-20 23:58:14,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:14,750 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-02-20 23:58:14,750 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-02-20 23:58:14,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:14,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:14,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:14,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:14,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-02-20 23:58:14,754 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 32 [2022-02-20 23:58:14,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:14,754 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-02-20 23:58:14,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:14,755 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-02-20 23:58:14,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 23:58:14,757 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:14,757 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:14,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:14,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:15,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:58:15,161 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:58:15,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:15,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2135424312, now seen corresponding path program 2 times [2022-02-20 23:58:15,162 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:15,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586625567] [2022-02-20 23:58:15,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:58:15,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:15,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:15,163 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:58:15,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:58:15,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:58:15,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:58:15,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:58:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:15,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:15,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {4677#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {4677#true} is VALID [2022-02-20 23:58:15,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {4677#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {4677#true} is VALID [2022-02-20 23:58:15,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {4677#true} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {4677#true} is VALID [2022-02-20 23:58:15,450 INFO L272 TraceCheckUtils]: 3: Hoare triple {4677#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {4677#true} is VALID [2022-02-20 23:58:15,450 INFO L290 TraceCheckUtils]: 4: Hoare triple {4677#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:15,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:15,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:15,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:15,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:15,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4710#(not (= |node_create_#res#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {4710#(not (= |node_create_#res#1.base| (_ bv0 32)))} assume true; {4710#(not (= |node_create_#res#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,453 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4710#(not (= |node_create_#res#1.base| (_ bv0 32)))} {4677#true} #188#return; {4717#(not (= (_ bv0 32) |ULTIMATE.start_dll_create_#t~ret4#1.base|))} is VALID [2022-02-20 23:58:15,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {4717#(not (= (_ bv0 32) |ULTIMATE.start_dll_create_#t~ret4#1.base|))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {4721#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {4721#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {4721#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {4721#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (_ bv0 32)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {4721#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {4721#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (_ bv0 32)))} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {4721#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {4721#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (_ bv0 32)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,456 INFO L272 TraceCheckUtils]: 18: Hoare triple {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {4677#true} is VALID [2022-02-20 23:58:15,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {4677#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4677#true} is VALID [2022-02-20 23:58:15,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {4677#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4677#true} is VALID [2022-02-20 23:58:15,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {4677#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {4677#true} is VALID [2022-02-20 23:58:15,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {4677#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {4677#true} is VALID [2022-02-20 23:58:15,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {4677#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {4677#true} is VALID [2022-02-20 23:58:15,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {4677#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4677#true} is VALID [2022-02-20 23:58:15,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {4677#true} assume true; {4677#true} is VALID [2022-02-20 23:58:15,457 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4677#true} {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} #188#return; {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,458 INFO L290 TraceCheckUtils]: 29: Hoare triple {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {4678#false} is VALID [2022-02-20 23:58:15,459 INFO L290 TraceCheckUtils]: 31: Hoare triple {4678#false} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {4678#false} is VALID [2022-02-20 23:58:15,459 INFO L290 TraceCheckUtils]: 32: Hoare triple {4678#false} assume !~bvsgt32(dll_create_~len#1, 0bv32); {4678#false} is VALID [2022-02-20 23:58:15,459 INFO L290 TraceCheckUtils]: 33: Hoare triple {4678#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {4678#false} is VALID [2022-02-20 23:58:15,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {4678#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {4678#false} is VALID [2022-02-20 23:58:15,460 INFO L272 TraceCheckUtils]: 35: Hoare triple {4678#false} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {4678#false} is VALID [2022-02-20 23:58:15,460 INFO L290 TraceCheckUtils]: 36: Hoare triple {4678#false} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4678#false} is VALID [2022-02-20 23:58:15,460 INFO L290 TraceCheckUtils]: 37: Hoare triple {4678#false} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4678#false} is VALID [2022-02-20 23:58:15,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {4678#false} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {4678#false} is VALID [2022-02-20 23:58:15,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {4678#false} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {4678#false} is VALID [2022-02-20 23:58:15,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {4678#false} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {4678#false} is VALID [2022-02-20 23:58:15,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {4678#false} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4678#false} is VALID [2022-02-20 23:58:15,460 INFO L290 TraceCheckUtils]: 42: Hoare triple {4678#false} assume true; {4678#false} is VALID [2022-02-20 23:58:15,461 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4678#false} {4678#false} #190#return; {4678#false} is VALID [2022-02-20 23:58:15,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {4678#false} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {4678#false} is VALID [2022-02-20 23:58:15,461 INFO L290 TraceCheckUtils]: 45: Hoare triple {4678#false} assume !(1bv1 == #valid[dll_append_~head#1.base]); {4678#false} is VALID [2022-02-20 23:58:15,461 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:58:15,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:15,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {4678#false} assume !(1bv1 == #valid[dll_append_~head#1.base]); {4678#false} is VALID [2022-02-20 23:58:15,600 INFO L290 TraceCheckUtils]: 44: Hoare triple {4678#false} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {4678#false} is VALID [2022-02-20 23:58:15,601 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4677#true} {4678#false} #190#return; {4678#false} is VALID [2022-02-20 23:58:15,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {4677#true} assume true; {4677#true} is VALID [2022-02-20 23:58:15,601 INFO L290 TraceCheckUtils]: 41: Hoare triple {4677#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4677#true} is VALID [2022-02-20 23:58:15,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {4677#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {4677#true} is VALID [2022-02-20 23:58:15,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {4677#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {4677#true} is VALID [2022-02-20 23:58:15,601 INFO L290 TraceCheckUtils]: 38: Hoare triple {4677#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {4677#true} is VALID [2022-02-20 23:58:15,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {4677#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4677#true} is VALID [2022-02-20 23:58:15,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {4677#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4677#true} is VALID [2022-02-20 23:58:15,602 INFO L272 TraceCheckUtils]: 35: Hoare triple {4678#false} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {4677#true} is VALID [2022-02-20 23:58:15,602 INFO L290 TraceCheckUtils]: 34: Hoare triple {4678#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {4678#false} is VALID [2022-02-20 23:58:15,602 INFO L290 TraceCheckUtils]: 33: Hoare triple {4678#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {4678#false} is VALID [2022-02-20 23:58:15,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {4678#false} assume !~bvsgt32(dll_create_~len#1, 0bv32); {4678#false} is VALID [2022-02-20 23:58:15,602 INFO L290 TraceCheckUtils]: 31: Hoare triple {4678#false} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {4678#false} is VALID [2022-02-20 23:58:15,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {4678#false} is VALID [2022-02-20 23:58:15,603 INFO L290 TraceCheckUtils]: 29: Hoare triple {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,603 INFO L290 TraceCheckUtils]: 28: Hoare triple {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,604 INFO L290 TraceCheckUtils]: 27: Hoare triple {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,604 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4677#true} {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} #188#return; {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {4677#true} assume true; {4677#true} is VALID [2022-02-20 23:58:15,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {4677#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4677#true} is VALID [2022-02-20 23:58:15,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {4677#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {4677#true} is VALID [2022-02-20 23:58:15,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {4677#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {4677#true} is VALID [2022-02-20 23:58:15,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {4677#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {4677#true} is VALID [2022-02-20 23:58:15,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {4677#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4677#true} is VALID [2022-02-20 23:58:15,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {4677#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4677#true} is VALID [2022-02-20 23:58:15,605 INFO L272 TraceCheckUtils]: 18: Hoare triple {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {4677#true} is VALID [2022-02-20 23:58:15,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {4721#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (_ bv0 32)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {4734#(not (= |ULTIMATE.start_dll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {4721#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (_ bv0 32)))} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {4721#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {4721#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (_ bv0 32)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {4721#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {4721#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {4721#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {4717#(not (= (_ bv0 32) |ULTIMATE.start_dll_create_#t~ret4#1.base|))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {4721#(not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,609 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4710#(not (= |node_create_#res#1.base| (_ bv0 32)))} {4677#true} #188#return; {4717#(not (= (_ bv0 32) |ULTIMATE.start_dll_create_#t~ret4#1.base|))} is VALID [2022-02-20 23:58:15,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {4710#(not (= |node_create_#res#1.base| (_ bv0 32)))} assume true; {4710#(not (= |node_create_#res#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4710#(not (= |node_create_#res#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:58:15,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:15,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:15,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:15,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:15,611 INFO L290 TraceCheckUtils]: 4: Hoare triple {4677#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {4694#(not (= (_ bv0 32) |node_create_~temp~0#1.base|))} is VALID [2022-02-20 23:58:15,612 INFO L272 TraceCheckUtils]: 3: Hoare triple {4677#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {4677#true} is VALID [2022-02-20 23:58:15,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {4677#true} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {4677#true} is VALID [2022-02-20 23:58:15,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {4677#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {4677#true} is VALID [2022-02-20 23:58:15,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {4677#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {4677#true} is VALID [2022-02-20 23:58:15,612 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:58:15,612 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:15,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586625567] [2022-02-20 23:58:15,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586625567] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:58:15,613 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:58:15,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-02-20 23:58:15,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318678679] [2022-02-20 23:58:15,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:15,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2022-02-20 23:58:15,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:15,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:58:15,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:15,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:58:15,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:15,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:58:15,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:15,661 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:58:16,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:16,402 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-02-20 23:58:16,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:58:16,402 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2022-02-20 23:58:16,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:16,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:58:16,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2022-02-20 23:58:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:58:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2022-02-20 23:58:16,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 110 transitions. [2022-02-20 23:58:16,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:16,510 INFO L225 Difference]: With dead ends: 101 [2022-02-20 23:58:16,511 INFO L226 Difference]: Without dead ends: 101 [2022-02-20 23:58:16,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:58:16,511 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 170 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:16,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 382 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:16,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-20 23:58:16,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-02-20 23:58:16,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:16,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:16,514 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:16,514 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:16,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:16,515 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-02-20 23:58:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-02-20 23:58:16,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:16,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:16,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 101 states. [2022-02-20 23:58:16,516 INFO L87 Difference]: Start difference. First operand has 101 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 101 states. [2022-02-20 23:58:16,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:16,517 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-02-20 23:58:16,518 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-02-20 23:58:16,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:16,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:16,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:16,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:16,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2022-02-20 23:58:16,520 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 46 [2022-02-20 23:58:16,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:16,520 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2022-02-20 23:58:16,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:58:16,520 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-02-20 23:58:16,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 23:58:16,520 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:16,521 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:16,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-02-20 23:58:16,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:58:16,728 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:58:16,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:16,729 INFO L85 PathProgramCache]: Analyzing trace with hash 568631680, now seen corresponding path program 1 times [2022-02-20 23:58:16,729 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:16,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496508761] [2022-02-20 23:58:16,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:16,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:16,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:16,730 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:58:16,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 23:58:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:16,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:58:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:16,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:16,976 INFO L390 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 [2022-02-20 23:58:16,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:58:17,137 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:58:17,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 24 [2022-02-20 23:58:17,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:58:17,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:17,325 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:58:17,675 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:58:17,675 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-02-20 23:58:17,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {5367#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {5367#true} is VALID [2022-02-20 23:58:17,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {5367#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:17,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:17,733 INFO L272 TraceCheckUtils]: 3: Hoare triple {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {5382#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:17,734 INFO L290 TraceCheckUtils]: 4: Hoare triple {5382#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5386#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_560 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_560) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} is VALID [2022-02-20 23:58:17,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {5386#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_560 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_560) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5386#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_560 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_560) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} is VALID [2022-02-20 23:58:17,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {5386#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_560 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_560) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {5386#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_560 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_560) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} is VALID [2022-02-20 23:58:17,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {5386#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_560 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_560) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {5386#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_560 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_560) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} is VALID [2022-02-20 23:58:17,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {5386#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_560 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_560) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {5386#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_560 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_560) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} is VALID [2022-02-20 23:58:17,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {5386#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_560 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_560) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5386#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_560 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_560) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} is VALID [2022-02-20 23:58:17,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {5386#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_560 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_560) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} assume true; {5386#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_560 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_560) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} is VALID [2022-02-20 23:58:17,741 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5386#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_560 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_560) |#valid|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)))))} {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} #188#return; {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:17,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:17,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:17,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:17,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:17,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:17,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:17,745 INFO L272 TraceCheckUtils]: 18: Hoare triple {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {5382#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:17,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {5382#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:17,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:17,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:17,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:17,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:17,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:17,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:17,758 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {5375#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} #188#return; {5454#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-20 23:58:17,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {5454#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {5454#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-20 23:58:17,759 INFO L290 TraceCheckUtils]: 28: Hoare triple {5454#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {5454#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-20 23:58:17,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {5454#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {5454#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-20 23:58:17,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {5454#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} assume dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32; {5454#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-20 23:58:17,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {5454#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, ~bvadd32(8bv32, dll_create_~head~0#1.offset), 4bv32); srcloc: L592 {5454#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-20 23:58:17,761 INFO L290 TraceCheckUtils]: 32: Hoare triple {5454#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {5454#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-20 23:58:17,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {5454#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} assume !~bvsgt32(dll_create_~len#1, 0bv32); {5454#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-20 23:58:17,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {5454#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {5454#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} is VALID [2022-02-20 23:58:17,763 INFO L290 TraceCheckUtils]: 35: Hoare triple {5454#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {5482#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|)))} is VALID [2022-02-20 23:58:17,764 INFO L272 TraceCheckUtils]: 36: Hoare triple {5482#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|)))} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {5486#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:58:17,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {5486#(= |old(#valid)| |#valid|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5490#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:58:17,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {5490#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5490#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:58:17,767 INFO L290 TraceCheckUtils]: 39: Hoare triple {5490#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {5490#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:58:17,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {5490#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {5490#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:58:17,769 INFO L290 TraceCheckUtils]: 41: Hoare triple {5490#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {5490#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:58:17,770 INFO L290 TraceCheckUtils]: 42: Hoare triple {5490#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5490#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:58:17,770 INFO L290 TraceCheckUtils]: 43: Hoare triple {5490#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} assume true; {5490#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:58:17,772 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5490#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= (store |old(#valid)| |node_create_~temp~0#1.base| (_ bv1 1)) |#valid|))} {5482#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|)))} #190#return; {5482#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|)))} is VALID [2022-02-20 23:58:17,772 INFO L290 TraceCheckUtils]: 45: Hoare triple {5482#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|)))} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {5482#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|)))} is VALID [2022-02-20 23:58:17,772 INFO L290 TraceCheckUtils]: 46: Hoare triple {5482#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|)))} assume !(1bv1 == #valid[dll_append_~head#1.base]); {5368#false} is VALID [2022-02-20 23:58:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:58:17,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:18,038 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:18,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496508761] [2022-02-20 23:58:18,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1496508761] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:18,038 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1307471923] [2022-02-20 23:58:18,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:18,038 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:58:18,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:58:18,039 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:58:18,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-02-20 23:58:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:18,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 23:58:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:18,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:18,460 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:58:18,460 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-02-20 23:58:18,507 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 23:58:18,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:58:18,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:18,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:18,646 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:58:18,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 31 [2022-02-20 23:58:18,837 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 23:58:18,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2022-02-20 23:58:18,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:18,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:19,009 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:58:19,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 40 [2022-02-20 23:58:19,288 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 23:58:19,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2022-02-20 23:58:19,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:19,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:19,446 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:58:19,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 40 [2022-02-20 23:58:19,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {5367#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {5585#(= (_ bv1 1) (select |#valid| (_ bv1 32)))} is VALID [2022-02-20 23:58:19,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {5585#(= (_ bv1 1) (select |#valid| (_ bv1 32)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {5589#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))))} is VALID [2022-02-20 23:58:19,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {5589#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {5589#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))))} is VALID [2022-02-20 23:58:19,607 INFO L272 TraceCheckUtils]: 3: Hoare triple {5589#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {5382#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {5382#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,620 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {5589#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))))} #188#return; {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:19,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:19,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:19,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:19,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:19,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:19,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:19,624 INFO L272 TraceCheckUtils]: 18: Hoare triple {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {5642#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {5642#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,638 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} #188#return; {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:19,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:19,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:19,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:19,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} assume dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32; {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:19,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, ~bvadd32(8bv32, dll_create_~head~0#1.offset), 4bv32); srcloc: L592 {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:19,648 INFO L290 TraceCheckUtils]: 32: Hoare triple {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:19,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !~bvsgt32(dll_create_~len#1, 0bv32); {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:19,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:19,651 INFO L290 TraceCheckUtils]: 35: Hoare triple {5620#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {5694#(and (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|)))} is VALID [2022-02-20 23:58:19,652 INFO L272 TraceCheckUtils]: 36: Hoare triple {5694#(and (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|)))} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {5642#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {5642#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,655 INFO L290 TraceCheckUtils]: 39: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,657 INFO L290 TraceCheckUtils]: 40: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,658 INFO L290 TraceCheckUtils]: 41: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,659 INFO L290 TraceCheckUtils]: 42: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,660 INFO L290 TraceCheckUtils]: 43: Hoare triple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:19,669 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5432#(and (exists ((v_ArrVal_561 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_561) |#valid|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {5694#(and (or (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| (_ bv1 32)))) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|)))} #190#return; {5722#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (or (and (= (bvadd (bvneg (select |#valid| (_ bv1 32))) (_ bv1 1)) (_ bv0 1)) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|)))} is VALID [2022-02-20 23:58:19,671 INFO L290 TraceCheckUtils]: 45: Hoare triple {5722#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (or (and (= (bvadd (bvneg (select |#valid| (_ bv1 32))) (_ bv1 1)) (_ bv0 1)) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|)))} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {5722#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (or (and (= (bvadd (bvneg (select |#valid| (_ bv1 32))) (_ bv1 1)) (_ bv0 1)) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|)))} is VALID [2022-02-20 23:58:19,671 INFO L290 TraceCheckUtils]: 46: Hoare triple {5722#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (or (and (= (bvadd (bvneg (select |#valid| (_ bv1 32))) (_ bv1 1)) (_ bv0 1)) (not (= |#StackHeapBarrier| (_ bv0 32)))) (bvult (_ bv1 32) |#StackHeapBarrier|)) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|)))} assume !(1bv1 == #valid[dll_append_~head#1.base]); {5368#false} is VALID [2022-02-20 23:58:19,671 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 23:58:19,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:19,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1307471923] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:19,754 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:58:19,754 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2022-02-20 23:58:19,754 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132890638] [2022-02-20 23:58:19,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:19,755 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 47 [2022-02-20 23:58:19,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:19,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:58:19,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:19,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:58:19,873 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:19,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:58:19,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:58:19,874 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:58:23,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:23,849 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-02-20 23:58:23,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:58:23,850 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 47 [2022-02-20 23:58:23,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:23,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:58:23,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2022-02-20 23:58:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:58:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2022-02-20 23:58:23,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 108 transitions. [2022-02-20 23:58:23,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:23,961 INFO L225 Difference]: With dead ends: 103 [2022-02-20 23:58:23,961 INFO L226 Difference]: Without dead ends: 103 [2022-02-20 23:58:23,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 89 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2022-02-20 23:58:23,962 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:23,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 738 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 305 Invalid, 0 Unknown, 265 Unchecked, 0.5s Time] [2022-02-20 23:58:23,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-20 23:58:23,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2022-02-20 23:58:23,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:23,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 100 states, 62 states have (on average 1.6612903225806452) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:23,964 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 100 states, 62 states have (on average 1.6612903225806452) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:23,965 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 100 states, 62 states have (on average 1.6612903225806452) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:23,966 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-02-20 23:58:23,966 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2022-02-20 23:58:23,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:23,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:23,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 62 states have (on average 1.6612903225806452) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 103 states. [2022-02-20 23:58:23,967 INFO L87 Difference]: Start difference. First operand has 100 states, 62 states have (on average 1.6612903225806452) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 103 states. [2022-02-20 23:58:23,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:23,968 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-02-20 23:58:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2022-02-20 23:58:23,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:23,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:23,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:23,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:23,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 62 states have (on average 1.6612903225806452) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:23,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2022-02-20 23:58:23,970 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 47 [2022-02-20 23:58:23,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:23,971 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2022-02-20 23:58:23,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 13 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:58:23,971 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2022-02-20 23:58:23,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 23:58:23,971 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:23,971 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:23,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:24,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:24,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:58:24,375 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:58:24,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:24,376 INFO L85 PathProgramCache]: Analyzing trace with hash 568631681, now seen corresponding path program 1 times [2022-02-20 23:58:24,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:24,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599469861] [2022-02-20 23:58:24,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:24,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:24,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:24,377 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:58:24,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-20 23:58:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:24,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 23:58:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:24,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:24,626 INFO L390 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 [2022-02-20 23:58:24,630 INFO L390 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 [2022-02-20 23:58:24,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:58:24,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:58:26,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:26,815 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:58:26,822 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:58:26,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:58:26,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:58:29,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:29,049 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:58:29,447 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:58:29,447 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-02-20 23:58:29,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {6155#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {6155#true} is VALID [2022-02-20 23:58:29,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {6155#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {6163#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:29,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {6163#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {6163#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:29,531 INFO L272 TraceCheckUtils]: 3: Hoare triple {6163#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {6170#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:29,532 INFO L290 TraceCheckUtils]: 4: Hoare triple {6170#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6174#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_760 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_760) |#length|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:29,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {6174#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_760 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_760) |#length|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6174#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_760 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_760) |#length|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:29,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {6174#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_760 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_760) |#length|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {6174#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_760 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_760) |#length|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:29,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {6174#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_760 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_760) |#length|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {6174#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_760 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_760) |#length|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:29,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {6174#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_760 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_760) |#length|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {6174#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_760 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_760) |#length|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:29,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {6174#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_760 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_760) |#length|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6174#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_760 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_760) |#length|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:29,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {6174#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_760 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_760) |#length|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {6174#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_760 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_760) |#length|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:29,540 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6174#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_760 (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_760) |#length|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {6163#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} #188#return; {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:29,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:29,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:29,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:29,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:29,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:29,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:29,543 INFO L272 TraceCheckUtils]: 18: Hoare triple {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {6218#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:29,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {6218#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:29,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:29,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:29,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:29,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:29,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:29,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:29,556 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} #188#return; {6244#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:29,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {6244#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {6244#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:29,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {6244#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {6244#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:29,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {6244#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {6244#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:29,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {6244#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32; {6244#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:29,559 INFO L290 TraceCheckUtils]: 31: Hoare triple {6244#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, ~bvadd32(8bv32, dll_create_~head~0#1.offset), 4bv32); srcloc: L592 {6244#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:29,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {6244#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {6244#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:29,559 INFO L290 TraceCheckUtils]: 33: Hoare triple {6244#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !~bvsgt32(dll_create_~len#1, 0bv32); {6244#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:29,560 INFO L290 TraceCheckUtils]: 34: Hoare triple {6244#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {6244#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:29,560 INFO L290 TraceCheckUtils]: 35: Hoare triple {6244#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {6272#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_dll_append_~head#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:29,561 INFO L272 TraceCheckUtils]: 36: Hoare triple {6272#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_dll_append_~head#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {6276#(= |#length| |old(#length)|)} is VALID [2022-02-20 23:58:29,562 INFO L290 TraceCheckUtils]: 37: Hoare triple {6276#(= |#length| |old(#length)|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6280#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| (_ bv12 32))))} is VALID [2022-02-20 23:58:29,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {6280#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| (_ bv12 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6280#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| (_ bv12 32))))} is VALID [2022-02-20 23:58:29,562 INFO L290 TraceCheckUtils]: 39: Hoare triple {6280#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| (_ bv12 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {6280#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| (_ bv12 32))))} is VALID [2022-02-20 23:58:29,563 INFO L290 TraceCheckUtils]: 40: Hoare triple {6280#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| (_ bv12 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {6280#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| (_ bv12 32))))} is VALID [2022-02-20 23:58:29,563 INFO L290 TraceCheckUtils]: 41: Hoare triple {6280#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| (_ bv12 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {6280#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| (_ bv12 32))))} is VALID [2022-02-20 23:58:29,563 INFO L290 TraceCheckUtils]: 42: Hoare triple {6280#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| (_ bv12 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6280#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| (_ bv12 32))))} is VALID [2022-02-20 23:58:29,563 INFO L290 TraceCheckUtils]: 43: Hoare triple {6280#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| (_ bv12 32))))} assume true; {6280#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| (_ bv12 32))))} is VALID [2022-02-20 23:58:29,584 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6280#(exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| (_ bv12 32))))} {6272#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_dll_append_~head#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} #190#return; {6302#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (or (= |ULTIMATE.start_dll_append_~head#1.base| |node_create_~temp~0#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_dll_append_~head#1.base|))) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:29,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {6302#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (or (= |ULTIMATE.start_dll_append_~head#1.base| |node_create_~temp~0#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_dll_append_~head#1.base|))) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {6302#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (or (= |ULTIMATE.start_dll_append_~head#1.base| |node_create_~temp~0#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_dll_append_~head#1.base|))) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:29,586 INFO L290 TraceCheckUtils]: 46: Hoare triple {6302#(and (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (or (= |ULTIMATE.start_dll_append_~head#1.base| |node_create_~temp~0#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_dll_append_~head#1.base|))) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, dll_append_~head#1.offset), #length[dll_append_~head#1.base]) && ~bvule32(dll_append_~head#1.offset, ~bvadd32(4bv32, dll_append_~head#1.offset))) && ~bvule32(0bv32, dll_append_~head#1.offset)); {6156#false} is VALID [2022-02-20 23:58:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:58:29,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:29,809 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:29,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599469861] [2022-02-20 23:58:29,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599469861] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:29,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1242292636] [2022-02-20 23:58:29,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:29,809 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:58:29,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:58:29,810 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:58:29,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-02-20 23:58:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:30,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 23:58:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:30,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:30,191 INFO L390 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 [2022-02-20 23:58:30,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:58:30,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:30,337 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:58:30,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:58:32,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:32,635 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:58:32,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:58:32,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:32,958 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:58:33,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {6155#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {6155#true} is VALID [2022-02-20 23:58:33,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {6155#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,009 INFO L272 TraceCheckUtils]: 3: Hoare triple {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {6218#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,010 INFO L290 TraceCheckUtils]: 4: Hoare triple {6218#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,022 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {6196#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} #188#return; {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,025 INFO L272 TraceCheckUtils]: 18: Hoare triple {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {6375#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {6375#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,044 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} #188#return; {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32; {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, ~bvadd32(8bv32, dll_create_~head~0#1.offset), 4bv32); srcloc: L592 {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !~bvsgt32(dll_create_~len#1, 0bv32); {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:58:33,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {6353#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {6427#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_dll_append_~head#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:33,050 INFO L272 TraceCheckUtils]: 36: Hoare triple {6427#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_dll_append_~head#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {6375#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {6375#(and (= |#length| |old(#length)|) (not (= |#StackHeapBarrier| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,056 INFO L290 TraceCheckUtils]: 41: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,057 INFO L290 TraceCheckUtils]: 43: Hoare triple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:33,064 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6222#(and (exists ((|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_761 (_ BitVec 32))) (and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_761)))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {6427#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_dll_append_~head#1.base|)) (not (= |#StackHeapBarrier| (_ bv0 32))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} #190#return; {6272#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_dll_append_~head#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:33,065 INFO L290 TraceCheckUtils]: 45: Hoare triple {6272#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_dll_append_~head#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {6272#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_dll_append_~head#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:33,065 INFO L290 TraceCheckUtils]: 46: Hoare triple {6272#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_dll_append_~head#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= |#StackHeapBarrier| (_ bv0 32))))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, dll_append_~head#1.offset), #length[dll_append_~head#1.base]) && ~bvule32(dll_append_~head#1.offset, ~bvadd32(4bv32, dll_append_~head#1.offset))) && ~bvule32(0bv32, dll_append_~head#1.offset)); {6156#false} is VALID [2022-02-20 23:58:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 23:58:33,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:33,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1242292636] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:33,066 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:58:33,066 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 15 [2022-02-20 23:58:33,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950228130] [2022-02-20 23:58:33,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:33,066 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2022-02-20 23:58:33,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:33,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:33,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:33,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:58:33,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:33,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:58:33,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=253, Unknown=3, NotChecked=0, Total=306 [2022-02-20 23:58:33,134 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:33,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:33,825 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-02-20 23:58:33,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:58:33,825 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2022-02-20 23:58:33,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-02-20 23:58:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:33,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-02-20 23:58:33,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2022-02-20 23:58:33,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:33,957 INFO L225 Difference]: With dead ends: 100 [2022-02-20 23:58:33,957 INFO L226 Difference]: Without dead ends: 100 [2022-02-20 23:58:33,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=59, Invalid=280, Unknown=3, NotChecked=0, Total=342 [2022-02-20 23:58:33,958 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 11 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:33,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 302 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 87 Unchecked, 0.2s Time] [2022-02-20 23:58:33,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-20 23:58:33,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2022-02-20 23:58:33,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:33,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 99 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:33,960 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 99 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:33,960 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 99 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:33,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:33,961 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-02-20 23:58:33,961 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2022-02-20 23:58:33,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:33,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:33,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 100 states. [2022-02-20 23:58:33,963 INFO L87 Difference]: Start difference. First operand has 99 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 100 states. [2022-02-20 23:58:33,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:33,964 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-02-20 23:58:33,964 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2022-02-20 23:58:33,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:33,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:33,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:33,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 94 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2022-02-20 23:58:33,966 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 47 [2022-02-20 23:58:33,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:33,966 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2022-02-20 23:58:33,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-02-20 23:58:33,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 23:58:33,967 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:33,967 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:33,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:34,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:34,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:58:34,371 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:58:34,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:34,372 INFO L85 PathProgramCache]: Analyzing trace with hash 994198465, now seen corresponding path program 1 times [2022-02-20 23:58:34,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:34,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797596239] [2022-02-20 23:58:34,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:34,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:34,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:34,373 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:58:34,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-02-20 23:58:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:34,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:58:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:34,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:34,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {6861#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {6861#true} is VALID [2022-02-20 23:58:34,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {6861#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {6861#true} is VALID [2022-02-20 23:58:34,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {6861#true} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {6861#true} is VALID [2022-02-20 23:58:34,644 INFO L272 TraceCheckUtils]: 3: Hoare triple {6861#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {6861#true} is VALID [2022-02-20 23:58:34,644 INFO L290 TraceCheckUtils]: 4: Hoare triple {6861#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6861#true} is VALID [2022-02-20 23:58:34,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {6861#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6861#true} is VALID [2022-02-20 23:58:34,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {6861#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {6861#true} is VALID [2022-02-20 23:58:34,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {6861#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {6861#true} is VALID [2022-02-20 23:58:34,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {6861#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {6861#true} is VALID [2022-02-20 23:58:34,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {6861#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6861#true} is VALID [2022-02-20 23:58:34,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {6861#true} assume true; {6861#true} is VALID [2022-02-20 23:58:34,644 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6861#true} {6861#true} #188#return; {6861#true} is VALID [2022-02-20 23:58:34,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {6861#true} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {6861#true} is VALID [2022-02-20 23:58:34,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {6861#true} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {6861#true} is VALID [2022-02-20 23:58:34,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {6861#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {6861#true} is VALID [2022-02-20 23:58:34,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {6861#true} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {6861#true} is VALID [2022-02-20 23:58:34,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {6861#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {6861#true} is VALID [2022-02-20 23:58:34,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {6861#true} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {6861#true} is VALID [2022-02-20 23:58:34,645 INFO L272 TraceCheckUtils]: 18: Hoare triple {6861#true} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {6861#true} is VALID [2022-02-20 23:58:34,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {6861#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6861#true} is VALID [2022-02-20 23:58:34,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {6861#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6861#true} is VALID [2022-02-20 23:58:34,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {6861#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {6861#true} is VALID [2022-02-20 23:58:34,646 INFO L290 TraceCheckUtils]: 22: Hoare triple {6861#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {6861#true} is VALID [2022-02-20 23:58:34,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {6861#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {6861#true} is VALID [2022-02-20 23:58:34,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {6861#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6861#true} is VALID [2022-02-20 23:58:34,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {6861#true} assume true; {6861#true} is VALID [2022-02-20 23:58:34,646 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6861#true} {6861#true} #188#return; {6861#true} is VALID [2022-02-20 23:58:34,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {6861#true} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {6861#true} is VALID [2022-02-20 23:58:34,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {6861#true} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {6861#true} is VALID [2022-02-20 23:58:34,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {6861#true} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {6861#true} is VALID [2022-02-20 23:58:34,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {6861#true} assume dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32; {6861#true} is VALID [2022-02-20 23:58:34,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {6861#true} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, ~bvadd32(8bv32, dll_create_~head~0#1.offset), 4bv32); srcloc: L592 {6861#true} is VALID [2022-02-20 23:58:34,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {6861#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {6861#true} is VALID [2022-02-20 23:58:34,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {6861#true} assume !~bvsgt32(dll_create_~len#1, 0bv32); {6861#true} is VALID [2022-02-20 23:58:34,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {6861#true} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {6861#true} is VALID [2022-02-20 23:58:34,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {6861#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {6861#true} is VALID [2022-02-20 23:58:34,647 INFO L272 TraceCheckUtils]: 36: Hoare triple {6861#true} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {6861#true} is VALID [2022-02-20 23:58:34,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {6861#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {6861#true} is VALID [2022-02-20 23:58:34,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {6861#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {6861#true} is VALID [2022-02-20 23:58:34,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {6861#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {6861#true} is VALID [2022-02-20 23:58:34,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {6861#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {6861#true} is VALID [2022-02-20 23:58:34,648 INFO L290 TraceCheckUtils]: 41: Hoare triple {6861#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {6861#true} is VALID [2022-02-20 23:58:34,648 INFO L290 TraceCheckUtils]: 42: Hoare triple {6861#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {6861#true} is VALID [2022-02-20 23:58:34,648 INFO L290 TraceCheckUtils]: 43: Hoare triple {6861#true} assume true; {6861#true} is VALID [2022-02-20 23:58:34,648 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6861#true} {6861#true} #190#return; {6861#true} is VALID [2022-02-20 23:58:34,648 INFO L290 TraceCheckUtils]: 45: Hoare triple {6861#true} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {6861#true} is VALID [2022-02-20 23:58:34,649 INFO L290 TraceCheckUtils]: 46: Hoare triple {6861#true} SUMMARY for call dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset := read~$Pointer$(dll_append_~head#1.base, dll_append_~head#1.offset, 4bv32); srcloc: L608 {7004#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|))} is VALID [2022-02-20 23:58:34,654 INFO L290 TraceCheckUtils]: 47: Hoare triple {7004#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|))} assume !(0bv32 == dll_append_#t~mem8#1.base && 0bv32 == dll_append_#t~mem8#1.offset);havoc dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset; {7004#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|))} is VALID [2022-02-20 23:58:34,654 INFO L290 TraceCheckUtils]: 48: Hoare triple {7004#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|))} assume !(1bv1 == #valid[dll_append_~head#1.base]); {6862#false} is VALID [2022-02-20 23:58:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-02-20 23:58:34,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:34,655 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:34,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797596239] [2022-02-20 23:58:34,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797596239] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:34,655 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:34,655 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:58:34,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482944791] [2022-02-20 23:58:34,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:34,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-02-20 23:58:34,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:34,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:34,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:34,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:58:34,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:34,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:58:34,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:34,682 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:34,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:34,944 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2022-02-20 23:58:34,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:58:34,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-02-20 23:58:34,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-02-20 23:58:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:34,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-02-20 23:58:34,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-02-20 23:58:35,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:35,049 INFO L225 Difference]: With dead ends: 109 [2022-02-20 23:58:35,049 INFO L226 Difference]: Without dead ends: 109 [2022-02-20 23:58:35,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:58:35,049 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 68 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:35,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 90 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:35,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-20 23:58:35,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2022-02-20 23:58:35,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:35,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 97 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 92 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:35,052 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 97 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 92 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:35,052 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 97 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 92 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:35,053 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2022-02-20 23:58:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2022-02-20 23:58:35,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:35,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:35,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 92 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 109 states. [2022-02-20 23:58:35,054 INFO L87 Difference]: Start difference. First operand has 97 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 92 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 109 states. [2022-02-20 23:58:35,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:35,055 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2022-02-20 23:58:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2022-02-20 23:58:35,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:35,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:35,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:35,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 92 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-02-20 23:58:35,057 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 49 [2022-02-20 23:58:35,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:35,058 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-02-20 23:58:35,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:58:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-02-20 23:58:35,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 23:58:35,058 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:35,058 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:35,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:35,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:58:35,265 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:58:35,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:35,265 INFO L85 PathProgramCache]: Analyzing trace with hash 994198466, now seen corresponding path program 1 times [2022-02-20 23:58:35,266 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:35,266 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610374502] [2022-02-20 23:58:35,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:35,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:35,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:35,267 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:58:35,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-02-20 23:58:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:35,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:58:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:35,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:35,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {7434#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {7434#true} is VALID [2022-02-20 23:58:35,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {7434#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,556 INFO L272 TraceCheckUtils]: 3: Hoare triple {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {7434#true} is VALID [2022-02-20 23:58:35,556 INFO L290 TraceCheckUtils]: 4: Hoare triple {7434#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {7434#true} is VALID [2022-02-20 23:58:35,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {7434#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {7434#true} is VALID [2022-02-20 23:58:35,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {7434#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {7434#true} is VALID [2022-02-20 23:58:35,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {7434#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {7434#true} is VALID [2022-02-20 23:58:35,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {7434#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {7434#true} is VALID [2022-02-20 23:58:35,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {7434#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7434#true} is VALID [2022-02-20 23:58:35,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {7434#true} assume true; {7434#true} is VALID [2022-02-20 23:58:35,557 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {7434#true} {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} #188#return; {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,559 INFO L272 TraceCheckUtils]: 18: Hoare triple {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {7434#true} is VALID [2022-02-20 23:58:35,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {7434#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {7434#true} is VALID [2022-02-20 23:58:35,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {7434#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {7434#true} is VALID [2022-02-20 23:58:35,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {7434#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {7434#true} is VALID [2022-02-20 23:58:35,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {7434#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {7434#true} is VALID [2022-02-20 23:58:35,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {7434#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {7434#true} is VALID [2022-02-20 23:58:35,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {7434#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7434#true} is VALID [2022-02-20 23:58:35,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {7434#true} assume true; {7434#true} is VALID [2022-02-20 23:58:35,560 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7434#true} {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} #188#return; {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} assume dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32; {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, ~bvadd32(8bv32, dll_create_~head~0#1.offset), 4bv32); srcloc: L592 {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,561 INFO L290 TraceCheckUtils]: 32: Hoare triple {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,561 INFO L290 TraceCheckUtils]: 33: Hoare triple {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} assume !~bvsgt32(dll_create_~len#1, 0bv32); {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,562 INFO L290 TraceCheckUtils]: 34: Hoare triple {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {7442#(= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {7545#(= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,562 INFO L272 TraceCheckUtils]: 36: Hoare triple {7545#(= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32))} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {7434#true} is VALID [2022-02-20 23:58:35,562 INFO L290 TraceCheckUtils]: 37: Hoare triple {7434#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {7434#true} is VALID [2022-02-20 23:58:35,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {7434#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {7434#true} is VALID [2022-02-20 23:58:35,562 INFO L290 TraceCheckUtils]: 39: Hoare triple {7434#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {7434#true} is VALID [2022-02-20 23:58:35,562 INFO L290 TraceCheckUtils]: 40: Hoare triple {7434#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {7434#true} is VALID [2022-02-20 23:58:35,562 INFO L290 TraceCheckUtils]: 41: Hoare triple {7434#true} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {7434#true} is VALID [2022-02-20 23:58:35,563 INFO L290 TraceCheckUtils]: 42: Hoare triple {7434#true} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7434#true} is VALID [2022-02-20 23:58:35,566 INFO L290 TraceCheckUtils]: 43: Hoare triple {7434#true} assume true; {7434#true} is VALID [2022-02-20 23:58:35,567 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7434#true} {7545#(= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32))} #190#return; {7545#(= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,567 INFO L290 TraceCheckUtils]: 45: Hoare triple {7545#(= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32))} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {7545#(= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:58:35,567 INFO L290 TraceCheckUtils]: 46: Hoare triple {7545#(= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32))} SUMMARY for call dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset := read~$Pointer$(dll_append_~head#1.base, dll_append_~head#1.offset, 4bv32); srcloc: L608 {7579#(and (bvule (bvadd |ULTIMATE.start_dll_append_~head#1.offset| (_ bv4 32)) (select |#length| |ULTIMATE.start_dll_append_~head#1.base|)) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:35,568 INFO L290 TraceCheckUtils]: 47: Hoare triple {7579#(and (bvule (bvadd |ULTIMATE.start_dll_append_~head#1.offset| (_ bv4 32)) (select |#length| |ULTIMATE.start_dll_append_~head#1.base|)) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} assume !(0bv32 == dll_append_#t~mem8#1.base && 0bv32 == dll_append_#t~mem8#1.offset);havoc dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset; {7579#(and (bvule (bvadd |ULTIMATE.start_dll_append_~head#1.offset| (_ bv4 32)) (select |#length| |ULTIMATE.start_dll_append_~head#1.base|)) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:35,568 INFO L290 TraceCheckUtils]: 48: Hoare triple {7579#(and (bvule (bvadd |ULTIMATE.start_dll_append_~head#1.offset| (_ bv4 32)) (select |#length| |ULTIMATE.start_dll_append_~head#1.base|)) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, dll_append_~head#1.offset), #length[dll_append_~head#1.base]) && ~bvule32(dll_append_~head#1.offset, ~bvadd32(4bv32, dll_append_~head#1.offset))) && ~bvule32(0bv32, dll_append_~head#1.offset)); {7435#false} is VALID [2022-02-20 23:58:35,568 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-02-20 23:58:35,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:58:35,569 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:35,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610374502] [2022-02-20 23:58:35,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610374502] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:58:35,569 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:58:35,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:58:35,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815919551] [2022-02-20 23:58:35,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:58:35,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2022-02-20 23:58:35,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:35,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:35,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:35,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:58:35,596 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:35,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:58:35,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:58:35,597 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:35,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:35,932 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2022-02-20 23:58:35,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:58:35,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2022-02-20 23:58:35,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:35,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:35,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-02-20 23:58:35,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-02-20 23:58:35,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 98 transitions. [2022-02-20 23:58:36,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:36,049 INFO L225 Difference]: With dead ends: 95 [2022-02-20 23:58:36,050 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 23:58:36,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:58:36,050 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 211 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:36,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 102 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:58:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 23:58:36,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-02-20 23:58:36,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:36,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 90 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:36,053 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 90 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:36,053 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 90 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:36,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:36,055 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2022-02-20 23:58:36,055 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2022-02-20 23:58:36,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:36,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:36,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 90 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 95 states. [2022-02-20 23:58:36,055 INFO L87 Difference]: Start difference. First operand has 95 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 90 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 95 states. [2022-02-20 23:58:36,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:36,057 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2022-02-20 23:58:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2022-02-20 23:58:36,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:36,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:36,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:36,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:36,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 90 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:36,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2022-02-20 23:58:36,058 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 49 [2022-02-20 23:58:36,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:36,059 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2022-02-20 23:58:36,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:58:36,059 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2022-02-20 23:58:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 23:58:36,059 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:36,060 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:36,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-02-20 23:58:36,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:58:36,268 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:58:36,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:36,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1941985862, now seen corresponding path program 1 times [2022-02-20 23:58:36,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:36,269 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918458660] [2022-02-20 23:58:36,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:36,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:36,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:36,270 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:58:36,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-02-20 23:58:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:36,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 23:58:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:36,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:36,628 INFO L390 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 [2022-02-20 23:58:36,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 [2022-02-20 23:58:36,832 INFO L390 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 11 treesize of output 7 [2022-02-20 23:58:37,130 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-02-20 23:58:37,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 23 treesize of output 34 [2022-02-20 23:58:37,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:37,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-02-20 23:58:37,466 INFO L390 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 28 treesize of output 16 [2022-02-20 23:58:37,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {7969#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {7969#true} is VALID [2022-02-20 23:58:37,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {7969#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:37,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:37,556 INFO L272 TraceCheckUtils]: 3: Hoare triple {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:37,557 INFO L290 TraceCheckUtils]: 4: Hoare triple {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:37,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:37,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:37,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:37,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:37,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:37,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume true; {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:37,559 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} #188#return; {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:37,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:37,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:37,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:37,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:37,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:37,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:37,569 INFO L272 TraceCheckUtils]: 18: Hoare triple {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:37,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:37,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:37,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:37,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:37,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:37,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8049#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:37,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {8049#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} assume true; {8049#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:37,573 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8049#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} {7977#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} #188#return; {8056#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|))))} is VALID [2022-02-20 23:58:37,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {8056#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|))))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {8060#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:58:37,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {8060#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {8060#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:58:37,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {8060#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {8060#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:58:37,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {8060#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} assume dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32; {8060#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:58:37,576 INFO L290 TraceCheckUtils]: 31: Hoare triple {8060#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, ~bvadd32(8bv32, dll_create_~head~0#1.offset), 4bv32); srcloc: L592 {8060#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:58:37,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {8060#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {8076#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:58:37,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {8076#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))))} assume !~bvsgt32(dll_create_~len#1, 0bv32); {8076#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:58:37,577 INFO L290 TraceCheckUtils]: 34: Hoare triple {8076#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {8083#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_#res#1.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:58:37,577 INFO L290 TraceCheckUtils]: 35: Hoare triple {8083#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_#res#1.base|) (_ bv1 1)) (_ bv0 1)))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {8087#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:58:37,578 INFO L272 TraceCheckUtils]: 36: Hoare triple {8087#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|)) (_ bv1 1)) (_ bv0 1)))} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {8091#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:58:37,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {8091#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {8095#(and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1138 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:58:37,580 INFO L290 TraceCheckUtils]: 38: Hoare triple {8095#(and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1138 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {8095#(and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1138 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:58:37,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {8095#(and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1138 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {8102#(and (exists ((v_ArrVal_1139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1139) |#memory_$Pointer$.base|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1138 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:37,591 WARN L290 TraceCheckUtils]: 40: Hoare triple {8102#(and (exists ((v_ArrVal_1139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1139) |#memory_$Pointer$.base|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1138 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {8102#(and (exists ((v_ArrVal_1139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1139) |#memory_$Pointer$.base|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1138 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is UNKNOWN [2022-02-20 23:58:37,601 WARN L290 TraceCheckUtils]: 41: Hoare triple {8102#(and (exists ((v_ArrVal_1139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1139) |#memory_$Pointer$.base|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1138 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {8109#(and (exists ((v_ArrVal_1141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1141) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is UNKNOWN [2022-02-20 23:58:37,603 INFO L290 TraceCheckUtils]: 42: Hoare triple {8109#(and (exists ((v_ArrVal_1141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1141) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8109#(and (exists ((v_ArrVal_1141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1141) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:37,603 INFO L290 TraceCheckUtils]: 43: Hoare triple {8109#(and (exists ((v_ArrVal_1141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1141) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {8109#(and (exists ((v_ArrVal_1141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1141) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:37,619 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8109#(and (exists ((v_ArrVal_1141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1141) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {8087#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|)) (_ bv1 1)) (_ bv0 1)))} #190#return; {8119#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|))) (_ bv1 1))))} is VALID [2022-02-20 23:58:37,626 INFO L290 TraceCheckUtils]: 45: Hoare triple {8119#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|))) (_ bv1 1))))} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {8119#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|))) (_ bv1 1))))} is VALID [2022-02-20 23:58:37,630 INFO L290 TraceCheckUtils]: 46: Hoare triple {8119#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|))) (_ bv1 1))))} SUMMARY for call dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset := read~$Pointer$(dll_append_~head#1.base, dll_append_~head#1.offset, 4bv32); srcloc: L608 {8119#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|))) (_ bv1 1))))} is VALID [2022-02-20 23:58:37,639 INFO L290 TraceCheckUtils]: 47: Hoare triple {8119#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|))) (_ bv1 1))))} assume !(0bv32 == dll_append_#t~mem8#1.base && 0bv32 == dll_append_#t~mem8#1.offset);havoc dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset; {8119#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|))) (_ bv1 1))))} is VALID [2022-02-20 23:58:37,640 INFO L290 TraceCheckUtils]: 48: Hoare triple {8119#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|))) (_ bv1 1))))} SUMMARY for call dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset := read~$Pointer$(dll_append_~head#1.base, dll_append_~head#1.offset, 4bv32); srcloc: L611 {8132#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_dll_append_#t~mem9#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:58:37,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {8132#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_dll_append_#t~mem9#1.base|)) (_ bv1 1)))} dll_append_~last~0#1.base, dll_append_~last~0#1.offset := dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset;havoc dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset; {8136#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_dll_append_~last~0#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:58:37,641 INFO L290 TraceCheckUtils]: 50: Hoare triple {8136#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_dll_append_~last~0#1.base|)) (_ bv1 1)) (_ bv0 1))} assume !(1bv1 == #valid[dll_append_~last~0#1.base]); {7970#false} is VALID [2022-02-20 23:58:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:58:37,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:37,813 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:37,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918458660] [2022-02-20 23:58:37,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918458660] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:37,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2143552879] [2022-02-20 23:58:37,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:37,814 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:58:37,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:58:37,815 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:58:37,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-02-20 23:58:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:38,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-20 23:58:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:38,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:38,310 INFO L390 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 [2022-02-20 23:58:38,672 INFO L390 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 11 treesize of output 7 [2022-02-20 23:58:38,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:38,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 18 treesize of output 20 [2022-02-20 23:58:38,963 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-02-20 23:58:38,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 23 treesize of output 34 [2022-02-20 23:58:39,282 INFO L390 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 27 treesize of output 15 [2022-02-20 23:58:39,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {7969#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {7969#true} is VALID [2022-02-20 23:58:39,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {7969#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:39,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:39,345 INFO L272 TraceCheckUtils]: 3: Hoare triple {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:39,345 INFO L290 TraceCheckUtils]: 4: Hoare triple {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:39,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:39,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:39,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:39,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:39,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:39,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume true; {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:39,348 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} #188#return; {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:39,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:39,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:39,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:39,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:39,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:39,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:39,351 INFO L272 TraceCheckUtils]: 18: Hoare triple {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:39,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {7984#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:39,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:39,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:39,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:39,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:39,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {8033#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8049#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:39,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {8049#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} assume true; {8049#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:39,355 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8049#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} {8166#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} #188#return; {8242#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|))))} is VALID [2022-02-20 23:58:39,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {8242#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|))))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {8246#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:58:39,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {8246#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {8246#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:58:39,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {8246#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {8246#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:58:39,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {8246#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} assume dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32; {8246#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:58:39,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {8246#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, ~bvadd32(8bv32, dll_create_~head~0#1.offset), 4bv32); srcloc: L592 {8246#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:58:39,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {8246#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {8262#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:58:39,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {8262#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))))} assume !~bvsgt32(dll_create_~len#1, 0bv32); {8262#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:58:39,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {8262#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {8269#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_#res#1.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:58:39,359 INFO L290 TraceCheckUtils]: 35: Hoare triple {8269#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_#res#1.base|) (_ bv1 1)) (_ bv0 1)))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {8273#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv1 1))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:39,360 INFO L272 TraceCheckUtils]: 36: Hoare triple {8273#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv1 1))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {8091#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:58:39,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {8091#(and (= |old(#valid)| |#valid|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {8095#(and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1138 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:58:39,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {8095#(and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1138 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {8095#(and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1138 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:58:39,367 INFO L290 TraceCheckUtils]: 39: Hoare triple {8095#(and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1138 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {8102#(and (exists ((v_ArrVal_1139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1139) |#memory_$Pointer$.base|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1138 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:39,378 WARN L290 TraceCheckUtils]: 40: Hoare triple {8102#(and (exists ((v_ArrVal_1139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1139) |#memory_$Pointer$.base|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1138 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {8102#(and (exists ((v_ArrVal_1139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1139) |#memory_$Pointer$.base|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1138 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is UNKNOWN [2022-02-20 23:58:39,388 WARN L290 TraceCheckUtils]: 41: Hoare triple {8102#(and (exists ((v_ArrVal_1139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1139) |#memory_$Pointer$.base|)) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1138 (_ BitVec 1))) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {8109#(and (exists ((v_ArrVal_1141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1141) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is UNKNOWN [2022-02-20 23:58:39,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {8109#(and (exists ((v_ArrVal_1141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1141) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8109#(and (exists ((v_ArrVal_1141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1141) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:39,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {8109#(and (exists ((v_ArrVal_1141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1141) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {8109#(and (exists ((v_ArrVal_1141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1141) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:39,404 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8109#(and (exists ((v_ArrVal_1141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1141) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1138) |#valid|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {8273#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv1 1))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} #190#return; {8301#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv1 1))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:39,405 INFO L290 TraceCheckUtils]: 45: Hoare triple {8301#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv1 1))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {8301#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv1 1))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:39,405 INFO L290 TraceCheckUtils]: 46: Hoare triple {8301#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv1 1))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} SUMMARY for call dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset := read~$Pointer$(dll_append_~head#1.base, dll_append_~head#1.offset, 4bv32); srcloc: L608 {8301#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv1 1))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:39,406 INFO L290 TraceCheckUtils]: 47: Hoare triple {8301#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv1 1))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} assume !(0bv32 == dll_append_#t~mem8#1.base && 0bv32 == dll_append_#t~mem8#1.offset);havoc dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset; {8301#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv1 1))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:39,406 INFO L290 TraceCheckUtils]: 48: Hoare triple {8301#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv1 1))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} SUMMARY for call dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset := read~$Pointer$(dll_append_~head#1.base, dll_append_~head#1.offset, 4bv32); srcloc: L611 {8132#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_dll_append_#t~mem9#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:58:39,407 INFO L290 TraceCheckUtils]: 49: Hoare triple {8132#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_dll_append_#t~mem9#1.base|)) (_ bv1 1)))} dll_append_~last~0#1.base, dll_append_~last~0#1.offset := dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset;havoc dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset; {8136#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_dll_append_~last~0#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:58:39,407 INFO L290 TraceCheckUtils]: 50: Hoare triple {8136#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_dll_append_~last~0#1.base|)) (_ bv1 1)) (_ bv0 1))} assume !(1bv1 == #valid[dll_append_~last~0#1.base]); {7970#false} is VALID [2022-02-20 23:58:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:58:39,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:39,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2143552879] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:39,584 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:58:39,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-02-20 23:58:39,584 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955063250] [2022-02-20 23:58:39,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:58:39,585 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-02-20 23:58:39,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:58:39,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:58:39,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 72 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:39,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 23:58:39,719 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:58:39,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 23:58:39,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=602, Unknown=5, NotChecked=0, Total=702 [2022-02-20 23:58:39,720 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 25 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:58:41,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:41,862 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2022-02-20 23:58:41,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:58:41,863 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-02-20 23:58:41,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:58:41,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:58:41,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 152 transitions. [2022-02-20 23:58:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:58:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 152 transitions. [2022-02-20 23:58:41,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 152 transitions. [2022-02-20 23:58:42,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 150 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 23:58:42,056 INFO L225 Difference]: With dead ends: 139 [2022-02-20 23:58:42,056 INFO L226 Difference]: Without dead ends: 139 [2022-02-20 23:58:42,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 77 SyntacticMatches, 12 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=958, Unknown=9, NotChecked=0, Total=1122 [2022-02-20 23:58:42,057 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 85 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:58:42,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 651 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 354 Invalid, 0 Unknown, 77 Unchecked, 0.6s Time] [2022-02-20 23:58:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-02-20 23:58:42,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 94. [2022-02-20 23:58:42,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:58:42,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 94 states, 63 states have (on average 1.5555555555555556) internal successors, (98), 89 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:42,059 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 94 states, 63 states have (on average 1.5555555555555556) internal successors, (98), 89 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:42,059 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 94 states, 63 states have (on average 1.5555555555555556) internal successors, (98), 89 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:42,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:42,061 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2022-02-20 23:58:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2022-02-20 23:58:42,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:42,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:42,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 63 states have (on average 1.5555555555555556) internal successors, (98), 89 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 139 states. [2022-02-20 23:58:42,062 INFO L87 Difference]: Start difference. First operand has 94 states, 63 states have (on average 1.5555555555555556) internal successors, (98), 89 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 139 states. [2022-02-20 23:58:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:58:42,064 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2022-02-20 23:58:42,064 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2022-02-20 23:58:42,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:58:42,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:58:42,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:58:42,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:58:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 63 states have (on average 1.5555555555555556) internal successors, (98), 89 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:58:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-02-20 23:58:42,066 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 51 [2022-02-20 23:58:42,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:58:42,066 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-02-20 23:58:42,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 23:58:42,066 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-02-20 23:58:42,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 23:58:42,067 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:58:42,067 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:58:42,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2022-02-20 23:58:42,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-02-20 23:58:42,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:58:42,471 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 43 more)] === [2022-02-20 23:58:42,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:58:42,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1941985863, now seen corresponding path program 1 times [2022-02-20 23:58:42,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:58:42,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688256132] [2022-02-20 23:58:42,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:42,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:58:42,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:58:42,473 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:58:42,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-02-20 23:58:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:42,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 47 conjunts are in the unsatisfiable core [2022-02-20 23:58:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:42,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:42,832 INFO L390 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 [2022-02-20 23:58:42,836 INFO L390 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 [2022-02-20 23:58:43,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 [2022-02-20 23:58:43,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 [2022-02-20 23:58:43,240 INFO L390 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 21 treesize of output 13 [2022-02-20 23:58:43,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-02-20 23:58:43,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:43,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-02-20 23:58:43,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:43,654 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-20 23:58:43,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:43,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 16 [2022-02-20 23:58:43,684 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-02-20 23:58:43,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-02-20 23:58:44,027 INFO L390 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 25 treesize of output 13 [2022-02-20 23:58:44,036 INFO L390 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 7 [2022-02-20 23:58:44,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {8865#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {8865#true} is VALID [2022-02-20 23:58:44,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {8865#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:44,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:44,132 INFO L272 TraceCheckUtils]: 3: Hoare triple {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:44,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:44,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:44,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:44,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:44,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:44,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:44,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume true; {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:44,134 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} #188#return; {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:44,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:44,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:44,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:44,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:44,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:44,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 23:58:44,138 INFO L272 TraceCheckUtils]: 18: Hoare triple {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:44,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:44,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:44,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:44,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:44,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:44,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8945#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:44,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {8945#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} assume true; {8945#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:44,143 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8945#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} {8873#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} #188#return; {8952#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_create_#t~ret4#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|))) (= (_ bv12 32) (select |#length| |ULTIMATE.start_dll_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:58:44,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {8952#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_create_#t~ret4#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|))) (= (_ bv12 32) (select |#length| |ULTIMATE.start_dll_create_#t~ret4#1.base|)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {8956#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:44,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {8956#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {8956#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:44,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {8956#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {8956#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:44,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {8956#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} assume dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32; {8956#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:44,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {8956#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, ~bvadd32(8bv32, dll_create_~head~0#1.offset), 4bv32); srcloc: L592 {8956#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:44,160 INFO L290 TraceCheckUtils]: 32: Hoare triple {8956#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {8972#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:58:44,161 INFO L290 TraceCheckUtils]: 33: Hoare triple {8972#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))))} assume !~bvsgt32(dll_create_~len#1, 0bv32); {8972#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:58:44,161 INFO L290 TraceCheckUtils]: 34: Hoare triple {8972#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {8979#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_create_#res#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_create_#res#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_#res#1.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:58:44,162 INFO L290 TraceCheckUtils]: 35: Hoare triple {8979#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_create_#res#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_create_#res#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_#res#1.base|) (_ bv1 1)) (_ bv0 1)))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {8983#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|)) (_ bv12 32)) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:58:44,163 INFO L272 TraceCheckUtils]: 36: Hoare triple {8983#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|)) (_ bv12 32)) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|)) (_ bv1 1)) (_ bv0 1)))} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {8987#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:58:44,164 INFO L290 TraceCheckUtils]: 37: Hoare triple {8987#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {8991#(and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1351 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:58:44,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {8991#(and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1351 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {8991#(and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1351 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:58:44,167 INFO L290 TraceCheckUtils]: 39: Hoare triple {8991#(and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1351 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {8998#(and (exists ((v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1352))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1351 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (exists ((v_ArrVal_1353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1353) |#memory_$Pointer$.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:44,182 WARN L290 TraceCheckUtils]: 40: Hoare triple {8998#(and (exists ((v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1352))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1351 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (exists ((v_ArrVal_1353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1353) |#memory_$Pointer$.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {8998#(and (exists ((v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1352))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1351 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (exists ((v_ArrVal_1353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1353) |#memory_$Pointer$.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is UNKNOWN [2022-02-20 23:58:44,218 WARN L290 TraceCheckUtils]: 41: Hoare triple {8998#(and (exists ((v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1352))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1351 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (exists ((v_ArrVal_1353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1353) |#memory_$Pointer$.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {9005#(and (exists ((v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1357) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1356) |#memory_$Pointer$.offset|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is UNKNOWN [2022-02-20 23:58:44,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {9005#(and (exists ((v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1357) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1356) |#memory_$Pointer$.offset|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9005#(and (exists ((v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1357) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1356) |#memory_$Pointer$.offset|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:44,220 INFO L290 TraceCheckUtils]: 43: Hoare triple {9005#(and (exists ((v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1357) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1356) |#memory_$Pointer$.offset|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {9005#(and (exists ((v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1357) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1356) |#memory_$Pointer$.offset|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:44,237 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9005#(and (exists ((v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1357) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1356) |#memory_$Pointer$.offset|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {8983#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|)) (_ bv12 32)) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|)) (_ bv1 1)) (_ bv0 1)))} #190#return; {9015#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|)) (_ bv12 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:58:44,241 INFO L290 TraceCheckUtils]: 45: Hoare triple {9015#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|)) (_ bv12 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {9015#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|)) (_ bv12 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:58:44,254 INFO L290 TraceCheckUtils]: 46: Hoare triple {9015#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|)) (_ bv12 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} SUMMARY for call dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset := read~$Pointer$(dll_append_~head#1.base, dll_append_~head#1.offset, 4bv32); srcloc: L608 {9015#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|)) (_ bv12 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:58:44,260 INFO L290 TraceCheckUtils]: 47: Hoare triple {9015#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|)) (_ bv12 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} assume !(0bv32 == dll_append_#t~mem8#1.base && 0bv32 == dll_append_#t~mem8#1.offset);havoc dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset; {9015#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|)) (_ bv12 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} is VALID [2022-02-20 23:58:44,261 INFO L290 TraceCheckUtils]: 48: Hoare triple {9015#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|)) (_ bv12 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) |ULTIMATE.start_dll_append_~head#1.offset|) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))))} SUMMARY for call dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset := read~$Pointer$(dll_append_~head#1.base, dll_append_~head#1.offset, 4bv32); srcloc: L611 {9028#(and (= |ULTIMATE.start_dll_append_#t~mem9#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_append_#t~mem9#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:44,261 INFO L290 TraceCheckUtils]: 49: Hoare triple {9028#(and (= |ULTIMATE.start_dll_append_#t~mem9#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_append_#t~mem9#1.base|) (_ bv12 32)))} dll_append_~last~0#1.base, dll_append_~last~0#1.offset := dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset;havoc dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset; {9032#(and (= (_ bv0 32) |ULTIMATE.start_dll_append_~last~0#1.offset|) (= (_ bv12 32) (select |#length| |ULTIMATE.start_dll_append_~last~0#1.base|)))} is VALID [2022-02-20 23:58:44,261 INFO L290 TraceCheckUtils]: 50: Hoare triple {9032#(and (= (_ bv0 32) |ULTIMATE.start_dll_append_~last~0#1.offset|) (= (_ bv12 32) (select |#length| |ULTIMATE.start_dll_append_~last~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, dll_append_~last~0#1.offset)), #length[dll_append_~last~0#1.base]) && ~bvule32(~bvadd32(4bv32, dll_append_~last~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, dll_append_~last~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, dll_append_~last~0#1.offset))); {8866#false} is VALID [2022-02-20 23:58:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:58:44,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:58:44,836 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:58:44,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688256132] [2022-02-20 23:58:44,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688256132] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:58:44,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1752730991] [2022-02-20 23:58:44,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:58:44,836 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:58:44,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:58:44,838 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:58:44,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-02-20 23:58:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:45,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 46 conjunts are in the unsatisfiable core [2022-02-20 23:58:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:58:45,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:58:45,391 INFO L390 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 [2022-02-20 23:58:45,396 INFO L390 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 [2022-02-20 23:58:45,926 INFO L390 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 21 treesize of output 13 [2022-02-20 23:58:45,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-02-20 23:58:46,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:46,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-02-20 23:58:46,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:46,295 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-20 23:58:46,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:58:46,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 16 [2022-02-20 23:58:46,329 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-02-20 23:58:46,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-02-20 23:58:46,653 INFO L390 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 25 treesize of output 13 [2022-02-20 23:58:46,663 INFO L390 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 7 [2022-02-20 23:58:46,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {8865#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {8865#true} is VALID [2022-02-20 23:58:46,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {8865#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~post17#1, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0bv32, 0bv32; {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:46,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:46,710 INFO L272 TraceCheckUtils]: 3: Hoare triple {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:46,710 INFO L290 TraceCheckUtils]: 4: Hoare triple {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:46,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:46,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:46,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:46,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:46,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:46,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume true; {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:46,712 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} #188#return; {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:46,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:46,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:46,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:46,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} assume !(dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32); {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:46,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:46,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} assume !!~bvsgt32(dll_create_~len#1, 0bv32); {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:46,715 INFO L272 TraceCheckUtils]: 18: Hoare triple {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} call dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset := node_create(dll_create_~data#1); {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 23:58:46,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {8880#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:46,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:46,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:46,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:46,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:46,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {8929#(and (= (select |#valid| |node_create_~temp~0#1.base|) (_ bv1 1)) (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= (select |#length| |node_create_~temp~0#1.base|) (_ bv12 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {8945#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:46,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {8945#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} assume true; {8945#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:58:46,720 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8945#(and (= (select |#length| |node_create_#res#1.base|) (_ bv12 32)) (= |node_create_#res#1.offset| (_ bv0 32)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= (select |#valid| |node_create_#res#1.base|) (_ bv1 1)))} {9064#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} #188#return; {9140#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_dll_create_#t~ret4#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|))) (= (_ bv12 32) (select |#length| |ULTIMATE.start_dll_create_#t~ret4#1.base|)))} is VALID [2022-02-20 23:58:46,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {9140#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_dll_create_#t~ret4#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_dll_create_#t~ret4#1.base|))) (= (_ bv12 32) (select |#length| |ULTIMATE.start_dll_create_#t~ret4#1.base|)))} dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset;havoc dll_create_#t~ret4#1.base, dll_create_#t~ret4#1.offset; {9144#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:46,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {9144#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4bv32); srcloc: L589 {9144#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:46,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {9144#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, ~bvadd32(4bv32, dll_create_~new_head~0#1.offset), 4bv32); srcloc: L589-1 {9144#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:46,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {9144#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} assume dll_create_~head~0#1.base != 0bv32 || dll_create_~head~0#1.offset != 0bv32; {9144#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:46,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {9144#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, ~bvadd32(8bv32, dll_create_~head~0#1.offset), 4bv32); srcloc: L592 {9144#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:46,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {9144#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv0 32)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := ~bvsub32(dll_create_#t~post5#1, 1bv32);havoc dll_create_#t~post5#1; {9160#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:58:46,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {9160#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))))} assume !~bvsgt32(dll_create_~len#1, 0bv32); {9160#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:58:46,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {9160#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (_ bv0 32) |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) (_ bv1 1))))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {9167#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_dll_create_#res#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_create_#res#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_#res#1.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:58:46,724 INFO L290 TraceCheckUtils]: 35: Hoare triple {9167#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_dll_create_#res#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_create_#res#1.base|) (_ bv12 32)) (= (bvadd (select |#valid| |ULTIMATE.start_dll_create_#res#1.base|) (_ bv1 1)) (_ bv0 1)))} main_#t~ret12#1.base, main_#t~ret12#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;main_~uneq~0#1 := 5bv32;assume { :begin_inline_dll_append } true;dll_append_#in~head#1.base, dll_append_#in~head#1.offset, dll_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset, dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset, dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset, dll_append_#t~mem10#1.base, dll_append_#t~mem10#1.offset, dll_append_#t~mem11#1.base, dll_append_#t~mem11#1.offset, dll_append_~last~0#1.base, dll_append_~last~0#1.offset, dll_append_~head#1.base, dll_append_~head#1.offset, dll_append_~data#1, dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset;dll_append_~head#1.base, dll_append_~head#1.offset := dll_append_#in~head#1.base, dll_append_#in~head#1.offset;dll_append_~data#1 := dll_append_#in~data#1; {9171#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv1 1))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:46,738 INFO L272 TraceCheckUtils]: 36: Hoare triple {9171#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv1 1))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} call dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset := node_create(dll_append_~data#1); {8987#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:58:46,739 INFO L290 TraceCheckUtils]: 37: Hoare triple {8987#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {8991#(and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1351 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:58:46,739 INFO L290 TraceCheckUtils]: 38: Hoare triple {8991#(and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1351 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {8991#(and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1351 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 23:58:46,757 INFO L290 TraceCheckUtils]: 39: Hoare triple {8991#(and (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1351 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32); srcloc: L577-1 {8998#(and (exists ((v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1352))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1351 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (exists ((v_ArrVal_1353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1353) |#memory_$Pointer$.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:46,771 WARN L290 TraceCheckUtils]: 40: Hoare triple {8998#(and (exists ((v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1352))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1351 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (exists ((v_ArrVal_1353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1353) |#memory_$Pointer$.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32); srcloc: L580 {8998#(and (exists ((v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1352))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1351 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (exists ((v_ArrVal_1353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1353) |#memory_$Pointer$.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is UNKNOWN [2022-02-20 23:58:46,807 WARN L290 TraceCheckUtils]: 41: Hoare triple {8998#(and (exists ((v_ArrVal_1352 (Array (_ BitVec 32) (_ BitVec 32)))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1352))) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1351 (_ BitVec 32))) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (exists ((v_ArrVal_1353 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1353) |#memory_$Pointer$.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} SUMMARY for call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32); srcloc: L581 {9005#(and (exists ((v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1357) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1356) |#memory_$Pointer$.offset|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is UNKNOWN [2022-02-20 23:58:46,809 INFO L290 TraceCheckUtils]: 42: Hoare triple {9005#(and (exists ((v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1357) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1356) |#memory_$Pointer$.offset|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} #res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {9005#(and (exists ((v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1357) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1356) |#memory_$Pointer$.offset|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:46,810 INFO L290 TraceCheckUtils]: 43: Hoare triple {9005#(and (exists ((v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1357) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1356) |#memory_$Pointer$.offset|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {9005#(and (exists ((v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1357) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1356) |#memory_$Pointer$.offset|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 23:58:46,827 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9005#(and (exists ((v_ArrVal_1357 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32)) (v_ArrVal_1356 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1351 (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1357) |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| |node_create_~temp~0#1.base|)) (= |#length| (store |old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1351)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= (store |old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1356) |#memory_$Pointer$.offset|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {9171#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv1 1))) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} #190#return; {9199#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:46,827 INFO L290 TraceCheckUtils]: 45: Hoare triple {9199#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} dll_append_~new_last~0#1.base, dll_append_~new_last~0#1.offset := dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset;havoc dll_append_#t~ret7#1.base, dll_append_#t~ret7#1.offset; {9199#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:46,828 INFO L290 TraceCheckUtils]: 46: Hoare triple {9199#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} SUMMARY for call dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset := read~$Pointer$(dll_append_~head#1.base, dll_append_~head#1.offset, 4bv32); srcloc: L608 {9199#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:46,828 INFO L290 TraceCheckUtils]: 47: Hoare triple {9199#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} assume !(0bv32 == dll_append_#t~mem8#1.base && 0bv32 == dll_append_#t~mem8#1.offset);havoc dll_append_#t~mem8#1.base, dll_append_#t~mem8#1.offset; {9199#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:58:46,829 INFO L290 TraceCheckUtils]: 48: Hoare triple {9199#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_append_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32))) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_dll_append_~head#1.offset| (_ bv0 32)))} SUMMARY for call dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset := read~$Pointer$(dll_append_~head#1.base, dll_append_~head#1.offset, 4bv32); srcloc: L611 {9028#(and (= |ULTIMATE.start_dll_append_#t~mem9#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_append_#t~mem9#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:58:46,829 INFO L290 TraceCheckUtils]: 49: Hoare triple {9028#(and (= |ULTIMATE.start_dll_append_#t~mem9#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_dll_append_#t~mem9#1.base|) (_ bv12 32)))} dll_append_~last~0#1.base, dll_append_~last~0#1.offset := dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset;havoc dll_append_#t~mem9#1.base, dll_append_#t~mem9#1.offset; {9032#(and (= (_ bv0 32) |ULTIMATE.start_dll_append_~last~0#1.offset|) (= (_ bv12 32) (select |#length| |ULTIMATE.start_dll_append_~last~0#1.base|)))} is VALID [2022-02-20 23:58:46,830 INFO L290 TraceCheckUtils]: 50: Hoare triple {9032#(and (= (_ bv0 32) |ULTIMATE.start_dll_append_~last~0#1.offset|) (= (_ bv12 32) (select |#length| |ULTIMATE.start_dll_append_~last~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, dll_append_~last~0#1.offset)), #length[dll_append_~last~0#1.base]) && ~bvule32(~bvadd32(4bv32, dll_append_~last~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, dll_append_~last~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, dll_append_~last~0#1.offset))); {8866#false} is VALID [2022-02-20 23:58:46,830 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:58:46,830 INFO L328 TraceCheckSpWp]: Computing backward predicates...