./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_append_unequal.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_unequal.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 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:53:54,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:53:54,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:53:54,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:53:54,436 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:53:54,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:53:54,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:53:54,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:53:54,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:53:54,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:53:54,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:53:54,444 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:53:54,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:53:54,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:53:54,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:53:54,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:53:54,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:53:54,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:53:54,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:53:54,449 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:53:54,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:53:54,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:53:54,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:53:54,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:53:54,467 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:53:54,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:53:54,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:53:54,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:53:54,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:53:54,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:53:54,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:53:54,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:53:54,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:53:54,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:53:54,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:53:54,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:53:54,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:53:54,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:53:54,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:53:54,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:53:54,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:53:54,494 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:54,507 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:53:54,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:53:54,508 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:53:54,508 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:53:54,508 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:53:54,508 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:53:54,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:53:54,509 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:53:54,509 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:53:54,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:53:54,509 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:53:54,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:53:54,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:53:54,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:53:54,509 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:53:54,509 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:53:54,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:53:54,509 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:53:54,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:53:54,510 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:53:54,510 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:53:54,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:53:54,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:53:54,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:53:54,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:53:54,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:53:54,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:53:54,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:53:54,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:53:54,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:53:54,511 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:53:54,511 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:53:54,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:53:54,511 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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2022-02-20 16:53:54,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:53:54,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:53:54,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:53:54,724 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:53:54,724 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:53:54,725 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2022-02-20 16:53:54,778 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46bde478/9f0af556d2d9437b9baee613d6ae60dd/FLAGc2b31aa35 [2022-02-20 16:53:55,149 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:53:55,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2022-02-20 16:53:55,161 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46bde478/9f0af556d2d9437b9baee613d6ae60dd/FLAGc2b31aa35 [2022-02-20 16:53:55,506 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46bde478/9f0af556d2d9437b9baee613d6ae60dd [2022-02-20 16:53:55,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:53:55,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:53:55,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:53:55,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:53:55,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:53:55,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:53:55" (1/1) ... [2022-02-20 16:53:55,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd0985b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:53:55, skipping insertion in model container [2022-02-20 16:53:55,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:53:55" (1/1) ... [2022-02-20 16:53:55,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:53:55,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:53:55,831 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_unequal.i[24672,24685] [2022-02-20 16:53:55,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:53:55,843 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:53:55,883 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_unequal.i[24672,24685] [2022-02-20 16:53:55,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:53:55,919 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:53:55,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:53:55 WrapperNode [2022-02-20 16:53:55,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:53:55,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:53:55,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:53:55,921 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:53:55,926 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:55" (1/1) ... [2022-02-20 16:53:55,949 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:55" (1/1) ... [2022-02-20 16:53:55,978 INFO L137 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 146 [2022-02-20 16:53:55,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:53:55,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:53:55,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:53:55,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:53:55,986 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:55" (1/1) ... [2022-02-20 16:53:55,986 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:55" (1/1) ... [2022-02-20 16:53:55,998 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:55" (1/1) ... [2022-02-20 16:53:55,998 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:55" (1/1) ... [2022-02-20 16:53:56,008 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:55" (1/1) ... [2022-02-20 16:53:56,018 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:55" (1/1) ... [2022-02-20 16:53:56,022 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:55" (1/1) ... [2022-02-20 16:53:56,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:53:56,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:53:56,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:53:56,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:53:56,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:53:55" (1/1) ... [2022-02-20 16:53:56,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:53:56,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:53:56,053 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:56,076 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:56,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:53:56,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:53:56,097 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 16:53:56,098 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 16:53:56,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:53:56,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:53:56,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:53:56,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:53:56,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:53:56,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:53:56,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 16:53:56,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:53:56,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:53:56,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:53:56,197 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:53:56,198 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:53:56,463 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:53:56,468 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:53:56,468 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 16:53:56,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:53:56 BoogieIcfgContainer [2022-02-20 16:53:56,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:53:56,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:53:56,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:53:56,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:53:56,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:53:55" (1/3) ... [2022-02-20 16:53:56,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d56aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:53:56, skipping insertion in model container [2022-02-20 16:53:56,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:53:55" (2/3) ... [2022-02-20 16:53:56,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d56aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:53:56, skipping insertion in model container [2022-02-20 16:53:56,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:53:56" (3/3) ... [2022-02-20 16:53:56,487 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2022-02-20 16:53:56,492 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:53:56,493 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:53:56,537 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:53:56,544 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:56,545 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:53:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 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,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:53:56,570 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:53:56,570 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:56,571 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:53:56,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:53:56,576 INFO L85 PathProgramCache]: Analyzing trace with hash -140887327, now seen corresponding path program 1 times [2022-02-20 16:53:56,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:53:56,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101624719] [2022-02-20 16:53:56,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:53:56,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:53:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:56,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:53:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:56,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#(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; {40#true} is VALID [2022-02-20 16:53:56,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {40#true} is VALID [2022-02-20 16:53:56,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#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; {40#true} is VALID [2022-02-20 16:53:56,809 INFO L290 TraceCheckUtils]: 3: Hoare triple {40#true} assume true; {40#true} is VALID [2022-02-20 16:53:56,809 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {40#true} {40#true} #106#return; {40#true} is VALID [2022-02-20 16:53:56,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 16:53:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:56,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#(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; {40#true} is VALID [2022-02-20 16:53:56,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {40#true} is VALID [2022-02-20 16:53:56,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#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; {40#true} is VALID [2022-02-20 16:53:56,856 INFO L290 TraceCheckUtils]: 3: Hoare triple {40#true} assume true; {40#true} is VALID [2022-02-20 16:53:56,856 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {40#true} {41#false} #110#return; {41#false} is VALID [2022-02-20 16:53:56,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {40#true} is VALID [2022-02-20 16:53:56,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#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~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~post23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {40#true} is VALID [2022-02-20 16:53:56,859 INFO L272 TraceCheckUtils]: 2: Hoare triple {40#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {52#(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:56,859 INFO L290 TraceCheckUtils]: 3: Hoare triple {52#(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; {40#true} is VALID [2022-02-20 16:53:56,859 INFO L290 TraceCheckUtils]: 4: Hoare triple {40#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {40#true} is VALID [2022-02-20 16:53:56,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#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; {40#true} is VALID [2022-02-20 16:53:56,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {40#true} assume true; {40#true} is VALID [2022-02-20 16:53:56,860 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {40#true} {40#true} #106#return; {40#true} is VALID [2022-02-20 16:53:56,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#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; {40#true} is VALID [2022-02-20 16:53:56,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume !true; {41#false} is VALID [2022-02-20 16:53:56,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {41#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; {41#false} is VALID [2022-02-20 16:53:56,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#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;main_~uneq~0#1 := 5;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_~uneq~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; {41#false} is VALID [2022-02-20 16:53:56,861 INFO L272 TraceCheckUtils]: 12: Hoare triple {41#false} call dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset := node_create(dll_circular_append_~data#1); {52#(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:56,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {52#(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; {40#true} is VALID [2022-02-20 16:53:56,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {40#true} is VALID [2022-02-20 16:53:56,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#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; {40#true} is VALID [2022-02-20 16:53:56,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#true} assume true; {40#true} is VALID [2022-02-20 16:53:56,862 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {40#true} {41#false} #110#return; {41#false} is VALID [2022-02-20 16:53:56,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {41#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); {41#false} is VALID [2022-02-20 16:53:56,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#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); {41#false} is VALID [2022-02-20 16:53:56,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#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; {41#false} is VALID [2022-02-20 16:53:56,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} call main_#t~mem19#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {41#false} is VALID [2022-02-20 16:53:56,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {41#false} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {41#false} is VALID [2022-02-20 16:53:56,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-02-20 16:53:56,864 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:56,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:53:56,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101624719] [2022-02-20 16:53:56,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101624719] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:53:56,865 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:53:56,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:53:56,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047529482] [2022-02-20 16:53:56,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:53:56,870 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:56,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:53:56,873 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:56,897 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:56,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:53:56,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:53:56,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:53:56,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:53:56,917 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 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:57,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:53:57,087 INFO L93 Difference]: Finished difference Result 65 states and 88 transitions. [2022-02-20 16:53:57,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:53:57,088 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:57,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:53:57,089 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:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-02-20 16:53:57,107 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:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-02-20 16:53:57,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2022-02-20 16:53:57,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:53:57,213 INFO L225 Difference]: With dead ends: 65 [2022-02-20 16:53:57,213 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 16:53:57,216 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:57,219 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:53:57,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:53:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 16:53:57,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 16:53:57,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:53:57,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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:57,251 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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:57,252 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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:57,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:53:57,258 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-02-20 16:53:57,263 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-02-20 16:53:57,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:53:57,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:53:57,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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:57,266 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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:57,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:53:57,269 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-02-20 16:53:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-02-20 16:53:57,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:53:57,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:53:57,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:53:57,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:53:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-02-20 16:53:57,273 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 24 [2022-02-20 16:53:57,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:53:57,273 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-02-20 16:53:57,274 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:57,274 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-02-20 16:53:57,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:53:57,274 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:53:57,275 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:57,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:53:57,275 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:53:57,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:53:57,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1735775636, now seen corresponding path program 1 times [2022-02-20 16:53:57,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:53:57,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131632547] [2022-02-20 16:53:57,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:53:57,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:53:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:57,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:53:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:57,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {247#(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; {234#true} is VALID [2022-02-20 16:53:57,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {234#true} is VALID [2022-02-20 16:53:57,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#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; {234#true} is VALID [2022-02-20 16:53:57,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {234#true} assume true; {234#true} is VALID [2022-02-20 16:53:57,357 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {234#true} {236#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} #106#return; {236#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:53:57,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 16:53:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:57,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {247#(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; {234#true} is VALID [2022-02-20 16:53:57,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {234#true} is VALID [2022-02-20 16:53:57,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#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; {234#true} is VALID [2022-02-20 16:53:57,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {234#true} assume true; {234#true} is VALID [2022-02-20 16:53:57,372 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {234#true} {235#false} #110#return; {235#false} is VALID [2022-02-20 16:53:57,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {234#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {234#true} is VALID [2022-02-20 16:53:57,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#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~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~post23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {236#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:53:57,374 INFO L272 TraceCheckUtils]: 2: Hoare triple {236#(= (+ (- 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); {247#(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:57,374 INFO L290 TraceCheckUtils]: 3: Hoare triple {247#(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; {234#true} is VALID [2022-02-20 16:53:57,374 INFO L290 TraceCheckUtils]: 4: Hoare triple {234#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {234#true} is VALID [2022-02-20 16:53:57,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#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; {234#true} is VALID [2022-02-20 16:53:57,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {234#true} assume true; {234#true} is VALID [2022-02-20 16:53:57,375 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {234#true} {236#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} #106#return; {236#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:53:57,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {236#(= (+ (- 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; {236#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:53:57,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {236#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} assume !(dll_circular_create_~len#1 > 1); {235#false} is VALID [2022-02-20 16:53:57,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#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; {235#false} is VALID [2022-02-20 16:53:57,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#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;main_~uneq~0#1 := 5;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_~uneq~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; {235#false} is VALID [2022-02-20 16:53:57,377 INFO L272 TraceCheckUtils]: 12: Hoare triple {235#false} call dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset := node_create(dll_circular_append_~data#1); {247#(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:57,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {247#(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; {234#true} is VALID [2022-02-20 16:53:57,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {234#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {234#true} is VALID [2022-02-20 16:53:57,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {234#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; {234#true} is VALID [2022-02-20 16:53:57,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {234#true} assume true; {234#true} is VALID [2022-02-20 16:53:57,377 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {234#true} {235#false} #110#return; {235#false} is VALID [2022-02-20 16:53:57,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {235#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); {235#false} is VALID [2022-02-20 16:53:57,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {235#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); {235#false} is VALID [2022-02-20 16:53:57,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {235#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; {235#false} is VALID [2022-02-20 16:53:57,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {235#false} call main_#t~mem19#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {235#false} is VALID [2022-02-20 16:53:57,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {235#false} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {235#false} is VALID [2022-02-20 16:53:57,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-02-20 16:53:57,379 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:57,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:53:57,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131632547] [2022-02-20 16:53:57,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131632547] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:53:57,380 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:53:57,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:53:57,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190505494] [2022-02-20 16:53:57,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:53:57,381 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:57,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:53:57,381 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:57,397 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:57,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:53:57,397 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:53:57,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:53:57,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:53:57,398 INFO L87 Difference]: Start difference. First operand 29 states and 36 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:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:53:57,530 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-02-20 16:53:57,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:53:57,530 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:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:53:57,530 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:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-02-20 16:53:57,532 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:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-02-20 16:53:57,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2022-02-20 16:53:57,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:53:57,589 INFO L225 Difference]: With dead ends: 54 [2022-02-20 16:53:57,589 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 16:53:57,589 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:57,590 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:53:57,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 79 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:53:57,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 16:53:57,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-02-20 16:53:57,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:53:57,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 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:53:57,594 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 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:53:57,594 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 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:53:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:53:57,596 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-02-20 16:53:57,596 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-20 16:53:57,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:53:57,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:53:57,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 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 34 states. [2022-02-20 16:53:57,597 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 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 34 states. [2022-02-20 16:53:57,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:53:57,599 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-02-20 16:53:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-20 16:53:57,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:53:57,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:53:57,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:53:57,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:53:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 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:53:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-02-20 16:53:57,602 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 24 [2022-02-20 16:53:57,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:53:57,602 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-02-20 16:53:57,602 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:57,602 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-02-20 16:53:57,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 16:53:57,603 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:53:57,603 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:57,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:53:57,603 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:53:57,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:53:57,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1055008088, now seen corresponding path program 1 times [2022-02-20 16:53:57,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:53:57,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541218510] [2022-02-20 16:53:57,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:53:57,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:53:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:57,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:53:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:57,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {451#(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; {426#true} is VALID [2022-02-20 16:53:57,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {426#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {426#true} is VALID [2022-02-20 16:53:57,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {426#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; {426#true} is VALID [2022-02-20 16:53:57,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {426#true} assume true; {426#true} is VALID [2022-02-20 16:53:57,820 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {426#true} {428#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #106#return; {428#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:53:57,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:53:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:57,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {451#(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; {452#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:53:57,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#(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); {452#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:53:57,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#(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; {453#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:53:57,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {453#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} assume true; {453#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:53:57,864 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {453#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} {428#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #108#return; {439#(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:57,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 16:53:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:57,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {451#(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; {454#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:53:57,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {454#(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); {454#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:53:57,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {454#(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; {455#(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:57,920 INFO L290 TraceCheckUtils]: 3: Hoare triple {455#(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; {455#(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:57,922 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {455#(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|)))))} {443#(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|))} #110#return; {449#(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:57,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {426#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {426#true} is VALID [2022-02-20 16:53:57,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {426#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~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~post23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {428#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:53:57,924 INFO L272 TraceCheckUtils]: 2: Hoare triple {428#(<= (+ |#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); {451#(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:57,924 INFO L290 TraceCheckUtils]: 3: Hoare triple {451#(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; {426#true} is VALID [2022-02-20 16:53:57,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {426#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {426#true} is VALID [2022-02-20 16:53:57,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {426#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; {426#true} is VALID [2022-02-20 16:53:57,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {426#true} assume true; {426#true} is VALID [2022-02-20 16:53:57,925 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {426#true} {428#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #106#return; {428#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:53:57,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {428#(<= (+ |#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; {428#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:53:57,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {428#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !!(dll_circular_create_~len#1 > 1); {428#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:53:57,927 INFO L272 TraceCheckUtils]: 10: Hoare triple {428#(<= (+ |#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); {451#(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:57,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {451#(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; {452#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:53:57,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {452#(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); {452#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:53:57,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#(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; {453#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:53:57,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {453#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} assume true; {453#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:53:57,930 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {453#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} {428#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #108#return; {439#(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:57,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {439#(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); {440#(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:57,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {440#(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); {440#(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:57,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {440#(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; {441#(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:57,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {441#(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); {441#(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:57,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {441#(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; {442#(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:57,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {442#(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;main_~uneq~0#1 := 5;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_~uneq~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; {443#(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:57,935 INFO L272 TraceCheckUtils]: 22: Hoare triple {443#(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); {451#(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:57,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {451#(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; {454#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:53:57,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {454#(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); {454#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:53:57,937 INFO L290 TraceCheckUtils]: 25: Hoare triple {454#(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; {455#(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:57,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {455#(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; {455#(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:57,939 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {455#(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|)))))} {443#(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|))} #110#return; {449#(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:57,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {449#(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); {450#(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:57,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {450#(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); {427#false} is VALID [2022-02-20 16:53:57,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {427#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; {427#false} is VALID [2022-02-20 16:53:57,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {427#false} call main_#t~mem19#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {427#false} is VALID [2022-02-20 16:53:57,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {427#false} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {427#false} is VALID [2022-02-20 16:53:57,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {427#false} assume !false; {427#false} is VALID [2022-02-20 16:53:57,942 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:57,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:53:57,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541218510] [2022-02-20 16:53:57,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541218510] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:53:57,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83111992] [2022-02-20 16:53:57,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:53:57,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:53:57,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:53:57,944 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:57,945 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:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:58,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 38 conjunts are in the unsatisfiable core [2022-02-20 16:53:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:53:58,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:53:58,487 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:58,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:53:58,598 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:58,655 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:58,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {426#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {426#true} is VALID [2022-02-20 16:53:58,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {426#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~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~post23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {462#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:53:58,683 INFO L272 TraceCheckUtils]: 2: Hoare triple {462#(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); {426#true} is VALID [2022-02-20 16:53:58,684 INFO L290 TraceCheckUtils]: 3: Hoare triple {426#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; {426#true} is VALID [2022-02-20 16:53:58,684 INFO L290 TraceCheckUtils]: 4: Hoare triple {426#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {426#true} is VALID [2022-02-20 16:53:58,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {426#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; {426#true} is VALID [2022-02-20 16:53:58,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {426#true} assume true; {426#true} is VALID [2022-02-20 16:53:58,685 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {426#true} {462#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} #106#return; {462#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:53:58,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {462#(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; {462#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:53:58,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {462#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(dll_circular_create_~len#1 > 1); {462#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:53:58,686 INFO L272 TraceCheckUtils]: 10: Hoare triple {462#(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); {426#true} is VALID [2022-02-20 16:53:58,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {426#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; {452#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:53:58,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {452#(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); {452#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:53:58,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#(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; {453#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:53:58,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {453#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} assume true; {453#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:53:58,689 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {453#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} {462#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} #108#return; {505#(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:58,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {505#(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); {509#(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:58,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {509#(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); {509#(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:58,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {509#(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; {516#(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:58,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {516#(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); {516#(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:58,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {516#(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; {523#(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:58,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {523#(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;main_~uneq~0#1 := 5;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_~uneq~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; {527#(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:58,694 INFO L272 TraceCheckUtils]: 22: Hoare triple {527#(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); {531#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)} is VALID [2022-02-20 16:53:58,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {531#(= |#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; {454#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:53:58,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {454#(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); {454#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:53:58,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {454#(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; {541#(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:58,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {541#(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; {541#(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:58,698 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {541#(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|))} {527#(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))} #110#return; {548#(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:58,698 INFO L290 TraceCheckUtils]: 28: Hoare triple {548#(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); {552#(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:58,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {552#(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); {427#false} is VALID [2022-02-20 16:53:58,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {427#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; {427#false} is VALID [2022-02-20 16:53:58,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {427#false} call main_#t~mem19#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {427#false} is VALID [2022-02-20 16:53:58,700 INFO L290 TraceCheckUtils]: 32: Hoare triple {427#false} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {427#false} is VALID [2022-02-20 16:53:58,700 INFO L290 TraceCheckUtils]: 33: Hoare triple {427#false} assume !false; {427#false} is VALID [2022-02-20 16:53:58,700 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:58,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:53:58,913 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:58,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83111992] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:53:58,916 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:53:58,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-02-20 16:53:58,916 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196210514] [2022-02-20 16:53:58,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:53:58,917 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:58,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:53:58,918 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:58,966 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:58,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 16:53:58,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:53:58,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 16:53:58,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=572, Unknown=1, NotChecked=48, Total=702 [2022-02-20 16:53:58,967 INFO L87 Difference]: Start difference. First operand 30 states and 37 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:54:00,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:00,039 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-02-20 16:54:00,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 16:54:00,039 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:54:00,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:00,040 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:54:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions. [2022-02-20 16:54:00,042 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:54:00,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions. [2022-02-20 16:54:00,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 51 transitions. [2022-02-20 16:54:00,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:00,085 INFO L225 Difference]: With dead ends: 41 [2022-02-20 16:54:00,085 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 16:54:00,086 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=920, Unknown=1, NotChecked=62, Total=1122 [2022-02-20 16:54:00,087 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 29 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:00,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 274 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 211 Invalid, 0 Unknown, 10 Unchecked, 0.4s Time] [2022-02-20 16:54:00,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 16:54:00,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-02-20 16:54:00,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:00,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:00,104 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:00,104 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:00,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:00,105 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-20 16:54:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-02-20 16:54:00,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:00,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:00,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:00,106 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:00,108 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-20 16:54:00,108 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-02-20 16:54:00,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:00,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:00,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:00,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-20 16:54:00,110 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 34 [2022-02-20 16:54:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:00,110 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-20 16:54:00,110 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:54:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:54:00,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 16:54:00,111 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:00,111 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:00,131 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:54:00,326 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:54:00,326 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:00,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:00,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1053161046, now seen corresponding path program 1 times [2022-02-20 16:54:00,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:00,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183437172] [2022-02-20 16:54:00,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:00,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:01,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:54:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:01,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {789#(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; {790#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 16:54:01,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {790#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 16:54:01,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|))} 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; {791#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:01,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {791#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {791#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:01,102 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {791#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} {760#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #106#return; {766#(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) (not (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:54:01,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:54:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:01,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {789#(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; {792#(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:54:01,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {792#(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); {792#(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:54:01,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {792#(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; {793#(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:54:01,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {793#(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; {793#(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:54:01,212 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {793#(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))} {767#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (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_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} #108#return; {773#(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) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 16:54:01,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 16:54:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:01,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {789#(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; {794#(and (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= 1 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 16:54:01,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {794#(and (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= 1 (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {794#(and (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= 1 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 16:54:01,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {794#(and (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= 1 (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; {795#(and (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|)))) (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:54:01,426 INFO L290 TraceCheckUtils]: 3: Hoare triple {795#(and (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|)))) (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; {795#(and (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|)))) (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:54:01,429 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {795#(and (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|)))) (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|)))))} {778#(and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| (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$.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|) (<= (+ |#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|))))} #110#return; {784#(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|)) (= |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_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)) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| (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|))))))} is VALID [2022-02-20 16:54:01,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {758#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {758#true} is VALID [2022-02-20 16:54:01,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {758#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~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~post23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_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; {760#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |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:54:01,431 INFO L272 TraceCheckUtils]: 2: Hoare triple {760#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |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); {789#(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:54:01,431 INFO L290 TraceCheckUtils]: 3: Hoare triple {789#(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; {790#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 16:54:01,432 INFO L290 TraceCheckUtils]: 4: Hoare triple {790#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {790#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 16:54:01,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|))} 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; {791#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:01,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {791#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {791#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:01,434 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {791#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} {760#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #106#return; {766#(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) (not (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:54:01,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {766#(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) (not (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.base| |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; {767#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (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_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:54:01,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {767#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (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_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!(dll_circular_create_~len#1 > 1); {767#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (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_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:54:01,442 INFO L272 TraceCheckUtils]: 10: Hoare triple {767#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (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_~last~0#1.base| |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); {789#(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:54:01,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {789#(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; {792#(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:54:01,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {792#(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); {792#(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:54:01,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {792#(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; {793#(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:54:01,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {793#(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; {793#(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:54:01,446 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {793#(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))} {767#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (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_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} #108#return; {773#(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) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 16:54:01,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#(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) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~last~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); {774#(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|)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~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:54:01,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {774#(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|)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~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); {775#(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|)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~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:54:01,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {775#(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|)) (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |ULTIMATE.start_main_~#s~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; {776#(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|)) (not (= |ULTIMATE.start_dll_circular_create_~last~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:54:01,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {776#(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|)) (not (= |ULTIMATE.start_dll_circular_create_~last~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); {776#(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|)) (not (= |ULTIMATE.start_dll_circular_create_~last~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:54:01,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {776#(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|)) (not (= |ULTIMATE.start_dll_circular_create_~last~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; {777#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#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:54:01,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {777#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#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;main_~uneq~0#1 := 5;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_~uneq~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; {778#(and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| (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$.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|) (<= (+ |#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:54:01,456 INFO L272 TraceCheckUtils]: 22: Hoare triple {778#(and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| (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$.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|) (<= (+ |#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); {789#(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:54:01,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {789#(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; {794#(and (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= 1 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 16:54:01,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {794#(and (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= 1 (select |old(#valid)| |node_create_~temp~0#1.base|))))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {794#(and (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= 1 (select |old(#valid)| |node_create_~temp~0#1.base|))))} is VALID [2022-02-20 16:54:01,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {794#(and (= |#memory_int| |old(#memory_int)|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (not (= 1 (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; {795#(and (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|)))) (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:54:01,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {795#(and (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|)))) (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; {795#(and (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|)))) (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:54:01,463 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {795#(and (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|)))) (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|)))))} {778#(and (= |ULTIMATE.start_dll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| (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$.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|) (<= (+ |#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|))))} #110#return; {784#(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|)) (= |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_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)) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| (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|))))))} is VALID [2022-02-20 16:54:01,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {784#(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|)) (= |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_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)) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| (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|))))))} 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); {785#(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_~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)) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| (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|))))))} is VALID [2022-02-20 16:54:01,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {785#(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_~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)) (not (= |ULTIMATE.start_dll_circular_append_~head#1.base| (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|))))))} 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; {786#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (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|))} is VALID [2022-02-20 16:54:01,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {786#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (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|))} 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; {787#(= (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:54:01,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {787#(= (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~mem19#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {788#(= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_main_#t~mem19#1|)} is VALID [2022-02-20 16:54:01,468 INFO L290 TraceCheckUtils]: 32: Hoare triple {788#(= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_main_#t~mem19#1|)} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {759#false} is VALID [2022-02-20 16:54:01,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {759#false} assume !false; {759#false} is VALID [2022-02-20 16:54:01,469 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:54:01,469 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:01,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183437172] [2022-02-20 16:54:01,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183437172] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:01,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272513964] [2022-02-20 16:54:01,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:01,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:01,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:01,488 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:54:01,517 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:54:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:02,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 211 conjunts are in the unsatisfiable core [2022-02-20 16:54:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:02,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:02,942 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:03,007 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:03,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:03,140 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:03,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:03,378 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:03,457 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:03,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:03,597 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-02-20 16:54:03,597 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:03,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:03,751 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:03,862 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:04,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:04,181 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:04,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:04,215 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:04,241 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:04,264 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:04,548 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:54:04,549 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:04,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:04,617 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:04,680 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:04,704 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:05,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:05,043 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-02-20 16:54:05,043 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:05,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:05,062 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:05,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:05,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:05,085 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-02-20 16:54:05,085 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:05,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:05,115 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:05,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:05,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:54:05,624 INFO L356 Elim1Store]: treesize reduction 103, result has 14.9 percent of original size [2022-02-20 16:54:05,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 427 treesize of output 153 [2022-02-20 16:54:05,687 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 16:54:05,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 16:54:05,903 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:05,904 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_1 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:05,908 INFO L158 Benchmark]: Toolchain (without parser) took 10398.96ms. Allocated memory was 86.0MB in the beginning and 192.9MB in the end (delta: 107.0MB). Free memory was 49.6MB in the beginning and 72.3MB in the end (delta: -22.7MB). Peak memory consumption was 101.7MB. Max. memory is 16.1GB. [2022-02-20 16:54:05,908 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory was 58.8MB in the beginning and 58.8MB in the end (delta: 28.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:54:05,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.45ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 49.4MB in the beginning and 74.0MB in the end (delta: -24.7MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2022-02-20 16:54:05,909 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.82ms. Allocated memory is still 109.1MB. Free memory was 74.0MB in the beginning and 71.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:54:05,909 INFO L158 Benchmark]: Boogie Preprocessor took 45.76ms. Allocated memory is still 109.1MB. Free memory was 71.6MB in the beginning and 69.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:54:05,909 INFO L158 Benchmark]: RCFGBuilder took 443.20ms. Allocated memory is still 109.1MB. Free memory was 69.1MB in the beginning and 78.2MB in the end (delta: -9.1MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2022-02-20 16:54:05,909 INFO L158 Benchmark]: TraceAbstraction took 9436.58ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 78.2MB in the beginning and 72.3MB in the end (delta: 5.8MB). Peak memory consumption was 108.4MB. Max. memory is 16.1GB. [2022-02-20 16:54:05,911 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.17ms. Allocated memory is still 86.0MB. Free memory was 58.8MB in the beginning and 58.8MB in the end (delta: 28.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.45ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 49.4MB in the beginning and 74.0MB in the end (delta: -24.7MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.82ms. Allocated memory is still 109.1MB. Free memory was 74.0MB in the beginning and 71.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.76ms. Allocated memory is still 109.1MB. Free memory was 71.6MB in the beginning and 69.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 443.20ms. Allocated memory is still 109.1MB. Free memory was 69.1MB in the beginning and 78.2MB in the end (delta: -9.1MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9436.58ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 78.2MB in the beginning and 72.3MB in the end (delta: 5.8MB). Peak memory consumption was 108.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_1: 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:05,938 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_unequal.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 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:54:07,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:54:07,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:54:07,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:54:07,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:54:07,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:54:07,683 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:54:07,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:54:07,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:54:07,692 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:54:07,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:54:07,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:54:07,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:54:07,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:54:07,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:54:07,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:54:07,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:54:07,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:54:07,696 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:54:07,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:54:07,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:54:07,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:54:07,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:54:07,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:54:07,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:54:07,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:54:07,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:54:07,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:54:07,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:54:07,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:54:07,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:54:07,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:54:07,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:54:07,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:54:07,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:54:07,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:54:07,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:54:07,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:54:07,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:54:07,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:54:07,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:54:07,732 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:07,751 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:54:07,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:54:07,751 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:54:07,751 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:54:07,752 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:54:07,752 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:54:07,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:54:07,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:54:07,752 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:54:07,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:54:07,752 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:54:07,752 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:54:07,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:54:07,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:54:07,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:54:07,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:54:07,753 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:54:07,753 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:54:07,753 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:54:07,753 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:54:07,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:54:07,753 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:54:07,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:54:07,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:54:07,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:54:07,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:54:07,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:54:07,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:54:07,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:54:07,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:54:07,754 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:54:07,754 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:54:07,754 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:54:07,754 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:54:07,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:54:07,755 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:54:07,755 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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2022-02-20 16:54:08,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:54:08,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:54:08,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:54:08,038 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:54:08,047 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:54:08,048 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2022-02-20 16:54:08,117 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeb06663c/2b0f2f4dd62b462a8e34996a3d572115/FLAGc15c27ae3 [2022-02-20 16:54:08,550 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:54:08,550 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2022-02-20 16:54:08,566 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeb06663c/2b0f2f4dd62b462a8e34996a3d572115/FLAGc15c27ae3 [2022-02-20 16:54:08,577 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeb06663c/2b0f2f4dd62b462a8e34996a3d572115 [2022-02-20 16:54:08,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:54:08,579 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:54:08,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:54:08,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:54:08,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:54:08,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:54:08" (1/1) ... [2022-02-20 16:54:08,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e1bc98f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:08, skipping insertion in model container [2022-02-20 16:54:08,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:54:08" (1/1) ... [2022-02-20 16:54:08,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:54:08,636 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:54:08,903 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_unequal.i[24672,24685] [2022-02-20 16:54:08,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:54:08,922 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:54:08,977 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_unequal.i[24672,24685] [2022-02-20 16:54:08,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:54:08,996 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:54:08,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:08 WrapperNode [2022-02-20 16:54:08,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:54:08,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:54:08,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:54:08,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:54:09,004 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:08" (1/1) ... [2022-02-20 16:54:09,017 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:08" (1/1) ... [2022-02-20 16:54:09,038 INFO L137 Inliner]: procedures = 130, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 147 [2022-02-20 16:54:09,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:54:09,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:54:09,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:54:09,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:54:09,047 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:08" (1/1) ... [2022-02-20 16:54:09,047 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:08" (1/1) ... [2022-02-20 16:54:09,051 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:08" (1/1) ... [2022-02-20 16:54:09,051 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:08" (1/1) ... [2022-02-20 16:54:09,061 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:08" (1/1) ... [2022-02-20 16:54:09,071 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:08" (1/1) ... [2022-02-20 16:54:09,073 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:08" (1/1) ... [2022-02-20 16:54:09,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:54:09,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:54:09,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:54:09,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:54:09,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:08" (1/1) ... [2022-02-20 16:54:09,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:54:09,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:09,101 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:09,121 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:09,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:54:09,143 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 16:54:09,143 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 16:54:09,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:54:09,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:54:09,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:54:09,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:54:09,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:54:09,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:54:09,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:54:09,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 16:54:09,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:54:09,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:54:09,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:54:09,253 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:54:09,255 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:54:09,726 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:54:09,731 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:54:09,733 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 16:54:09,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:54:09 BoogieIcfgContainer [2022-02-20 16:54:09,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:54:09,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:54:09,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:54:09,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:54:09,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:54:08" (1/3) ... [2022-02-20 16:54:09,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a8c5f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:54:09, skipping insertion in model container [2022-02-20 16:54:09,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:08" (2/3) ... [2022-02-20 16:54:09,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a8c5f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:54:09, skipping insertion in model container [2022-02-20 16:54:09,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:54:09" (3/3) ... [2022-02-20 16:54:09,740 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2022-02-20 16:54:09,751 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:54:09,754 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:54:09,788 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:54:09,792 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:09,792 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:54:09,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 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,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:54:09,808 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:09,808 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,809 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:09,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:09,815 INFO L85 PathProgramCache]: Analyzing trace with hash -140887327, now seen corresponding path program 1 times [2022-02-20 16:54:09,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:09,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534540593] [2022-02-20 16:54:09,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:09,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:09,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:09,838 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:09,839 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:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:10,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:54:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:10,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:10,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {40#true} is VALID [2022-02-20 16:54:10,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#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~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~post23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_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; {40#true} is VALID [2022-02-20 16:54:10,110 INFO L272 TraceCheckUtils]: 2: Hoare triple {40#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {40#true} is VALID [2022-02-20 16:54:10,110 INFO L290 TraceCheckUtils]: 3: Hoare triple {40#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; {40#true} is VALID [2022-02-20 16:54:10,111 INFO L290 TraceCheckUtils]: 4: Hoare triple {40#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {40#true} is VALID [2022-02-20 16:54:10,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#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; {40#true} is VALID [2022-02-20 16:54:10,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {40#true} assume true; {40#true} is VALID [2022-02-20 16:54:10,111 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {40#true} {40#true} #106#return; {40#true} is VALID [2022-02-20 16:54:10,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#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; {40#true} is VALID [2022-02-20 16:54:10,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume !true; {41#false} is VALID [2022-02-20 16:54:10,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {41#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; {41#false} is VALID [2022-02-20 16:54:10,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#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;main_~uneq~0#1 := 5bv32;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_~uneq~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; {41#false} is VALID [2022-02-20 16:54:10,113 INFO L272 TraceCheckUtils]: 12: Hoare triple {41#false} call dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset := node_create(dll_circular_append_~data#1); {41#false} is VALID [2022-02-20 16:54:10,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#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; {41#false} is VALID [2022-02-20 16:54:10,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {41#false} is VALID [2022-02-20 16:54:10,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#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; {41#false} is VALID [2022-02-20 16:54:10,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume true; {41#false} is VALID [2022-02-20 16:54:10,114 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {41#false} {41#false} #110#return; {41#false} is VALID [2022-02-20 16:54:10,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {41#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); {41#false} is VALID [2022-02-20 16:54:10,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#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); {41#false} is VALID [2022-02-20 16:54:10,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#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; {41#false} is VALID [2022-02-20 16:54:10,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} call main_#t~mem19#1 := read~intINTTYPE4(main_~ptr~0#1.base, ~bvadd32(8bv32, main_~ptr~0#1.offset), 4bv32); {41#false} is VALID [2022-02-20 16:54:10,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {41#false} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {41#false} is VALID [2022-02-20 16:54:10,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-02-20 16:54:10,122 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:10,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:54:10,122 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:10,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534540593] [2022-02-20 16:54:10,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534540593] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:10,123 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:10,123 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:54:10,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833108151] [2022-02-20 16:54:10,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:10,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 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:10,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:10,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 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,167 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:10,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:54:10,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:54:10,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:54:10,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:54:10,188 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 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 10.0) internal successors, (20), 2 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,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:10,367 INFO L93 Difference]: Finished difference Result 65 states and 88 transitions. [2022-02-20 16:54:10,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:54:10,367 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 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:10,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:10,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 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,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 88 transitions. [2022-02-20 16:54:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 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,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 88 transitions. [2022-02-20 16:54:10,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 88 transitions. [2022-02-20 16:54:10,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:10,480 INFO L225 Difference]: With dead ends: 65 [2022-02-20 16:54:10,481 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 16:54:10,483 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:10,485 INFO L933 BasicCegarLoop]: 47 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, 47 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:10,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 47 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:10,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 16:54:10,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 16:54:10,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:10,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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,514 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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,515 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:10,518 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-02-20 16:54:10,518 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-02-20 16:54:10,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:10,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:10,519 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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:54:10,519 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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:54:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:10,524 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-02-20 16:54:10,524 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-02-20 16:54:10,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:10,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:10,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:10,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:10,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-02-20 16:54:10,533 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 24 [2022-02-20 16:54:10,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:10,534 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-02-20 16:54:10,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 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,535 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-02-20 16:54:10,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:54:10,536 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:10,536 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:10,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:54:10,744 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:10,745 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:10,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:10,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1735775636, now seen corresponding path program 1 times [2022-02-20 16:54:10,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:10,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847083618] [2022-02-20 16:54:10,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:10,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:10,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:10,751 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:10,752 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:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:10,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:54:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:10,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:10,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {292#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {292#true} is VALID [2022-02-20 16:54:10,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#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~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~post23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_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; {300#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:54:10,994 INFO L272 TraceCheckUtils]: 2: Hoare triple {300#(= |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); {292#true} is VALID [2022-02-20 16:54:10,995 INFO L290 TraceCheckUtils]: 3: Hoare triple {292#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; {292#true} is VALID [2022-02-20 16:54:10,995 INFO L290 TraceCheckUtils]: 4: Hoare triple {292#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {292#true} is VALID [2022-02-20 16:54:10,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#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; {292#true} is VALID [2022-02-20 16:54:10,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {292#true} assume true; {292#true} is VALID [2022-02-20 16:54:10,996 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {292#true} {300#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} #106#return; {300#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:54:10,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {300#(= |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; {300#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:54:10,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {300#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {293#false} is VALID [2022-02-20 16:54:10,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {293#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; {293#false} is VALID [2022-02-20 16:54:10,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {293#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;main_~uneq~0#1 := 5bv32;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_~uneq~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; {293#false} is VALID [2022-02-20 16:54:10,997 INFO L272 TraceCheckUtils]: 12: Hoare triple {293#false} call dll_circular_append_#t~ret9#1.base, dll_circular_append_#t~ret9#1.offset := node_create(dll_circular_append_~data#1); {293#false} is VALID [2022-02-20 16:54:10,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {293#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; {293#false} is VALID [2022-02-20 16:54:10,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {293#false} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {293#false} is VALID [2022-02-20 16:54:10,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {293#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; {293#false} is VALID [2022-02-20 16:54:10,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {293#false} assume true; {293#false} is VALID [2022-02-20 16:54:10,998 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {293#false} {293#false} #110#return; {293#false} is VALID [2022-02-20 16:54:10,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {293#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); {293#false} is VALID [2022-02-20 16:54:10,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {293#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); {293#false} is VALID [2022-02-20 16:54:10,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {293#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; {293#false} is VALID [2022-02-20 16:54:10,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {293#false} call main_#t~mem19#1 := read~intINTTYPE4(main_~ptr~0#1.base, ~bvadd32(8bv32, main_~ptr~0#1.offset), 4bv32); {293#false} is VALID [2022-02-20 16:54:10,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {293#false} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {293#false} is VALID [2022-02-20 16:54:10,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {293#false} assume !false; {293#false} is VALID [2022-02-20 16:54:10,999 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:10,999 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:54:11,000 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:11,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847083618] [2022-02-20 16:54:11,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847083618] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:11,000 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:11,000 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:54:11,000 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841111981] [2022-02-20 16:54:11,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:11,001 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:11,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:11,002 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:11,027 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:11,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:54:11,027 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:54:11,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:54:11,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:54:11,028 INFO L87 Difference]: Start difference. First operand 29 states and 36 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:11,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:11,308 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-02-20 16:54:11,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:54:11,308 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:11,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:11,308 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:11,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-02-20 16:54:11,310 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:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-02-20 16:54:11,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 67 transitions. [2022-02-20 16:54:11,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:11,391 INFO L225 Difference]: With dead ends: 54 [2022-02-20 16:54:11,391 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 16:54:11,391 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:11,392 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 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:11,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 65 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:11,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 16:54:11,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-02-20 16:54:11,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:11,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 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:11,396 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 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:11,396 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 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:11,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:11,398 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-02-20 16:54:11,398 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-20 16:54:11,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:11,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:11,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 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 34 states. [2022-02-20 16:54:11,400 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 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 34 states. [2022-02-20 16:54:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:11,407 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-02-20 16:54:11,407 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-20 16:54:11,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:11,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:11,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:11,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 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:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-02-20 16:54:11,414 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 24 [2022-02-20 16:54:11,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:11,414 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-02-20 16:54:11,414 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:11,416 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-02-20 16:54:11,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 16:54:11,419 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:11,419 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:11,432 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:11,629 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:11,629 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:11,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:11,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1055008088, now seen corresponding path program 1 times [2022-02-20 16:54:11,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:11,631 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627609478] [2022-02-20 16:54:11,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:11,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:11,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:11,632 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:11,634 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:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:11,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 16:54:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:11,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:12,156 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:12,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:12,326 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:12,423 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:12,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {542#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {542#true} is VALID [2022-02-20 16:54:12,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#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~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~post23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_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; {550#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:54:12,457 INFO L272 TraceCheckUtils]: 2: Hoare triple {550#(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); {554#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:12,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {554#(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; {554#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:12,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {554#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {554#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:12,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(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; {554#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:12,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {554#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume true; {554#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:12,460 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {554#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} {550#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} #106#return; {550#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:54:12,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {550#(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; {550#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:54:12,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {550#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {550#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:54:12,461 INFO L272 TraceCheckUtils]: 10: Hoare triple {550#(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); {554#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:12,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {554#(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; {582#(and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:12,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {582#(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); {582#(and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:12,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {582#(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; {589#(and (not (= |node_create_#res#1.base| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:12,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {589#(and (not (= |node_create_#res#1.base| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {589#(and (not (= |node_create_#res#1.base| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:12,465 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {589#(and (not (= |node_create_#res#1.base| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {550#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} #108#return; {596#(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:12,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {596#(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); {600#(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:12,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {600#(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); {600#(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:12,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {600#(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; {607#(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:12,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {607#(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); {607#(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:12,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {607#(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; {614#(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:12,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {614#(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;main_~uneq~0#1 := 5bv32;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_~uneq~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; {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))) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_circular_append_~head#1.base|))} is VALID [2022-02-20 16:54:12,470 INFO L272 TraceCheckUtils]: 22: 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))) (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); {622#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:54:12,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {622#(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; {626#(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:12,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {626#(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); {626#(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:12,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {626#(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; {633#(and (exists ((v_ArrVal_245 (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_245) |#memory_$Pointer$.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:12,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {633#(and (exists ((v_ArrVal_245 (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_245) |#memory_$Pointer$.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {633#(and (exists ((v_ArrVal_245 (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_245) |#memory_$Pointer$.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:12,490 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {633#(and (exists ((v_ArrVal_245 (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_245) |#memory_$Pointer$.base|) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {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))) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_circular_append_~head#1.base|))} #110#return; {640#(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:12,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {640#(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); {644#(not (= |ULTIMATE.start_dll_circular_append_#t~mem10#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:54:12,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {644#(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); {543#false} is VALID [2022-02-20 16:54:12,491 INFO L290 TraceCheckUtils]: 30: Hoare triple {543#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; {543#false} is VALID [2022-02-20 16:54:12,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {543#false} call main_#t~mem19#1 := read~intINTTYPE4(main_~ptr~0#1.base, ~bvadd32(8bv32, main_~ptr~0#1.offset), 4bv32); {543#false} is VALID [2022-02-20 16:54:12,491 INFO L290 TraceCheckUtils]: 32: Hoare triple {543#false} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {543#false} is VALID [2022-02-20 16:54:12,492 INFO L290 TraceCheckUtils]: 33: Hoare triple {543#false} assume !false; {543#false} is VALID [2022-02-20 16:54:12,492 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:12,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:54:12,637 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:12,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627609478] [2022-02-20 16:54:12,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627609478] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:12,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [848459213] [2022-02-20 16:54:12,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:12,637 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 16:54:12,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 16:54:12,667 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:12,686 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:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:12,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 16:54:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:12,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:13,355 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:13,402 WARN L860 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_349))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|)) is different from true [2022-02-20 16:54:13,478 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 16:54:13,479 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 15 treesize of output 21 [2022-02-20 16:54:13,582 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:13,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {542#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(23bv32, 2bv32); {542#true} is VALID [2022-02-20 16:54:13,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#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~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem22#1, main_#t~post23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_dll_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; {686#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 16:54:13,600 INFO L272 TraceCheckUtils]: 2: Hoare triple {686#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {554#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:13,602 INFO L290 TraceCheckUtils]: 3: Hoare triple {554#(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; {554#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:13,602 INFO L290 TraceCheckUtils]: 4: Hoare triple {554#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {554#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:13,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(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; {554#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:13,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {554#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume true; {554#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:13,604 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {554#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} {686#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} #106#return; {686#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 16:54:13,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {686#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 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; {686#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 16:54:13,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {686#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {686#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 16:54:13,605 INFO L272 TraceCheckUtils]: 10: Hoare triple {686#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {554#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:54:13,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {554#(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; {582#(and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:13,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {582#(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); {582#(and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:13,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {582#(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; {589#(and (not (= |node_create_#res#1.base| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:13,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {589#(and (not (= |node_create_#res#1.base| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {589#(and (not (= |node_create_#res#1.base| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:13,608 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {589#(and (not (= |node_create_#res#1.base| (_ bv0 32))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {686#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)))} #108#return; {729#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| (_ bv0 32))))} is VALID [2022-02-20 16:54:13,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {729#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (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); {733#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))} is VALID [2022-02-20 16:54:13,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {733#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (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); {733#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))} is VALID [2022-02-20 16:54:13,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {733#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (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; {740#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 16:54:13,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {740#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32))))} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {740#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 16:54:13,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {740#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (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; {747#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= (_ bv0 32) |ULTIMATE.start_dll_circular_create_#res#1.base|)))} is VALID [2022-02-20 16:54:13,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {747#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (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;main_~uneq~0#1 := 5bv32;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_~uneq~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; {751#(and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) (_ bv0 32)))) (= |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:13,614 INFO L272 TraceCheckUtils]: 22: Hoare triple {751#(and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) (_ bv0 32)))) (= |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); {622#(and (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:54:13,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {622#(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; {626#(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:13,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {626#(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); {626#(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:13,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {626#(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; {764#(and (exists ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_349) |#memory_$Pointer$.base|)) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:13,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {764#(and (exists ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_349) |#memory_$Pointer$.base|)) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {764#(and (exists ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_349) |#memory_$Pointer$.base|)) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:54:13,643 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {764#(and (exists ((v_ArrVal_349 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_349) |#memory_$Pointer$.base|)) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {751#(and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) (_ bv0 32)))) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| (_ bv0 32)) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_circular_append_~head#1.base|))} #110#return; {771#(and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) (_ bv0 32)))) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_circular_append_~head#1.base|))) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| (_ bv0 32)))} is VALID [2022-02-20 16:54:13,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {771#(and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~head#1.base|) (_ bv0 32)))) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |ULTIMATE.start_dll_circular_append_#t~ret9#1.base| |#StackHeapBarrier|) (bvult |#StackHeapBarrier| |ULTIMATE.start_dll_circular_append_~head#1.base|))) (= |ULTIMATE.start_dll_circular_append_~head#1.offset| (_ bv0 32)))} 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); {644#(not (= |ULTIMATE.start_dll_circular_append_#t~mem10#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:54:13,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {644#(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); {543#false} is VALID [2022-02-20 16:54:13,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {543#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; {543#false} is VALID [2022-02-20 16:54:13,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {543#false} call main_#t~mem19#1 := read~intINTTYPE4(main_~ptr~0#1.base, ~bvadd32(8bv32, main_~ptr~0#1.offset), 4bv32); {543#false} is VALID [2022-02-20 16:54:13,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {543#false} assume main_~data~0#1 != main_#t~mem19#1;havoc main_#t~mem19#1; {543#false} is VALID [2022-02-20 16:54:13,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {543#false} assume !false; {543#false} is VALID [2022-02-20 16:54:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-02-20 16:54:13,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:54:13,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [848459213] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:13,768 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:54:13,768 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-02-20 16:54:13,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549229506] [2022-02-20 16:54:13,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:54:13,769 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 19 states have internal predecessors, (40), 4 states have call successors, (6), 2 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:54:13,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:13,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 19 states have internal predecessors, (40), 4 states have call successors, (6), 2 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:54:13,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:13,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-20 16:54:13,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:54:13,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-20 16:54:13,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=502, Unknown=10, NotChecked=46, Total=650 [2022-02-20 16:54:13,880 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 24 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 19 states have internal predecessors, (40), 4 states have call successors, (6), 2 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:54:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:16,055 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-02-20 16:54:16,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 16:54:16,055 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 19 states have internal predecessors, (40), 4 states have call successors, (6), 2 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:54:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 19 states have internal predecessors, (40), 4 states have call successors, (6), 2 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:54:16,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions. [2022-02-20 16:54:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 19 states have internal predecessors, (40), 4 states have call successors, (6), 2 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:54:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions. [2022-02-20 16:54:16,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 51 transitions. [2022-02-20 16:54:16,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:16,144 INFO L225 Difference]: With dead ends: 41 [2022-02-20 16:54:16,144 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 16:54:16,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=720, Unknown=12, NotChecked=56, Total=930 [2022-02-20 16:54:16,146 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:16,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 186 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 147 Invalid, 0 Unknown, 61 Unchecked, 0.9s Time] [2022-02-20 16:54:16,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 16:54:16,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-02-20 16:54:16,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:16,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:16,149 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:16,149 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:16,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:16,150 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-20 16:54:16,150 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-02-20 16:54:16,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:16,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:16,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:16,151 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:16,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:16,152 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-02-20 16:54:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-02-20 16:54:16,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:16,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:16,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:16,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:16,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-20 16:54:16,154 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 34 [2022-02-20 16:54:16,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:16,154 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-20 16:54:16,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 19 states have internal predecessors, (40), 4 states have call successors, (6), 2 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:54:16,154 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:54:16,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 16:54:16,155 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:16,155 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:16,165 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:16,373 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:16,567 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:16,567 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:16,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:16,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1053161046, now seen corresponding path program 1 times [2022-02-20 16:54:16,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:16,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791311935] [2022-02-20 16:54:16,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:16,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:16,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:16,570 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:16,571 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:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:17,293 WARN L261 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 242 conjunts are in the unsatisfiable core [2022-02-20 16:54:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:17,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:17,443 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:17,466 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:17,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:17,618 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 17 treesize of output 17 [2022-02-20 16:54:17,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:17,763 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:17,883 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:18,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:18,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:18,046 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 16:54:18,046 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 22 treesize of output 32 [2022-02-20 16:54:18,171 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:18,288 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:18,574 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:18,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:18,600 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:18,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:18,622 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:18,645 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:18,660 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:18,949 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 16:54:18,950 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 71 treesize of output 34 [2022-02-20 16:54:18,973 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,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:18,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:19,000 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 19 treesize of output 13 [2022-02-20 16:54:19,025 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,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:19,925 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-02-20 16:54:19,925 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:19,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:19,952 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,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:19,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:20,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:20,028 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-02-20 16:54:20,029 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 36 treesize of output 36 [2022-02-20 16:54:20,297 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 16:54:20,298 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-02-20 16:54:20,311 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:21,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:21,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:21,267 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:21,267 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791311935] [2022-02-20 16:54:21,267 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 16:54:21,321 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:21,477 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:21,478 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_57| 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:21,484 INFO L158 Benchmark]: Toolchain (without parser) took 12903.58ms. Allocated memory was 56.6MB in the beginning and 146.8MB in the end (delta: 90.2MB). Free memory was 34.3MB in the beginning and 105.0MB in the end (delta: -70.7MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2022-02-20 16:54:21,485 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 56.6MB. Free memory was 39.1MB in the beginning and 39.0MB in the end (delta: 51.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:54:21,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.01ms. Allocated memory is still 56.6MB. Free memory was 34.2MB in the beginning and 29.3MB in the end (delta: 4.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:54:21,487 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.38ms. Allocated memory is still 56.6MB. Free memory was 29.1MB in the beginning and 26.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:54:21,487 INFO L158 Benchmark]: Boogie Preprocessor took 36.21ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 26.5MB in the beginning and 51.9MB in the end (delta: -25.3MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-02-20 16:54:21,487 INFO L158 Benchmark]: RCFGBuilder took 658.30ms. Allocated memory is still 69.2MB. Free memory was 51.9MB in the beginning and 30.3MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-02-20 16:54:21,487 INFO L158 Benchmark]: TraceAbstraction took 11746.75ms. Allocated memory was 69.2MB in the beginning and 146.8MB in the end (delta: 77.6MB). Free memory was 29.9MB in the beginning and 105.0MB in the end (delta: -75.0MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. [2022-02-20 16:54:21,491 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 56.6MB. Free memory was 39.1MB in the beginning and 39.0MB in the end (delta: 51.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.01ms. Allocated memory is still 56.6MB. Free memory was 34.2MB in the beginning and 29.3MB in the end (delta: 4.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.38ms. Allocated memory is still 56.6MB. Free memory was 29.1MB in the beginning and 26.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.21ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 26.5MB in the beginning and 51.9MB in the end (delta: -25.3MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * RCFGBuilder took 658.30ms. Allocated memory is still 69.2MB. Free memory was 51.9MB in the beginning and 30.3MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11746.75ms. Allocated memory was 69.2MB in the beginning and 146.8MB in the end (delta: 77.6MB). Free memory was 29.9MB in the beginning and 105.0MB in the end (delta: -75.0MB). Peak memory consumption was 51.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_57| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_57|: 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:21,517 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 Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_57|