./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_append_equal.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:53:50,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:53:50,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:53:50,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:53:50,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:53:50,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:53:50,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:53:50,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:53:50,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:53:50,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:53:50,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:53:50,419 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:53:50,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:53:50,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:53:50,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:53:50,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:53:50,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:53:50,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:53:50,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:53:50,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:53:50,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:53:50,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:53:50,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:53:50,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:53:50,443 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:53:50,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:53:50,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:53:50,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:53:50,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:53:50,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:53:50,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:53:50,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:53:50,448 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:53:50,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:53:50,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:53:50,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:53:50,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:53:50,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:53:50,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:53:50,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:53:50,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:53:50,454 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:53:50,481 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:53:50,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:53:50,482 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:53:50,482 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:53:50,483 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:53:50,483 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:53:50,484 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:53:50,484 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:53:50,484 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:53:50,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:53:50,485 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:53:50,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:53:50,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:53:50,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:53:50,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:53:50,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:53:50,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:53:50,486 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:53:50,487 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:53:50,487 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:53:50,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:53:50,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:53:50,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:53:50,488 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:53:50,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:53:50,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:53:50,488 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:53:50,488 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:53:50,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:53:50,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:53:50,489 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:53:50,489 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:53:50,489 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:53:50,490 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 ! call(reach_error())) ) 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 -> 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc [2022-02-20 16:53:50,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:53:50,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:53:50,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:53:50,716 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:53:50,717 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:53:50,717 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_append_equal.i [2022-02-20 16:53:50,773 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/917601f9c/2225406861ed48a5a931d6aed36a1bef/FLAG843948acd [2022-02-20 16:53:51,197 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:53:51,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_equal.i [2022-02-20 16:53:51,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/917601f9c/2225406861ed48a5a931d6aed36a1bef/FLAG843948acd [2022-02-20 16:53:51,579 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/917601f9c/2225406861ed48a5a931d6aed36a1bef [2022-02-20 16:53:51,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:53:51,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:53:51,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:53:51,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:53:51,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:53:51,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:53:51" (1/1) ... [2022-02-20 16:53:51,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76132289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:53:51, skipping insertion in model container [2022-02-20 16:53:51,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:53:51" (1/1) ... [2022-02-20 16:53:51,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:53:51,646 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:53:51,872 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/dll2c_append_equal.i[24585,24598] [2022-02-20 16:53:51,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:53:51,885 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:53:51,949 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/dll2c_append_equal.i[24585,24598] [2022-02-20 16:53:51,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:53:51,984 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:53:51,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:53:51 WrapperNode [2022-02-20 16:53:51,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:53:51,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:53:51,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:53:51,986 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:53:51,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:53:51" (1/1) ... [2022-02-20 16:53:52,013 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:53:51" (1/1) ... [2022-02-20 16:53:52,054 INFO L137 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 134 [2022-02-20 16:53:52,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:53:52,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:53:52,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:53:52,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:53:52,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:53:51" (1/1) ... [2022-02-20 16:53:52,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:53:51" (1/1) ... [2022-02-20 16:53:52,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:53:51" (1/1) ... [2022-02-20 16:53:52,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:53:51" (1/1) ... [2022-02-20 16:53:52,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:53:51" (1/1) ... [2022-02-20 16:53:52,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:53:51" (1/1) ... [2022-02-20 16:53:52,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:53:51" (1/1) ... [2022-02-20 16:53:52,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:53:52,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:53:52,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:53:52,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:53:52,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:53:51" (1/1) ... [2022-02-20 16:53:52,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:53:52,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:53:52,131 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 16:53:52,137 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 16:53:52,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:53:52,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:53:52,157 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 16:53:52,157 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 16:53:52,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:53:52,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:53:52,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:53:52,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:53:52,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:53:52,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:53:52,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 16:53:52,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:53:52,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:53:52,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:53:52,273 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:53:52,284 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:53:52,541 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:53:52,547 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:53:52,547 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 16:53:52,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:53:52 BoogieIcfgContainer [2022-02-20 16:53:52,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:53:52,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:53:52,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:53:52,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:53:52,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:53:51" (1/3) ... [2022-02-20 16:53:52,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474a952d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:53:52, skipping insertion in model container [2022-02-20 16:53:52,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:53:51" (2/3) ... [2022-02-20 16:53:52,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474a952d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:53:52, skipping insertion in model container [2022-02-20 16:53:52,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:53:52" (3/3) ... [2022-02-20 16:53:52,556 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2022-02-20 16:53:52,560 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:53:52,561 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:53:52,595 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:53:52,601 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 16:53:52,602 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:53:52,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 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 16:53:52,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:53:52,623 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:53:52,623 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:53:52,624 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:53:52,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:53:52,629 INFO L85 PathProgramCache]: Analyzing trace with hash 976010426, now seen corresponding path program 1 times [2022-02-20 16:53:52,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:53:52,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753801551] [2022-02-20 16:53:52,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:53:52,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:53:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:52,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:53:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:52,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(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; {38#true} is VALID [2022-02-20 16:53:52,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {38#true} is VALID [2022-02-20 16:53:52,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {38#true} is VALID [2022-02-20 16:53:52,914 INFO L290 TraceCheckUtils]: 3: Hoare triple {38#true} assume true; {38#true} is VALID [2022-02-20 16:53:52,914 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38#true} {38#true} #100#return; {38#true} is VALID [2022-02-20 16:53:52,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 16:53:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:52,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(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; {38#true} is VALID [2022-02-20 16:53:52,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {38#true} is VALID [2022-02-20 16:53:52,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {38#true} is VALID [2022-02-20 16:53:52,945 INFO L290 TraceCheckUtils]: 3: Hoare triple {38#true} assume true; {38#true} is VALID [2022-02-20 16:53:52,945 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38#true} {39#false} #104#return; {39#false} is VALID [2022-02-20 16:53:52,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#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(21, 2); {38#true} is VALID [2022-02-20 16:53:52,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~post20#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, 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_~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_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {38#true} is VALID [2022-02-20 16:53:52,947 INFO L272 TraceCheckUtils]: 2: Hoare triple {38#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {50#(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 16:53:52,947 INFO L290 TraceCheckUtils]: 3: Hoare triple {50#(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; {38#true} is VALID [2022-02-20 16:53:52,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {38#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {38#true} is VALID [2022-02-20 16:53:52,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {38#true} is VALID [2022-02-20 16:53:52,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {38#true} assume true; {38#true} is VALID [2022-02-20 16:53:52,948 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {38#true} {38#true} #100#return; {38#true} is VALID [2022-02-20 16:53:52,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {38#true} is VALID [2022-02-20 16:53:52,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#true} assume !true; {39#false} is VALID [2022-02-20 16:53:52,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#false} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {39#false} is VALID [2022-02-20 16:53:52,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} main_#t~ret15#1.base, main_#t~ret15#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;call write~init~$Pointer$(main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret15#1.base, main_#t~ret15#1.offset;assume { :begin_inline_dll_circular_append } true;dll_circular_append_#in~head#1.base, dll_circular_append_#in~head#1.offset, dll_circular_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1;havoc dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset, dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset, dll_circular_append_#t~mem11#1.base, dll_circular_append_#t~mem11#1.offset, dll_circular_append_#t~mem12#1.base, dll_circular_append_#t~mem12#1.offset, dll_circular_append_#t~mem13#1.base, dll_circular_append_#t~mem13#1.offset, dll_circular_append_#t~mem14#1.base, dll_circular_append_#t~mem14#1.offset, dll_circular_append_~last~1#1.base, dll_circular_append_~last~1#1.offset, dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, dll_circular_append_~data#1, dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset;dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset := dll_circular_append_#in~head#1.base, dll_circular_append_#in~head#1.offset;dll_circular_append_~data#1 := dll_circular_append_#in~data#1; {39#false} is VALID [2022-02-20 16:53:52,950 INFO L272 TraceCheckUtils]: 12: Hoare triple {39#false} call dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset := node_create(dll_circular_append_~data#1); {50#(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 16:53:52,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {50#(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; {38#true} is VALID [2022-02-20 16:53:52,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {38#true} is VALID [2022-02-20 16:53:52,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {38#true} is VALID [2022-02-20 16:53:52,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {38#true} assume true; {38#true} is VALID [2022-02-20 16:53:52,951 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38#true} {39#false} #104#return; {39#false} is VALID [2022-02-20 16:53:52,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {39#false} dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset := dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset;havoc dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset;call dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset := read~$Pointer$(dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4); {39#false} is VALID [2022-02-20 16:53:52,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {39#false} assume 0 == dll_circular_append_#t~mem10#1.base && 0 == dll_circular_append_#t~mem10#1.offset;havoc dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset;call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~new_last~0#1.base, 4 + dll_circular_append_~new_last~0#1.offset, 4);call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, 4);call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4); {39#false} is VALID [2022-02-20 16:53:52,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {39#false} assume { :end_inline_dll_circular_append } true;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;main_~count~0#1 := 0; {39#false} is VALID [2022-02-20 16:53:52,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-02-20 16:53:52,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {39#false} assume main_~count~0#1 != 1 + main_~len~0#1; {39#false} is VALID [2022-02-20 16:53:52,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-02-20 16:53:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 16:53:52,954 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:53:52,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753801551] [2022-02-20 16:53:52,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753801551] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:53:52,955 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:53:52,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:53:52,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111278656] [2022-02-20 16:53:52,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:53:52,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 24 [2022-02-20 16:53:52,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:53:52,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 16:53:52,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:53:52,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:53:53,000 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:53:53,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:53:53,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:53:53,023 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 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 has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 16:53:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:53:53,186 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2022-02-20 16:53:53,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:53:53,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 24 [2022-02-20 16:53:53,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:53:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 16:53:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-02-20 16:53:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 16:53:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-02-20 16:53:53,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2022-02-20 16:53:53,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:53:53,313 INFO L225 Difference]: With dead ends: 61 [2022-02-20 16:53:53,314 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 16:53:53,317 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 16:53:53,320 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:53:53,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:53:53,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 16:53:53,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 16:53:53,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:53:53,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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 16:53:53,355 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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 16:53:53,357 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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 16:53:53,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:53:53,363 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-02-20 16:53:53,368 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-02-20 16:53:53,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:53:53,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:53:53,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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 27 states. [2022-02-20 16:53:53,370 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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 27 states. [2022-02-20 16:53:53,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:53:53,379 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-02-20 16:53:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-02-20 16:53:53,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:53:53,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:53:53,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:53:53,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:53:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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 16:53:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-02-20 16:53:53,385 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 24 [2022-02-20 16:53:53,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:53:53,386 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-02-20 16:53:53,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 16:53:53,387 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-02-20 16:53:53,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:53:53,388 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:53:53,388 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:53:53,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:53:53,389 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:53:53,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:53:53,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1442307826, now seen corresponding path program 1 times [2022-02-20 16:53:53,390 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:53:53,390 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036782140] [2022-02-20 16:53:53,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:53:53,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:53:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:53,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:53:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:53,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {235#(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; {222#true} is VALID [2022-02-20 16:53:53,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {222#true} is VALID [2022-02-20 16:53:53,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {222#true} is VALID [2022-02-20 16:53:53,555 INFO L290 TraceCheckUtils]: 3: Hoare triple {222#true} assume true; {222#true} is VALID [2022-02-20 16:53:53,556 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {222#true} {224#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} #100#return; {224#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:53:53,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 16:53:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:53,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {235#(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; {222#true} is VALID [2022-02-20 16:53:53,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {222#true} is VALID [2022-02-20 16:53:53,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {222#true} is VALID [2022-02-20 16:53:53,574 INFO L290 TraceCheckUtils]: 3: Hoare triple {222#true} assume true; {222#true} is VALID [2022-02-20 16:53:53,575 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {222#true} {223#false} #104#return; {223#false} is VALID [2022-02-20 16:53:53,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {222#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(21, 2); {222#true} is VALID [2022-02-20 16:53:53,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~post20#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, 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_~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_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {224#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:53:53,577 INFO L272 TraceCheckUtils]: 2: Hoare triple {224#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {235#(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 16:53:53,577 INFO L290 TraceCheckUtils]: 3: Hoare triple {235#(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; {222#true} is VALID [2022-02-20 16:53:53,577 INFO L290 TraceCheckUtils]: 4: Hoare triple {222#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {222#true} is VALID [2022-02-20 16:53:53,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {222#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {222#true} is VALID [2022-02-20 16:53:53,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {222#true} assume true; {222#true} is VALID [2022-02-20 16:53:53,579 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {222#true} {224#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} #100#return; {224#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:53:53,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {224#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:53:53,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} assume !(dll_circular_create_~len#1 > 1); {223#false} is VALID [2022-02-20 16:53:53,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {223#false} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {223#false} is VALID [2022-02-20 16:53:53,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {223#false} main_#t~ret15#1.base, main_#t~ret15#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;call write~init~$Pointer$(main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret15#1.base, main_#t~ret15#1.offset;assume { :begin_inline_dll_circular_append } true;dll_circular_append_#in~head#1.base, dll_circular_append_#in~head#1.offset, dll_circular_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1;havoc dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset, dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset, dll_circular_append_#t~mem11#1.base, dll_circular_append_#t~mem11#1.offset, dll_circular_append_#t~mem12#1.base, dll_circular_append_#t~mem12#1.offset, dll_circular_append_#t~mem13#1.base, dll_circular_append_#t~mem13#1.offset, dll_circular_append_#t~mem14#1.base, dll_circular_append_#t~mem14#1.offset, dll_circular_append_~last~1#1.base, dll_circular_append_~last~1#1.offset, dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, dll_circular_append_~data#1, dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset;dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset := dll_circular_append_#in~head#1.base, dll_circular_append_#in~head#1.offset;dll_circular_append_~data#1 := dll_circular_append_#in~data#1; {223#false} is VALID [2022-02-20 16:53:53,588 INFO L272 TraceCheckUtils]: 12: Hoare triple {223#false} call dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset := node_create(dll_circular_append_~data#1); {235#(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 16:53:53,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {235#(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; {222#true} is VALID [2022-02-20 16:53:53,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {222#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {222#true} is VALID [2022-02-20 16:53:53,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {222#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {222#true} is VALID [2022-02-20 16:53:53,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {222#true} assume true; {222#true} is VALID [2022-02-20 16:53:53,589 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {222#true} {223#false} #104#return; {223#false} is VALID [2022-02-20 16:53:53,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {223#false} dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset := dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset;havoc dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset;call dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset := read~$Pointer$(dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4); {223#false} is VALID [2022-02-20 16:53:53,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {223#false} assume 0 == dll_circular_append_#t~mem10#1.base && 0 == dll_circular_append_#t~mem10#1.offset;havoc dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset;call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~new_last~0#1.base, 4 + dll_circular_append_~new_last~0#1.offset, 4);call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, 4);call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4); {223#false} is VALID [2022-02-20 16:53:53,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {223#false} assume { :end_inline_dll_circular_append } true;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;main_~count~0#1 := 0; {223#false} is VALID [2022-02-20 16:53:53,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {223#false} call main_#t~mem18#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {223#false} is VALID [2022-02-20 16:53:53,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {223#false} assume main_~data~0#1 != main_#t~mem18#1;havoc main_#t~mem18#1; {223#false} is VALID [2022-02-20 16:53:53,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {223#false} assume !false; {223#false} is VALID [2022-02-20 16:53:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 16:53:53,591 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:53:53,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036782140] [2022-02-20 16:53:53,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036782140] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:53:53,591 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:53:53,591 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:53:53,592 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045513314] [2022-02-20 16:53:53,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:53:53,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 24 [2022-02-20 16:53:53,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:53:53,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16:53:53,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:53:53,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:53:53,617 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:53:53,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:53:53,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:53:53,618 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16:53:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:53:53,775 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2022-02-20 16:53:53,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:53:53,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 24 [2022-02-20 16:53:53,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:53:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16:53:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-02-20 16:53:53,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16:53:53,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-02-20 16:53:53,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2022-02-20 16:53:53,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:53:53,847 INFO L225 Difference]: With dead ends: 50 [2022-02-20 16:53:53,847 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:53:53,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 16:53:53,849 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 71 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 16:53:53,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 71 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:53:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:53:53,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-02-20 16:53:53,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:53:53,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 16:53:53,854 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 16:53:53,855 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 16:53:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:53:53,857 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-02-20 16:53:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-02-20 16:53:53,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:53:53,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:53:53,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 32 states. [2022-02-20 16:53:53,859 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 32 states. [2022-02-20 16:53:53,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:53:53,861 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-02-20 16:53:53,861 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-02-20 16:53:53,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:53:53,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:53:53,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:53:53,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:53:53,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 16:53:53,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-02-20 16:53:53,864 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2022-02-20 16:53:53,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:53:53,865 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-02-20 16:53:53,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16:53:53,865 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 16:53:53,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 16:53:53,866 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:53:53,866 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:53:53,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:53:53,867 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:53:53,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:53:53,867 INFO L85 PathProgramCache]: Analyzing trace with hash 915772386, now seen corresponding path program 1 times [2022-02-20 16:53:53,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:53:53,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493028897] [2022-02-20 16:53:53,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:53:53,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:53:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:54,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:53:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:54,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {429#(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; {404#true} is VALID [2022-02-20 16:53:54,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {404#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {404#true} is VALID [2022-02-20 16:53:54,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {404#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {404#true} is VALID [2022-02-20 16:53:54,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {404#true} assume true; {404#true} is VALID [2022-02-20 16:53:54,126 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {404#true} {406#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #100#return; {406#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:53:54,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:53:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:54,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {429#(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; {430#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:53:54,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#(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); {430#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:53:54,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {430#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {431#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:53:54,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {431#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} assume true; {431#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:53:54,184 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {431#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} {406#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #102#return; {417#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 0)))} is VALID [2022-02-20 16:53:54,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 16:53:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:54,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {429#(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; {432#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:53:54,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {432#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:53:54,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {432#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {433#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:53:54,259 INFO L290 TraceCheckUtils]: 3: Hoare triple {433#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} assume true; {433#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:53:54,261 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {433#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} {421#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #104#return; {427#(and (= |ULTIMATE.start_dll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))} is VALID [2022-02-20 16:53:54,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {404#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(21, 2); {404#true} is VALID [2022-02-20 16:53:54,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {404#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~post20#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, 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_~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_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {406#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:53:54,264 INFO L272 TraceCheckUtils]: 2: Hoare triple {406#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {429#(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 16:53:54,264 INFO L290 TraceCheckUtils]: 3: Hoare triple {429#(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; {404#true} is VALID [2022-02-20 16:53:54,264 INFO L290 TraceCheckUtils]: 4: Hoare triple {404#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {404#true} is VALID [2022-02-20 16:53:54,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {404#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {404#true} is VALID [2022-02-20 16:53:54,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {404#true} assume true; {404#true} is VALID [2022-02-20 16:53:54,266 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {404#true} {406#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #100#return; {406#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:53:54,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {406#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {406#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:53:54,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {406#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !!(dll_circular_create_~len#1 > 1); {406#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:53:54,268 INFO L272 TraceCheckUtils]: 10: Hoare triple {406#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {429#(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 16:53:54,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {429#(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; {430#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:53:54,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {430#(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); {430#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:53:54,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {430#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {431#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:53:54,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {431#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} assume true; {431#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:53:54,272 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {431#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} {406#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #102#return; {417#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 0)))} is VALID [2022-02-20 16:53:54,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {417#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 0)))} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4); {418#(and (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:53:54,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {418#(and (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4); {418#(and (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:53:54,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {418#(and (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := dll_circular_create_#t~post6#1 - 1;havoc dll_circular_create_#t~post6#1; {419#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)))} is VALID [2022-02-20 16:53:54,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {419#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)))} assume !(dll_circular_create_~len#1 > 1); {419#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)))} is VALID [2022-02-20 16:53:54,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {419#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)))} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {420#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#res#1.base| 0)))} is VALID [2022-02-20 16:53:54,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {420#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#res#1.base| 0)))} main_#t~ret15#1.base, main_#t~ret15#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;call write~init~$Pointer$(main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret15#1.base, main_#t~ret15#1.offset;assume { :begin_inline_dll_circular_append } true;dll_circular_append_#in~head#1.base, dll_circular_append_#in~head#1.offset, dll_circular_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1;havoc dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset, dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset, dll_circular_append_#t~mem11#1.base, dll_circular_append_#t~mem11#1.offset, dll_circular_append_#t~mem12#1.base, dll_circular_append_#t~mem12#1.offset, dll_circular_append_#t~mem13#1.base, dll_circular_append_#t~mem13#1.offset, dll_circular_append_#t~mem14#1.base, dll_circular_append_#t~mem14#1.offset, dll_circular_append_~last~1#1.base, dll_circular_append_~last~1#1.offset, dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, dll_circular_append_~data#1, dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset;dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset := dll_circular_append_#in~head#1.base, dll_circular_append_#in~head#1.offset;dll_circular_append_~data#1 := dll_circular_append_#in~data#1; {421#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:53:54,278 INFO L272 TraceCheckUtils]: 22: Hoare triple {421#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} call dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset := node_create(dll_circular_append_~data#1); {429#(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 16:53:54,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {429#(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; {432#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:53:54,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {432#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {432#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:53:54,281 INFO L290 TraceCheckUtils]: 25: Hoare triple {432#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {433#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:53:54,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {433#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} assume true; {433#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:53:54,284 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {433#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} {421#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #104#return; {427#(and (= |ULTIMATE.start_dll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))} is VALID [2022-02-20 16:53:54,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {427#(and (= |ULTIMATE.start_dll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|) 0)))} dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset := dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset;havoc dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset;call dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset := read~$Pointer$(dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4); {428#(and (= |ULTIMATE.start_dll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_append_#t~mem10#1.base| 0)))} is VALID [2022-02-20 16:53:54,285 INFO L290 TraceCheckUtils]: 29: Hoare triple {428#(and (= |ULTIMATE.start_dll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_append_#t~mem10#1.base| 0)))} assume 0 == dll_circular_append_#t~mem10#1.base && 0 == dll_circular_append_#t~mem10#1.offset;havoc dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset;call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~new_last~0#1.base, 4 + dll_circular_append_~new_last~0#1.offset, 4);call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, 4);call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4); {405#false} is VALID [2022-02-20 16:53:54,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {405#false} assume { :end_inline_dll_circular_append } true;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;main_~count~0#1 := 0; {405#false} is VALID [2022-02-20 16:53:54,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {405#false} call main_#t~mem18#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {405#false} is VALID [2022-02-20 16:53:54,286 INFO L290 TraceCheckUtils]: 32: Hoare triple {405#false} assume main_~data~0#1 != main_#t~mem18#1;havoc main_#t~mem18#1; {405#false} is VALID [2022-02-20 16:53:54,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {405#false} assume !false; {405#false} is VALID [2022-02-20 16:53:54,287 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:53:54,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:53:54,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493028897] [2022-02-20 16:53:54,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493028897] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:53:54,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055254727] [2022-02-20 16:53:54,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:53:54,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:53:54,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:53:54,296 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 16:53:54,312 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 16:53:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:54,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 38 conjunts are in the unsatisfiable core [2022-02-20 16:53:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:54,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:53:55,030 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 17 treesize of output 9 [2022-02-20 16:53:55,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:53:55,193 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 24 treesize of output 24 [2022-02-20 16:53:55,268 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 16:53:55,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {404#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(21, 2); {404#true} is VALID [2022-02-20 16:53:55,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {404#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~post20#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, 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_~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_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {440#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:53:55,302 INFO L272 TraceCheckUtils]: 2: Hoare triple {440#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {404#true} is VALID [2022-02-20 16:53:55,303 INFO L290 TraceCheckUtils]: 3: Hoare triple {404#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; {404#true} is VALID [2022-02-20 16:53:55,303 INFO L290 TraceCheckUtils]: 4: Hoare triple {404#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {404#true} is VALID [2022-02-20 16:53:55,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {404#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {404#true} is VALID [2022-02-20 16:53:55,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {404#true} assume true; {404#true} is VALID [2022-02-20 16:53:55,306 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {404#true} {440#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} #100#return; {440#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:53:55,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {440#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {440#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:53:55,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {440#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(dll_circular_create_~len#1 > 1); {440#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:53:55,307 INFO L272 TraceCheckUtils]: 10: Hoare triple {440#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {404#true} is VALID [2022-02-20 16:53:55,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {404#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; {430#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:53:55,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {430#(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); {430#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:53:55,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {430#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {431#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:53:55,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {431#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} assume true; {431#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:53:55,311 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {431#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} {440#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} #102#return; {483#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (<= (+ |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1) 0) (<= 1 |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:53:55,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {483#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (<= (+ |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1) 0) (<= 1 |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4); {487#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (or (<= (+ |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) 0) (<= 1 |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))} is VALID [2022-02-20 16:53:55,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {487#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (or (<= (+ |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) 0) (<= 1 |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4); {487#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (or (<= (+ |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) 0) (<= 1 |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))} is VALID [2022-02-20 16:53:55,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {487#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (or (<= (+ |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) 0) (<= 1 |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := dll_circular_create_#t~post6#1 - 1;havoc dll_circular_create_#t~post6#1; {494#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) 0) (<= 1 |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:53:55,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {494#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) 0) (<= 1 |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(dll_circular_create_~len#1 > 1); {494#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) 0) (<= 1 |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:53:55,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {494#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) 0) (<= 1 |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {501#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (<= (+ |ULTIMATE.start_dll_circular_create_#res#1.base| 1) 0) (<= 1 |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:53:55,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {501#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (or (<= (+ |ULTIMATE.start_dll_circular_create_#res#1.base| 1) 0) (<= 1 |ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} main_#t~ret15#1.base, main_#t~ret15#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;call write~init~$Pointer$(main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret15#1.base, main_#t~ret15#1.offset;assume { :begin_inline_dll_circular_append } true;dll_circular_append_#in~head#1.base, dll_circular_append_#in~head#1.offset, dll_circular_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1;havoc dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset, dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset, dll_circular_append_#t~mem11#1.base, dll_circular_append_#t~mem11#1.offset, dll_circular_append_#t~mem12#1.base, dll_circular_append_#t~mem12#1.offset, dll_circular_append_#t~mem13#1.base, dll_circular_append_#t~mem13#1.offset, dll_circular_append_#t~mem14#1.base, dll_circular_append_#t~mem14#1.offset, dll_circular_append_~last~1#1.base, dll_circular_append_~last~1#1.offset, dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, dll_circular_append_~data#1, dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset;dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset := dll_circular_append_#in~head#1.base, dll_circular_append_#in~head#1.offset;dll_circular_append_~data#1 := dll_circular_append_#in~data#1; {505#(and (or (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0))) (< |#StackHeapBarrier| |ULTIMATE.start_dll_circular_append_~head#1.base|) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| 0))} is VALID [2022-02-20 16:53:55,317 INFO L272 TraceCheckUtils]: 22: Hoare triple {505#(and (or (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0))) (< |#StackHeapBarrier| |ULTIMATE.start_dll_circular_append_~head#1.base|) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| 0))} call dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset := node_create(dll_circular_append_~data#1); {509#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)} is VALID [2022-02-20 16:53:55,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {509#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)} ~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; {432#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:53:55,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {432#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {432#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:53:55,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {432#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {519#(and (exists ((v_ArrVal_457 (Array Int Int))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_457) |#memory_$Pointer$.base|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 16:53:55,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {519#(and (exists ((v_ArrVal_457 (Array Int Int))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_457) |#memory_$Pointer$.base|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|))} assume true; {519#(and (exists ((v_ArrVal_457 (Array Int Int))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_457) |#memory_$Pointer$.base|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 16:53:55,322 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {519#(and (exists ((v_ArrVal_457 (Array Int Int))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_457) |#memory_$Pointer$.base|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|))} {505#(and (or (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0))) (< |#StackHeapBarrier| |ULTIMATE.start_dll_circular_append_~head#1.base|) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| 0))} #104#return; {526#(and (or (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0))) (< (+ |ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 1) |ULTIMATE.start_dll_circular_append_~head#1.base|) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| 0))} is VALID [2022-02-20 16:53:55,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {526#(and (or (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0)) 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) 0))) (< (+ |ULTIMATE.start_dll_circular_append_#t~ret9#1.base| 1) |ULTIMATE.start_dll_circular_append_~head#1.base|) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| 0))} dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset := dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset;havoc dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset;call dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset := read~$Pointer$(dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4); {530#(or (<= 1 |ULTIMATE.start_dll_circular_append_#t~mem10#1.base|) (<= (+ |ULTIMATE.start_dll_circular_append_#t~mem10#1.base| 1) 0))} is VALID [2022-02-20 16:53:55,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {530#(or (<= 1 |ULTIMATE.start_dll_circular_append_#t~mem10#1.base|) (<= (+ |ULTIMATE.start_dll_circular_append_#t~mem10#1.base| 1) 0))} assume 0 == dll_circular_append_#t~mem10#1.base && 0 == dll_circular_append_#t~mem10#1.offset;havoc dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset;call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~new_last~0#1.base, 4 + dll_circular_append_~new_last~0#1.offset, 4);call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, 4);call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4); {405#false} is VALID [2022-02-20 16:53:55,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {405#false} assume { :end_inline_dll_circular_append } true;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;main_~count~0#1 := 0; {405#false} is VALID [2022-02-20 16:53:55,324 INFO L290 TraceCheckUtils]: 31: Hoare triple {405#false} call main_#t~mem18#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {405#false} is VALID [2022-02-20 16:53:55,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {405#false} assume main_~data~0#1 != main_#t~mem18#1;havoc main_#t~mem18#1; {405#false} is VALID [2022-02-20 16:53:55,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {405#false} assume !false; {405#false} is VALID [2022-02-20 16:53:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:53:55,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:53:55,545 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_9| Int) (v_ArrVal_460 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_9| v_ArrVal_460) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_9| |c_#StackHeapBarrier|)) (<= 1 .cse0) (<= (+ .cse0 1) 0)))) is different from false [2022-02-20 16:53:55,548 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055254727] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:53:55,549 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:53:55,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-02-20 16:53:55,549 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573148482] [2022-02-20 16:53:55,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:53:55,550 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2022-02-20 16:53:55,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:53:55,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 16:53:55,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:53:55,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 16:53:55,618 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:53:55,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 16:53:55,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=572, Unknown=1, NotChecked=48, Total=702 [2022-02-20 16:53:55,620 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 16:53:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:53:56,638 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-02-20 16:53:56,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 16:53:56,638 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2022-02-20 16:53:56,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:53:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 16:53:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-02-20 16:53:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 16:53:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-02-20 16:53:56,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 45 transitions. [2022-02-20 16:53:56,721 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 16:53:56,722 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:53:56,723 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 16:53:56,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=920, Unknown=1, NotChecked=62, Total=1122 [2022-02-20 16:53:56,724 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 29 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 16:53:56,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 185 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 149 Invalid, 0 Unknown, 10 Unchecked, 0.3s Time] [2022-02-20 16:53:56,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 16:53:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-02-20 16:53:56,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:53:56,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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 16:53:56,744 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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 16:53:56,744 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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 16:53:56,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:53:56,746 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-02-20 16:53:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-20 16:53:56,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:53:56,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:53:56,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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 29 states. [2022-02-20 16:53:56,747 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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 29 states. [2022-02-20 16:53:56,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:53:56,749 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-02-20 16:53:56,749 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-20 16:53:56,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:53:56,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:53:56,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:53:56,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:53:56,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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 16:53:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-02-20 16:53:56,758 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 34 [2022-02-20 16:53:56,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:53:56,759 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-02-20 16:53:56,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 19 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 16:53:56,760 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-20 16:53:56,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 16:53:56,760 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:53:56,761 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:53:56,786 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 16:53:56,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:53:56,962 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:53:56,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:53:56,962 INFO L85 PathProgramCache]: Analyzing trace with hash 917619428, now seen corresponding path program 1 times [2022-02-20 16:53:56,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:53:56,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129947801] [2022-02-20 16:53:56,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:53:56,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:53:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:58,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:53:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:58,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#(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; {758#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:53:58,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {758#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {758#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:53:58,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {758#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {759#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:53:58,157 INFO L290 TraceCheckUtils]: 3: Hoare triple {759#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {759#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:53:58,158 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {759#(= (select |#valid| |node_create_#res#1.base|) 1)} {728#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #100#return; {734#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1))} is VALID [2022-02-20 16:53:58,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:53:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:58,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#(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; {760#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:53:58,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {760#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:53:58,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {761#(and (<= 0 |node_create_#res#1.offset|) (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:53:58,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {761#(and (<= 0 |node_create_#res#1.offset|) (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {761#(and (<= 0 |node_create_#res#1.offset|) (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:53:58,290 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {761#(and (<= 0 |node_create_#res#1.offset|) (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} {735#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} #102#return; {741#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} is VALID [2022-02-20 16:53:58,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 16:53:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:58,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#(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; {762#(and (= |node_create_~data#1| |node_create_#in~data#1|) (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |node_create_~temp~0#1.offset| (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:53:58,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {762#(and (= |node_create_~data#1| |node_create_#in~data#1|) (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |node_create_~temp~0#1.offset| (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {762#(and (= |node_create_~data#1| |node_create_#in~data#1|) (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |node_create_~temp~0#1.offset| (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:53:58,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {762#(and (= |node_create_~data#1| |node_create_#in~data#1|) (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |node_create_~temp~0#1.offset| (select |old(#valid)| |node_create_~temp~0#1.base|)))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {763#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (or (= |node_create_#res#1.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |node_create_#res#1.base|)) (not (= (select |old(#valid)| |node_create_#res#1.base|) 1)) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (= 0 |node_create_#res#1.offset|) (or (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) 1) |#StackHeapBarrier|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:53:58,624 INFO L290 TraceCheckUtils]: 3: Hoare triple {763#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (or (= |node_create_#res#1.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |node_create_#res#1.base|)) (not (= (select |old(#valid)| |node_create_#res#1.base|) 1)) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (= 0 |node_create_#res#1.offset|) (or (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) 1) |#StackHeapBarrier|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} assume true; {763#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (or (= |node_create_#res#1.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |node_create_#res#1.base|)) (not (= (select |old(#valid)| |node_create_#res#1.base|) 1)) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (= 0 |node_create_#res#1.offset|) (or (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) 1) |#StackHeapBarrier|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:53:58,628 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {763#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (or (= |node_create_#res#1.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |node_create_#res#1.base|)) (not (= (select |old(#valid)| |node_create_#res#1.base|) 1)) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (= 0 |node_create_#res#1.offset|) (or (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) 1) |#StackHeapBarrier|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} {746#(and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 1) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_dll_circular_append_~data#1| |ULTIMATE.start_main_~data~0#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))))} #104#return; {752#(and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |ULTIMATE.start_dll_circular_append_~head#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|))) (not (= |ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|))))) (= |ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8)))} is VALID [2022-02-20 16:53:58,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {726#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(21, 2); {726#true} is VALID [2022-02-20 16:53:58,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {726#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~post20#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, 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_~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_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {728#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:53:58,631 INFO L272 TraceCheckUtils]: 2: Hoare triple {728#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {757#(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 16:53:58,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {757#(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; {758#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:53:58,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {758#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {758#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:53:58,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {758#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {759#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:53:58,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {759#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {759#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:53:58,634 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {759#(= (select |#valid| |node_create_#res#1.base|) 1)} {728#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #100#return; {734#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1))} is VALID [2022-02-20 16:53:58,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {734#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {735#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 16:53:58,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {735#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} assume !!(dll_circular_create_~len#1 > 1); {735#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 16:53:58,637 INFO L272 TraceCheckUtils]: 10: Hoare triple {735#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {757#(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 16:53:58,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {757#(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; {760#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:53:58,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {760#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {760#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:53:58,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {760#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {761#(and (<= 0 |node_create_#res#1.offset|) (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:53:58,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {761#(and (<= 0 |node_create_#res#1.offset|) (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {761#(and (<= 0 |node_create_#res#1.offset|) (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:53:58,643 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {761#(and (<= 0 |node_create_#res#1.offset|) (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} {735#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} #102#return; {741#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} is VALID [2022-02-20 16:53:58,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {741#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4); {742#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|))} is VALID [2022-02-20 16:53:58,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {742#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|))} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4); {743#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|))} is VALID [2022-02-20 16:53:58,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {743#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := dll_circular_create_#t~post6#1 - 1;havoc dll_circular_create_#t~post6#1; {744#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 16:53:58,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {744#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} assume !(dll_circular_create_~len#1 > 1); {744#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 16:53:58,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {744#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {745#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (not (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0))} is VALID [2022-02-20 16:53:58,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {745#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4))) (not (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0))} main_#t~ret15#1.base, main_#t~ret15#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;call write~init~$Pointer$(main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret15#1.base, main_#t~ret15#1.offset;assume { :begin_inline_dll_circular_append } true;dll_circular_append_#in~head#1.base, dll_circular_append_#in~head#1.offset, dll_circular_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1;havoc dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset, dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset, dll_circular_append_#t~mem11#1.base, dll_circular_append_#t~mem11#1.offset, dll_circular_append_#t~mem12#1.base, dll_circular_append_#t~mem12#1.offset, dll_circular_append_#t~mem13#1.base, dll_circular_append_#t~mem13#1.offset, dll_circular_append_#t~mem14#1.base, dll_circular_append_#t~mem14#1.offset, dll_circular_append_~last~1#1.base, dll_circular_append_~last~1#1.offset, dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, dll_circular_append_~data#1, dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset;dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset := dll_circular_append_#in~head#1.base, dll_circular_append_#in~head#1.offset;dll_circular_append_~data#1 := dll_circular_append_#in~data#1; {746#(and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 1) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_dll_circular_append_~data#1| |ULTIMATE.start_main_~data~0#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))))} is VALID [2022-02-20 16:53:58,652 INFO L272 TraceCheckUtils]: 22: Hoare triple {746#(and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 1) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_dll_circular_append_~data#1| |ULTIMATE.start_main_~data~0#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))))} call dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset := node_create(dll_circular_append_~data#1); {757#(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 16:53:58,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {757#(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; {762#(and (= |node_create_~data#1| |node_create_#in~data#1|) (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |node_create_~temp~0#1.offset| (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:53:58,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {762#(and (= |node_create_~data#1| |node_create_#in~data#1|) (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |node_create_~temp~0#1.offset| (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {762#(and (= |node_create_~data#1| |node_create_#in~data#1|) (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |node_create_~temp~0#1.offset| (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:53:58,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {762#(and (= |node_create_~data#1| |node_create_#in~data#1|) (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |node_create_~temp~0#1.offset| (select |old(#valid)| |node_create_~temp~0#1.base|)))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 8 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {763#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (or (= |node_create_#res#1.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |node_create_#res#1.base|)) (not (= (select |old(#valid)| |node_create_#res#1.base|) 1)) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (= 0 |node_create_#res#1.offset|) (or (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) 1) |#StackHeapBarrier|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:53:58,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {763#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (or (= |node_create_#res#1.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |node_create_#res#1.base|)) (not (= (select |old(#valid)| |node_create_#res#1.base|) 1)) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (= 0 |node_create_#res#1.offset|) (or (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) 1) |#StackHeapBarrier|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} assume true; {763#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (or (= |node_create_#res#1.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |node_create_#res#1.base|)) (not (= (select |old(#valid)| |node_create_#res#1.base|) 1)) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (= 0 |node_create_#res#1.offset|) (or (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) 1) |#StackHeapBarrier|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:53:58,661 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {763#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (or (= |node_create_#res#1.base| (@diff |old(#memory_int)| |#memory_int|)) (= |#memory_int| |old(#memory_int)|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |node_create_#res#1.base|)) (not (= (select |old(#valid)| |node_create_#res#1.base|) 1)) (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (= 0 |node_create_#res#1.offset|) (or (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= (+ (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) 1) |#StackHeapBarrier|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} {746#(and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 1) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_dll_circular_append_~data#1| |ULTIMATE.start_main_~data~0#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))))} #104#return; {752#(and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |ULTIMATE.start_dll_circular_append_~head#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|))) (not (= |ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|))))) (= |ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8)))} is VALID [2022-02-20 16:53:58,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {752#(and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |ULTIMATE.start_dll_circular_append_~head#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|))) (not (= |ULTIMATE.start_dll_circular_append_#t~ret9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|))))) (= |ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8)))} dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset := dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset;havoc dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset;call dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset := read~$Pointer$(dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4); {753#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8)) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|))))) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8)))} is VALID [2022-02-20 16:53:58,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {753#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) (= |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) 8)) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|))))) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8)))} assume !(0 == dll_circular_append_#t~mem10#1.base && 0 == dll_circular_append_#t~mem10#1.offset);havoc dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset;call dll_circular_append_#t~mem11#1.base, dll_circular_append_#t~mem11#1.offset := read~$Pointer$(dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4);call dll_circular_append_#t~mem12#1.base, dll_circular_append_#t~mem12#1.offset := read~$Pointer$(dll_circular_append_#t~mem11#1.base, 4 + dll_circular_append_#t~mem11#1.offset, 4);dll_circular_append_~last~1#1.base, dll_circular_append_~last~1#1.offset := dll_circular_append_#t~mem12#1.base, dll_circular_append_#t~mem12#1.offset;havoc dll_circular_append_#t~mem11#1.base, dll_circular_append_#t~mem11#1.offset;havoc dll_circular_append_#t~mem12#1.base, dll_circular_append_#t~mem12#1.offset;call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~last~1#1.base, dll_circular_append_~last~1#1.offset, 4);call write~$Pointer$(dll_circular_append_~last~1#1.base, dll_circular_append_~last~1#1.offset, dll_circular_append_~new_last~0#1.base, 4 + dll_circular_append_~new_last~0#1.offset, 4);call dll_circular_append_#t~mem13#1.base, dll_circular_append_#t~mem13#1.offset := read~$Pointer$(dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4);call write~$Pointer$(dll_circular_append_#t~mem13#1.base, dll_circular_append_#t~mem13#1.offset, dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, 4);havoc dll_circular_append_#t~mem13#1.base, dll_circular_append_#t~mem13#1.offset;call dll_circular_append_#t~mem14#1.base, dll_circular_append_#t~mem14#1.offset := read~$Pointer$(dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4);call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_#t~mem14#1.base, 4 + dll_circular_append_#t~mem14#1.offset, 4);havoc dll_circular_append_#t~mem14#1.base, dll_circular_append_#t~mem14#1.offset; {754#(= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 8)))} is VALID [2022-02-20 16:53:58,666 INFO L290 TraceCheckUtils]: 30: Hoare triple {754#(= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 8)))} assume { :end_inline_dll_circular_append } true;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;main_~count~0#1 := 0; {755#(= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8)) |ULTIMATE.start_main_~data~0#1|)} is VALID [2022-02-20 16:53:58,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {755#(= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8)) |ULTIMATE.start_main_~data~0#1|)} call main_#t~mem18#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {756#(= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_main_#t~mem18#1|)} is VALID [2022-02-20 16:53:58,667 INFO L290 TraceCheckUtils]: 32: Hoare triple {756#(= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_main_#t~mem18#1|)} assume main_~data~0#1 != main_#t~mem18#1;havoc main_#t~mem18#1; {727#false} is VALID [2022-02-20 16:53:58,667 INFO L290 TraceCheckUtils]: 33: Hoare triple {727#false} assume !false; {727#false} is VALID [2022-02-20 16:53:58,668 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:53:58,668 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:53:58,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129947801] [2022-02-20 16:53:58,668 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129947801] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:53:58,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171603259] [2022-02-20 16:53:58,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:53:58,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:53:58,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:53:58,675 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 16:53:58,676 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 16:53:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:59,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 245 conjunts are in the unsatisfiable core [2022-02-20 16:53:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:59,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:53:59,930 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 16:54:00,016 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 16:54:00,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:00,201 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 16:54:00,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:00,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:54:00,604 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 13 treesize of output 9 [2022-02-20 16:54:00,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:00,738 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-02-20 16:54:00,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-02-20 16:54:00,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:00,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 16:54:01,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 16:54:01,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:01,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-02-20 16:54:01,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:01,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2022-02-20 16:54:01,480 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 14 treesize of output 18 [2022-02-20 16:54:01,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 16:54:01,845 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:54:01,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 32 [2022-02-20 16:54:01,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:01,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-02-20 16:54:02,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-02-20 16:54:02,055 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 16:54:02,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:02,409 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-02-20 16:54:02,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 65 [2022-02-20 16:54:02,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:02,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 16:54:02,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:02,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:02,448 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-02-20 16:54:02,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-02-20 16:54:02,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:02,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 16:54:03,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:03,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:03,087 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 16:54:03,120 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 16:54:03,316 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,SelfDestructingSolverStorable3 [2022-02-20 16:54:03,316 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_47| at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:166) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:126) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:90) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:904) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) 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 16:54:03,320 INFO L158 Benchmark]: Toolchain (without parser) took 11736.47ms. Allocated memory was 104.9MB in the beginning and 182.5MB in the end (delta: 77.6MB). Free memory was 73.8MB in the beginning and 100.4MB in the end (delta: -26.7MB). Peak memory consumption was 102.7MB. Max. memory is 16.1GB. [2022-02-20 16:54:03,320 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 104.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:54:03,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.28ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 73.5MB in the beginning and 89.5MB in the end (delta: -16.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 16:54:03,321 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.24ms. Allocated memory is still 125.8MB. Free memory was 89.5MB in the beginning and 87.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:54:03,321 INFO L158 Benchmark]: Boogie Preprocessor took 44.36ms. Allocated memory is still 125.8MB. Free memory was 87.0MB in the beginning and 84.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:54:03,321 INFO L158 Benchmark]: RCFGBuilder took 448.71ms. Allocated memory is still 125.8MB. Free memory was 84.4MB in the beginning and 65.0MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 16:54:03,321 INFO L158 Benchmark]: TraceAbstraction took 10768.60ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 64.3MB in the beginning and 100.4MB in the end (delta: -36.1MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. [2022-02-20 16:54:03,323 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.10ms. Allocated memory is still 104.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.28ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 73.5MB in the beginning and 89.5MB in the end (delta: -16.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.24ms. Allocated memory is still 125.8MB. Free memory was 89.5MB in the beginning and 87.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.36ms. Allocated memory is still 125.8MB. Free memory was 87.0MB in the beginning and 84.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 448.71ms. Allocated memory is still 125.8MB. Free memory was 84.4MB in the beginning and 65.0MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10768.60ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 64.3MB in the beginning and 100.4MB in the end (delta: -36.1MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_47| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_47|: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:54:03,348 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 0 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:54:05,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:54:05,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:54:05,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:54:05,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:54:05,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:54:05,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:54:05,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:54:05,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:54:05,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:54:05,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:54:05,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:54:05,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:54:05,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:54:05,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:54:05,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:54:05,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:54:05,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:54:05,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:54:05,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:54:05,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:54:05,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:54:05,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:54:05,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:54:05,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:54:05,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:54:05,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:54:05,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:54:05,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:54:05,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:54:05,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:54:05,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:54:05,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:54:05,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:54:05,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:54:05,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:54:05,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:54:05,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:54:05,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:54:05,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:54:05,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:54:05,315 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:54:05,351 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:54:05,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:54:05,352 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:54:05,352 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:54:05,353 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:54:05,353 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:54:05,354 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:54:05,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:54:05,354 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:54:05,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:54:05,355 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:54:05,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:54:05,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:54:05,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:54:05,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:54:05,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:54:05,356 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:54:05,357 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:54:05,357 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:54:05,357 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:54:05,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:54:05,357 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:54:05,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:54:05,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:54:05,358 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:54:05,358 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:54:05,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:54:05,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:54:05,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:54:05,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:54:05,359 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:54:05,359 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:54:05,359 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:54:05,359 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:54:05,359 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:54:05,360 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:54:05,360 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 ! call(reach_error())) ) 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 -> 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc [2022-02-20 16:54:05,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:54:05,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:54:05,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:54:05,693 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:54:05,694 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:54:05,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_append_equal.i [2022-02-20 16:54:05,749 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdafa9dc1/9aba07fc9fe34f2c888b414df659fa20/FLAG241181c85 [2022-02-20 16:54:06,248 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:54:06,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_equal.i [2022-02-20 16:54:06,258 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdafa9dc1/9aba07fc9fe34f2c888b414df659fa20/FLAG241181c85 [2022-02-20 16:54:06,716 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdafa9dc1/9aba07fc9fe34f2c888b414df659fa20 [2022-02-20 16:54:06,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:54:06,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:54:06,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:54:06,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:54:06,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:54:06,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:54:06" (1/1) ... [2022-02-20 16:54:06,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b8c5817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:06, skipping insertion in model container [2022-02-20 16:54:06,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:54:06" (1/1) ... [2022-02-20 16:54:06,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:54:06,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:54:07,105 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/dll2c_append_equal.i[24585,24598] [2022-02-20 16:54:07,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:54:07,124 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:54:07,197 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/dll2c_append_equal.i[24585,24598] [2022-02-20 16:54:07,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:54:07,239 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:54:07,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07 WrapperNode [2022-02-20 16:54:07,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:54:07,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:54:07,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:54:07,242 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:54:07,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,274 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,315 INFO L137 Inliner]: procedures = 130, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 135 [2022-02-20 16:54:07,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:54:07,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:54:07,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:54:07,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:54:07,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:54:07,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:54:07,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:54:07,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:54:07,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:54:07,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:07,413 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 16:54:07,428 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 16:54:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:54:07,455 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 16:54:07,455 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 16:54:07,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:54:07,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:54:07,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:54:07,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:54:07,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:54:07,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:54:07,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:54:07,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 16:54:07,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:54:07,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:54:07,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:54:07,591 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:54:07,592 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:54:08,120 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:54:08,130 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:54:08,131 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 16:54:08,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:54:08 BoogieIcfgContainer [2022-02-20 16:54:08,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:54:08,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:54:08,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:54:08,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:54:08,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:54:06" (1/3) ... [2022-02-20 16:54:08,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e81f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:54:08, skipping insertion in model container [2022-02-20 16:54:08,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (2/3) ... [2022-02-20 16:54:08,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e81f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:54:08, skipping insertion in model container [2022-02-20 16:54:08,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:54:08" (3/3) ... [2022-02-20 16:54:08,140 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2022-02-20 16:54:08,145 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:54:08,146 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:54:08,184 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:54:08,191 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 16:54:08,191 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:54:08,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 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 16:54:08,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:54:08,212 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:08,212 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:08,213 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:08,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:08,228 INFO L85 PathProgramCache]: Analyzing trace with hash 976010426, now seen corresponding path program 1 times [2022-02-20 16:54:08,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:08,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146793935] [2022-02-20 16:54:08,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:08,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:08,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:08,249 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 16:54:08,252 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 16:54:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:08,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:54:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:08,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:08,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#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(21bv32, 2bv32); {38#true} is VALID [2022-02-20 16:54:08,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~post20#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, 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_~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_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {38#true} is VALID [2022-02-20 16:54:08,594 INFO L272 TraceCheckUtils]: 2: Hoare triple {38#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {38#true} is VALID [2022-02-20 16:54:08,594 INFO L290 TraceCheckUtils]: 3: Hoare triple {38#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; {38#true} is VALID [2022-02-20 16:54:08,594 INFO L290 TraceCheckUtils]: 4: Hoare triple {38#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {38#true} is VALID [2022-02-20 16:54:08,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {38#true} is VALID [2022-02-20 16:54:08,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {38#true} assume true; {38#true} is VALID [2022-02-20 16:54:08,595 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {38#true} {38#true} #100#return; {38#true} is VALID [2022-02-20 16:54:08,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#true} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {38#true} is VALID [2022-02-20 16:54:08,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#true} assume !true; {38#true} is VALID [2022-02-20 16:54:08,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {38#true} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {38#true} is VALID [2022-02-20 16:54:08,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#true} main_#t~ret15#1.base, main_#t~ret15#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;call write~init~$Pointer$(main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret15#1.base, main_#t~ret15#1.offset;assume { :begin_inline_dll_circular_append } true;dll_circular_append_#in~head#1.base, dll_circular_append_#in~head#1.offset, dll_circular_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1;havoc dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset, dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset, dll_circular_append_#t~mem11#1.base, dll_circular_append_#t~mem11#1.offset, dll_circular_append_#t~mem12#1.base, dll_circular_append_#t~mem12#1.offset, dll_circular_append_#t~mem13#1.base, dll_circular_append_#t~mem13#1.offset, dll_circular_append_#t~mem14#1.base, dll_circular_append_#t~mem14#1.offset, dll_circular_append_~last~1#1.base, dll_circular_append_~last~1#1.offset, dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, dll_circular_append_~data#1, dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset;dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset := dll_circular_append_#in~head#1.base, dll_circular_append_#in~head#1.offset;dll_circular_append_~data#1 := dll_circular_append_#in~data#1; {38#true} is VALID [2022-02-20 16:54:08,597 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#true} call dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset := node_create(dll_circular_append_~data#1); {38#true} is VALID [2022-02-20 16:54:08,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#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; {38#true} is VALID [2022-02-20 16:54:08,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {38#true} is VALID [2022-02-20 16:54:08,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {38#true} is VALID [2022-02-20 16:54:08,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {38#true} assume true; {38#true} is VALID [2022-02-20 16:54:08,598 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38#true} {38#true} #104#return; {38#true} is VALID [2022-02-20 16:54:08,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {38#true} dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset := dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset;havoc dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset;call dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset := read~$Pointer$(dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4bv32); {38#true} is VALID [2022-02-20 16:54:08,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {38#true} assume 0bv32 == dll_circular_append_#t~mem10#1.base && 0bv32 == dll_circular_append_#t~mem10#1.offset;havoc dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset;call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~new_last~0#1.base, ~bvadd32(4bv32, dll_circular_append_~new_last~0#1.offset), 4bv32);call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4bv32); {38#true} is VALID [2022-02-20 16:54:08,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#true} assume { :end_inline_dll_circular_append } true;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;main_~count~0#1 := 0bv32; {38#true} is VALID [2022-02-20 16:54:08,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {38#true} assume !true; {39#false} is VALID [2022-02-20 16:54:08,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {39#false} assume main_~count~0#1 != ~bvadd32(1bv32, main_~len~0#1); {39#false} is VALID [2022-02-20 16:54:08,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-02-20 16:54:08,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 16:54:08,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:54:08,602 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:08,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146793935] [2022-02-20 16:54:08,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146793935] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:08,603 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:08,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:54:08,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586421999] [2022-02-20 16:54:08,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:08,609 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 24 [2022-02-20 16:54:08,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:08,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 16:54:08,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:08,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:54:08,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:54:08,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:54:08,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:54:08,682 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 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 has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 16:54:08,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:08,863 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2022-02-20 16:54:08,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:54:08,864 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 24 [2022-02-20 16:54:08,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 16:54:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 82 transitions. [2022-02-20 16:54:08,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 16:54:08,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 82 transitions. [2022-02-20 16:54:08,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 82 transitions. [2022-02-20 16:54:08,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:08,995 INFO L225 Difference]: With dead ends: 61 [2022-02-20 16:54:08,995 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 16:54:08,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:54:09,000 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:09,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:09,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 16:54:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 16:54:09,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:09,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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 16:54:09,026 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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 16:54:09,026 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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 16:54:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:09,030 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-02-20 16:54:09,030 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-02-20 16:54:09,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:09,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:09,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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 27 states. [2022-02-20 16:54:09,031 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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 27 states. [2022-02-20 16:54:09,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:09,035 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-02-20 16:54:09,035 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-02-20 16:54:09,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:09,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:09,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:09,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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 16:54:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-02-20 16:54:09,039 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 24 [2022-02-20 16:54:09,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:09,039 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-02-20 16:54:09,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 16:54:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-02-20 16:54:09,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:54:09,041 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:09,041 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:09,056 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 16:54:09,253 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 16:54:09,253 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:09,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:09,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1442307826, now seen corresponding path program 1 times [2022-02-20 16:54:09,254 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:09,255 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038761212] [2022-02-20 16:54:09,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:09,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:09,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:09,256 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 16:54:09,259 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 16:54:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:09,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:54:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:09,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:09,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {280#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(21bv32, 2bv32); {280#true} is VALID [2022-02-20 16:54:09,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {280#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~post20#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, 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_~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_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {288#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:54:09,544 INFO L272 TraceCheckUtils]: 2: Hoare triple {288#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {280#true} is VALID [2022-02-20 16:54:09,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {280#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; {280#true} is VALID [2022-02-20 16:54:09,545 INFO L290 TraceCheckUtils]: 4: Hoare triple {280#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {280#true} is VALID [2022-02-20 16:54:09,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {280#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {280#true} is VALID [2022-02-20 16:54:09,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {280#true} assume true; {280#true} is VALID [2022-02-20 16:54:09,546 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {280#true} {288#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} #100#return; {288#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:54:09,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {288#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:54:09,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {288#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {281#false} is VALID [2022-02-20 16:54:09,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {281#false} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {281#false} is VALID [2022-02-20 16:54:09,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {281#false} main_#t~ret15#1.base, main_#t~ret15#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;call write~init~$Pointer$(main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret15#1.base, main_#t~ret15#1.offset;assume { :begin_inline_dll_circular_append } true;dll_circular_append_#in~head#1.base, dll_circular_append_#in~head#1.offset, dll_circular_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1;havoc dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset, dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset, dll_circular_append_#t~mem11#1.base, dll_circular_append_#t~mem11#1.offset, dll_circular_append_#t~mem12#1.base, dll_circular_append_#t~mem12#1.offset, dll_circular_append_#t~mem13#1.base, dll_circular_append_#t~mem13#1.offset, dll_circular_append_#t~mem14#1.base, dll_circular_append_#t~mem14#1.offset, dll_circular_append_~last~1#1.base, dll_circular_append_~last~1#1.offset, dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, dll_circular_append_~data#1, dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset;dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset := dll_circular_append_#in~head#1.base, dll_circular_append_#in~head#1.offset;dll_circular_append_~data#1 := dll_circular_append_#in~data#1; {281#false} is VALID [2022-02-20 16:54:09,548 INFO L272 TraceCheckUtils]: 12: Hoare triple {281#false} call dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset := node_create(dll_circular_append_~data#1); {281#false} is VALID [2022-02-20 16:54:09,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {281#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; {281#false} is VALID [2022-02-20 16:54:09,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {281#false} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {281#false} is VALID [2022-02-20 16:54:09,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {281#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {281#false} is VALID [2022-02-20 16:54:09,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {281#false} assume true; {281#false} is VALID [2022-02-20 16:54:09,549 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {281#false} {281#false} #104#return; {281#false} is VALID [2022-02-20 16:54:09,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {281#false} dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset := dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset;havoc dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset;call dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset := read~$Pointer$(dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4bv32); {281#false} is VALID [2022-02-20 16:54:09,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {281#false} assume 0bv32 == dll_circular_append_#t~mem10#1.base && 0bv32 == dll_circular_append_#t~mem10#1.offset;havoc dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset;call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~new_last~0#1.base, ~bvadd32(4bv32, dll_circular_append_~new_last~0#1.offset), 4bv32);call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4bv32); {281#false} is VALID [2022-02-20 16:54:09,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {281#false} assume { :end_inline_dll_circular_append } true;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;main_~count~0#1 := 0bv32; {281#false} is VALID [2022-02-20 16:54:09,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {281#false} call main_#t~mem18#1 := read~intINTTYPE4(main_~ptr~0#1.base, ~bvadd32(8bv32, main_~ptr~0#1.offset), 4bv32); {281#false} is VALID [2022-02-20 16:54:09,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {281#false} assume main_~data~0#1 != main_#t~mem18#1;havoc main_#t~mem18#1; {281#false} is VALID [2022-02-20 16:54:09,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {281#false} assume !false; {281#false} is VALID [2022-02-20 16:54:09,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:54:09,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:54:09,551 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:09,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038761212] [2022-02-20 16:54:09,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038761212] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:09,551 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:09,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:54:09,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456900880] [2022-02-20 16:54:09,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:09,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 24 [2022-02-20 16:54:09,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:09,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 16:54:09,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:09,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:54:09,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:54:09,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:54:09,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:54:09,588 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 16:54:09,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:09,958 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2022-02-20 16:54:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:54:09,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 24 [2022-02-20 16:54:09,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 16:54:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-02-20 16:54:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 16:54:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-02-20 16:54:09,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-02-20 16:54:10,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:10,041 INFO L225 Difference]: With dead ends: 50 [2022-02-20 16:54:10,041 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:54:10,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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 16:54:10,042 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 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 16:54:10,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:10,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:54:10,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-02-20 16:54:10,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:10,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 16:54:10,048 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 16:54:10,048 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 16:54:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:10,051 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-02-20 16:54:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-02-20 16:54:10,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:10,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:10,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 32 states. [2022-02-20 16:54:10,052 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 32 states. [2022-02-20 16:54:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:10,055 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-02-20 16:54:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-02-20 16:54:10,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:10,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:10,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:10,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:10,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 16:54:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-02-20 16:54:10,058 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2022-02-20 16:54:10,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:10,059 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-02-20 16:54:10,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 16:54:10,059 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 16:54:10,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 16:54:10,060 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:10,060 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:10,079 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 16:54:10,277 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 16:54:10,278 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:10,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:10,279 INFO L85 PathProgramCache]: Analyzing trace with hash 915772386, now seen corresponding path program 1 times [2022-02-20 16:54:10,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:10,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352894649] [2022-02-20 16:54:10,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:10,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:10,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:10,281 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 16:54:10,283 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 16:54:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:10,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 16:54:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:10,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:10,887 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 16:54:10,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 16:54:11,004 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 8 treesize of output 4 [2022-02-20 16:54:11,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:11,197 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 15 treesize of output 17 [2022-02-20 16:54:11,308 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 16 treesize of output 8 [2022-02-20 16:54:11,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {520#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(21bv32, 2bv32); {520#true} is VALID [2022-02-20 16:54:11,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {520#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~post20#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, 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_~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_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {528#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:54:11,350 INFO L272 TraceCheckUtils]: 2: Hoare triple {528#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:11,350 INFO L290 TraceCheckUtils]: 3: Hoare triple {532#(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; {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:11,351 INFO L290 TraceCheckUtils]: 4: Hoare triple {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:11,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:11,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume true; {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:11,353 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} {528#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} #100#return; {528#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:54:11,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {528#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {528#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:54:11,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {528#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {528#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:54:11,354 INFO L272 TraceCheckUtils]: 10: Hoare triple {528#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:11,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {532#(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; {560#(and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:11,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {560#(and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {560#(and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:11,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {560#(and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {567#(and (not (= |node_create_#res#1.base| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:11,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {567#(and (not (= |node_create_#res#1.base| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {567#(and (not (= |node_create_#res#1.base| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:11,373 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {567#(and (not (= |node_create_#res#1.base| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {528#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} #102#return; {574#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| (_ bv0 32))))} is VALID [2022-02-20 16:54:11,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {574#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| (_ bv0 32))))} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {578#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))} is VALID [2022-02-20 16:54:11,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {578#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {578#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))} is VALID [2022-02-20 16:54:11,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {578#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {585#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 16:54:11,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {585#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32))))} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {585#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 16:54:11,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {585#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32))))} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {592#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_#res#1.base|)))} is VALID [2022-02-20 16:54:11,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {592#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_#res#1.base|)))} main_#t~ret15#1.base, main_#t~ret15#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;call write~init~$Pointer$(main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret15#1.base, main_#t~ret15#1.offset;assume { :begin_inline_dll_circular_append } true;dll_circular_append_#in~head#1.base, dll_circular_append_#in~head#1.offset, dll_circular_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1;havoc dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset, dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset, dll_circular_append_#t~mem11#1.base, dll_circular_append_#t~mem11#1.offset, dll_circular_append_#t~mem12#1.base, dll_circular_append_#t~mem12#1.offset, dll_circular_append_#t~mem13#1.base, dll_circular_append_#t~mem13#1.offset, dll_circular_append_#t~mem14#1.base, dll_circular_append_#t~mem14#1.offset, dll_circular_append_~last~1#1.base, dll_circular_append_~last~1#1.offset, dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, dll_circular_append_~data#1, dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset;dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset := dll_circular_append_#in~head#1.base, dll_circular_append_#in~head#1.offset;dll_circular_append_~data#1 := dll_circular_append_#in~data#1; {596#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|) (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_circular_append_~head#1.base|))} is VALID [2022-02-20 16:54:11,379 INFO L272 TraceCheckUtils]: 22: Hoare triple {596#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|) (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_circular_append_~head#1.base|))} call dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset := node_create(dll_circular_append_~data#1); {600#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:54:11,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {600#(and (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; {604#(and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:54:11,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {604#(and (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); {604#(and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:54:11,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {604#(and (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {611#(and (exists ((v_ArrVal_247 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_247) |#memory_$Pointer$.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:11,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {611#(and (exists ((v_ArrVal_247 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_247) |#memory_$Pointer$.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {611#(and (exists ((v_ArrVal_247 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_247) |#memory_$Pointer$.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:11,404 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {611#(and (exists ((v_ArrVal_247 (Array (_ BitVec 32) (_ BitVec 32))) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_247) |#memory_$Pointer$.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {596#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|) (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_circular_append_~head#1.base|))} #104#return; {618#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|) (_ bv0 32))) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_circular_append_~head#1.base|))))} is VALID [2022-02-20 16:54:11,405 INFO L290 TraceCheckUtils]: 28: Hoare triple {618#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) |ULTIMATE.start_dll_circular_append_~head#1.offset|) (_ bv0 32))) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (not (= |#StackHeapBarrier| (_ bv0 32))) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_circular_append_~head#1.base|))))} dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset := dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset;havoc dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset;call dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset := read~$Pointer$(dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4bv32); {622#(not (= |ULTIMATE.start_dll_circular_append_#t~mem10#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:54:11,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {622#(not (= |ULTIMATE.start_dll_circular_append_#t~mem10#1.base| (_ bv0 32)))} assume 0bv32 == dll_circular_append_#t~mem10#1.base && 0bv32 == dll_circular_append_#t~mem10#1.offset;havoc dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset;call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~new_last~0#1.base, ~bvadd32(4bv32, dll_circular_append_~new_last~0#1.offset), 4bv32);call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4bv32); {521#false} is VALID [2022-02-20 16:54:11,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {521#false} assume { :end_inline_dll_circular_append } true;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;main_~count~0#1 := 0bv32; {521#false} is VALID [2022-02-20 16:54:11,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {521#false} call main_#t~mem18#1 := read~intINTTYPE4(main_~ptr~0#1.base, ~bvadd32(8bv32, main_~ptr~0#1.offset), 4bv32); {521#false} is VALID [2022-02-20 16:54:11,406 INFO L290 TraceCheckUtils]: 32: Hoare triple {521#false} assume main_~data~0#1 != main_#t~mem18#1;havoc main_#t~mem18#1; {521#false} is VALID [2022-02-20 16:54:11,406 INFO L290 TraceCheckUtils]: 33: Hoare triple {521#false} assume !false; {521#false} is VALID [2022-02-20 16:54:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:54:11,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:54:11,574 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:11,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352894649] [2022-02-20 16:54:11,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352894649] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:11,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1998855443] [2022-02-20 16:54:11,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:11,575 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 16:54:11,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 16:54:11,581 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 16:54:11,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-02-20 16:54:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:11,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 38 conjunts are in the unsatisfiable core [2022-02-20 16:54:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:11,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:12,395 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 11 treesize of output 7 [2022-02-20 16:54:12,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:12,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:12,846 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 14 [2022-02-20 16:54:12,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:12,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:12,871 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 14 [2022-02-20 16:54:12,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2022-02-20 16:54:12,907 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 8 treesize of output 7 [2022-02-20 16:54:12,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:12,919 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 16:54:12,929 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 8 treesize of output 7 [2022-02-20 16:54:13,048 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 26 treesize of output 14 [2022-02-20 16:54:13,057 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 16:54:13,204 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 16:54:13,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {520#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(21bv32, 2bv32); {520#true} is VALID [2022-02-20 16:54:13,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {520#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1.base, main_#t~ret15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~post20#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, 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_~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_circular_create } true;dll_circular_create_#in~len#1, dll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset, dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset, dll_circular_create_#t~post6#1, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~len#1, dll_circular_create_~data#1, dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset;dll_circular_create_~len#1 := dll_circular_create_#in~len#1;dll_circular_create_~data#1 := dll_circular_create_#in~data#1; {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} is VALID [2022-02-20 16:54:13,261 INFO L272 TraceCheckUtils]: 2: Hoare triple {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:13,263 INFO L290 TraceCheckUtils]: 3: Hoare triple {532#(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; {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:13,263 INFO L290 TraceCheckUtils]: 4: Hoare triple {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:13,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:13,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume true; {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:13,265 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} #100#return; {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} is VALID [2022-02-20 16:54:13,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} is VALID [2022-02-20 16:54:13,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} is VALID [2022-02-20 16:54:13,267 INFO L272 TraceCheckUtils]: 10: Hoare triple {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:13,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {532#(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; {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:13,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:13,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:13,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume true; {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:13,269 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} #102#return; {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} is VALID [2022-02-20 16:54:13,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4bv32); {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} is VALID [2022-02-20 16:54:13,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} assume dll_circular_create_~head~0#1.base != 0bv32 || dll_circular_create_~head~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32); {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} is VALID [2022-02-20 16:54:13,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} is VALID [2022-02-20 16:54:13,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} is VALID [2022-02-20 16:54:13,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, dll_circular_create_~head~0#1.base, ~bvadd32(4bv32, dll_circular_create_~head~0#1.offset), 4bv32);dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} is VALID [2022-02-20 16:54:13,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {664#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} main_#t~ret15#1.base, main_#t~ret15#1.offset := dll_circular_create_#res#1.base, dll_circular_create_#res#1.offset;assume { :end_inline_dll_circular_create } true;call write~init~$Pointer$(main_#t~ret15#1.base, main_#t~ret15#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret15#1.base, main_#t~ret15#1.offset;assume { :begin_inline_dll_circular_append } true;dll_circular_append_#in~head#1.base, dll_circular_append_#in~head#1.offset, dll_circular_append_#in~data#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1;havoc dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset, dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset, dll_circular_append_#t~mem11#1.base, dll_circular_append_#t~mem11#1.offset, dll_circular_append_#t~mem12#1.base, dll_circular_append_#t~mem12#1.offset, dll_circular_append_#t~mem13#1.base, dll_circular_append_#t~mem13#1.offset, dll_circular_append_#t~mem14#1.base, dll_circular_append_#t~mem14#1.offset, dll_circular_append_~last~1#1.base, dll_circular_append_~last~1#1.offset, dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, dll_circular_append_~data#1, dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset;dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset := dll_circular_append_#in~head#1.base, dll_circular_append_#in~head#1.offset;dll_circular_append_~data#1 := dll_circular_append_#in~data#1; {725#(and (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_dll_circular_append_~head#1.offset|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_circular_append_~data#1|))} is VALID [2022-02-20 16:54:13,279 INFO L272 TraceCheckUtils]: 22: Hoare triple {725#(and (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_dll_circular_append_~head#1.offset|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_circular_append_~data#1|))} call dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset := node_create(dll_circular_append_~data#1); {532#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:13,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {532#(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; {732#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= |node_create_#in~data#1| |node_create_~data#1|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:13,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {732#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= |node_create_#in~data#1| |node_create_~data#1|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {732#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= |node_create_#in~data#1| |node_create_~data#1|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:13,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {732#(and (= |node_create_~temp~0#1.offset| (_ bv0 32)) (= |node_create_#in~data#1| |node_create_~data#1|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~bvadd32(8bv32, ~temp~0#1.offset), 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {739#(and (= (select (select |#memory_int| |node_create_#res#1.base|) (_ bv8 32)) |node_create_#in~data#1|) (= |node_create_#res#1.offset| (_ bv0 32)) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:13,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {739#(and (= (select (select |#memory_int| |node_create_#res#1.base|) (_ bv8 32)) |node_create_#in~data#1|) (= |node_create_#res#1.offset| (_ bv0 32)) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {739#(and (= (select (select |#memory_int| |node_create_#res#1.base|) (_ bv8 32)) |node_create_#in~data#1|) (= |node_create_#res#1.offset| (_ bv0 32)) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:13,316 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {739#(and (= (select (select |#memory_int| |node_create_#res#1.base|) (_ bv8 32)) |node_create_#in~data#1|) (= |node_create_#res#1.offset| (_ bv0 32)) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {725#(and (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_dll_circular_append_~head#1.offset|) (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_circular_append_~data#1|))} #104#return; {746#(and (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_dll_circular_append_~head#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) (_ bv8 32))) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_dll_circular_append_~head#1.base|))} is VALID [2022-02-20 16:54:13,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {746#(and (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_dll_circular_append_~head#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_dll_circular_append_#t~ret9#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_append_#t~ret9#1.base|) (_ bv8 32))) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_dll_circular_append_~head#1.base|))} dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset := dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset;havoc dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset;call dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset := read~$Pointer$(dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4bv32); {750#(and (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_dll_circular_append_~head#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |#StackHeapBarrier|))) (= (_ bv0 32) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (_ bv8 32))) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_dll_circular_append_~head#1.base|))} is VALID [2022-02-20 16:54:13,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {750#(and (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_dll_circular_append_~head#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_dll_circular_append_~new_last~0#1.base| |#StackHeapBarrier|))) (= (_ bv0 32) |ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_append_~new_last~0#1.base|) (_ bv8 32))) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_dll_circular_append_~head#1.base|))} assume 0bv32 == dll_circular_append_#t~mem10#1.base && 0bv32 == dll_circular_append_#t~mem10#1.offset;havoc dll_circular_append_#t~mem10#1.base, dll_circular_append_#t~mem10#1.offset;call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~new_last~0#1.base, ~bvadd32(4bv32, dll_circular_append_~new_last~0#1.offset), 4bv32);call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_append_~new_last~0#1.base, dll_circular_append_~new_last~0#1.offset, dll_circular_append_~head#1.base, dll_circular_append_~head#1.offset, 4bv32); {754#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv8 32)) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|))))} is VALID [2022-02-20 16:54:13,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {754#(and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv8 32)) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|))))} assume { :end_inline_dll_circular_append } true;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;main_~count~0#1 := 0bv32; {758#(and (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (_ bv8 32))) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~ptr~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))) (= |ULTIMATE.start_main_~ptr~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 16:54:13,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {758#(and (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (_ bv8 32))) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~ptr~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))) (= |ULTIMATE.start_main_~ptr~0#1.offset| (_ bv0 32)))} call main_#t~mem18#1 := read~intINTTYPE4(main_~ptr~0#1.base, ~bvadd32(8bv32, main_~ptr~0#1.offset), 4bv32); {762#(and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_main_#t~mem18#1|) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} is VALID [2022-02-20 16:54:13,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {762#(and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_main_#t~mem18#1|) (= |ULTIMATE.start_main_~data~0#1| (_ bv1 32)))} assume main_~data~0#1 != main_#t~mem18#1;havoc main_#t~mem18#1; {521#false} is VALID [2022-02-20 16:54:13,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {521#false} assume !false; {521#false} is VALID [2022-02-20 16:54:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 16:54:13,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:54:13,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1998855443] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:13,421 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 16:54:13,421 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 25 [2022-02-20 16:54:13,422 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275038458] [2022-02-20 16:54:13,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:13,422 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2022-02-20 16:54:13,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:13,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:13,600 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 16:54:13,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 16:54:13,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:54:13,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 16:54:13,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=615, Unknown=10, NotChecked=0, Total=702 [2022-02-20 16:54:13,602 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:14,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:14,530 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-02-20 16:54:14,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 16:54:14,530 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2022-02-20 16:54:14,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:14,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:14,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2022-02-20 16:54:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2022-02-20 16:54:14,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 38 transitions. [2022-02-20 16:54:14,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:14,720 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:54:14,720 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 16:54:14,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=712, Unknown=11, NotChecked=0, Total=812 [2022-02-20 16:54:14,722 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:14,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 133 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 69 Unchecked, 0.2s Time] [2022-02-20 16:54:14,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 16:54:14,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-20 16:54:14,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:14,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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 16:54:14,727 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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 16:54:14,728 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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 16:54:14,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:14,729 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-20 16:54:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-20 16:54:14,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:14,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:14,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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 31 states. [2022-02-20 16:54:14,731 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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 31 states. [2022-02-20 16:54:14,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:14,733 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-20 16:54:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-20 16:54:14,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:14,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:14,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:14,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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 16:54:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-02-20 16:54:14,736 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 34 [2022-02-20 16:54:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:14,736 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-02-20 16:54:14,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-20 16:54:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 16:54:14,738 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:14,738 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:14,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:54:14,951 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 16:54:15,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:54:15,142 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:15,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:15,143 INFO L85 PathProgramCache]: Analyzing trace with hash 917619428, now seen corresponding path program 1 times [2022-02-20 16:54:15,143 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:15,143 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993345776] [2022-02-20 16:54:15,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:15,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:15,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:15,144 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 16:54:15,145 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 16:54:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:15,914 WARN L261 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 229 conjunts are in the unsatisfiable core [2022-02-20 16:54:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:16,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:16,048 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 16:54:16,091 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 7 treesize of output 5 [2022-02-20 16:54:16,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:16,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-02-20 16:54:16,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:16,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 16:54:16,615 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 11 treesize of output 7 [2022-02-20 16:54:16,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:16,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:16,792 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 16:54:16,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2022-02-20 16:54:16,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-02-20 16:54:17,132 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 16:54:17,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 16:54:17,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:17,552 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 14 [2022-02-20 16:54:17,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:17,585 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 22 treesize of output 19 [2022-02-20 16:54:17,604 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 14 treesize of output 18 [2022-02-20 16:54:17,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 16:54:17,975 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 16:54:17,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 38 [2022-02-20 16:54:17,998 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 16:54:18,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:18,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:18,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-02-20 16:54:18,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-02-20 16:54:19,040 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 16:54:19,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-02-20 16:54:19,057 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 16:54:19,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:19,115 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-02-20 16:54:19,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 69 [2022-02-20 16:54:19,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:19,154 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 16:54:19,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:19,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:19,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:19,260 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-02-20 16:54:19,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 42 [2022-02-20 16:54:20,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:20,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:20,470 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:20,470 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993345776] [2022-02-20 16:54:20,471 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 16:54:20,494 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 16:54:20,671 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 16:54:20,672 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_49| at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:166) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:126) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:90) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:904) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) 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.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:129) 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 16:54:20,677 INFO L158 Benchmark]: Toolchain (without parser) took 13957.57ms. Allocated memory was 50.3MB in the beginning and 96.5MB in the end (delta: 46.1MB). Free memory was 26.4MB in the beginning and 35.7MB in the end (delta: -9.3MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2022-02-20 16:54:20,677 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 50.3MB. Free memory is still 31.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:54:20,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.33ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 26.2MB in the beginning and 38.0MB in the end (delta: -11.7MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2022-02-20 16:54:20,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.94ms. Allocated memory is still 65.0MB. Free memory was 38.0MB in the beginning and 35.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:54:20,678 INFO L158 Benchmark]: Boogie Preprocessor took 57.41ms. Allocated memory is still 65.0MB. Free memory was 35.4MB in the beginning and 32.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:54:20,678 INFO L158 Benchmark]: RCFGBuilder took 757.36ms. Allocated memory is still 65.0MB. Free memory was 32.7MB in the beginning and 30.4MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:54:20,678 INFO L158 Benchmark]: TraceAbstraction took 12541.90ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 30.0MB in the beginning and 35.7MB in the end (delta: -5.6MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2022-02-20 16:54:20,680 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.16ms. Allocated memory is still 50.3MB. Free memory is still 31.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 520.33ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 26.2MB in the beginning and 38.0MB in the end (delta: -11.7MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.94ms. Allocated memory is still 65.0MB. Free memory was 38.0MB in the beginning and 35.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.41ms. Allocated memory is still 65.0MB. Free memory was 35.4MB in the beginning and 32.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 757.36ms. Allocated memory is still 65.0MB. Free memory was 32.7MB in the beginning and 30.4MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12541.90ms. Allocated memory was 65.0MB in the beginning and 96.5MB in the end (delta: 31.5MB). Free memory was 30.0MB in the beginning and 35.7MB in the end (delta: -5.6MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_49| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_49|: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:54:20,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_49|