./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_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_insert_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 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:54:05,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:54:05,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:54:05,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:54:05,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:54:05,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:54:05,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:54:05,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:54:05,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:54:05,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:54:05,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:54:05,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:54:05,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:54:05,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:54:05,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:54:05,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:54:05,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:54:05,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:54:05,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:54:05,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:54:05,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:54:05,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:54:05,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:54:05,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:54:05,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:54:05,857 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:54:05,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:54:05,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:54:05,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:54:05,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:54:05,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:54:05,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:54:05,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:54:05,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:54:05,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:54:05,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:54:05,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:54:05,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:54:05,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:54:05,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:54:05,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:54:05,868 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:54:05,893 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:54:05,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:54:05,894 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:54:05,894 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:54:05,894 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:54:05,895 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:54:05,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:54:05,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:54:05,895 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:54:05,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:54:05,896 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:54:05,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:54:05,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:54:05,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:54:05,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:54:05,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:54:05,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:54:05,898 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:54:05,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:54:05,898 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:54:05,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:54:05,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:54:05,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:54:05,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:54:05,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:54:05,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:54:05,899 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:54:05,899 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:54:05,900 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:54:05,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:54:05,900 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:54:05,900 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:54:05,900 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:54:05,901 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2022-02-20 16:54:06,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:54:06,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:54:06,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:54:06,124 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:54:06,125 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:54:06,126 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2022-02-20 16:54:06,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78dedd8e3/7bd7ab5eaa5a4e418b47d67378f08cb8/FLAGfe69be5eb [2022-02-20 16:54:06,600 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:54:06,601 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2022-02-20 16:54:06,612 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78dedd8e3/7bd7ab5eaa5a4e418b47d67378f08cb8/FLAGfe69be5eb [2022-02-20 16:54:06,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78dedd8e3/7bd7ab5eaa5a4e418b47d67378f08cb8 [2022-02-20 16:54:06,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:54:06,626 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:54:06,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:54:06,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:54:06,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:54:06,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:54:06" (1/1) ... [2022-02-20 16:54:06,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a471210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:06, skipping insertion in model container [2022-02-20 16:54:06,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:54:06" (1/1) ... [2022-02-20 16:54:06,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:54:06,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:54:06,930 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_insert_unequal.i[25148,25161] [2022-02-20 16:54:06,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:54:06,952 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:54:07,002 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_insert_unequal.i[25148,25161] [2022-02-20 16:54:07,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:54:07,028 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:54:07,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07 WrapperNode [2022-02-20 16:54:07,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:54:07,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:54:07,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:54:07,031 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:54:07,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,095 INFO L137 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 185 [2022-02-20 16:54:07,096 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:54:07,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:54:07,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:54:07,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:54:07,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:54:07,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:54:07,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:54:07,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:54:07,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (1/1) ... [2022-02-20 16:54:07,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:54:07,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:07,154 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:54:07,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:54:07,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:54:07,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:54:07,181 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 16:54:07,182 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 16:54:07,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:54:07,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:54:07,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:54:07,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:54:07,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:54:07,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:54:07,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 16:54:07,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:54:07,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:54:07,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:54:07,283 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:54:07,285 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:54:07,663 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:54:07,670 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:54:07,670 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 16:54:07,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:54:07 BoogieIcfgContainer [2022-02-20 16:54:07,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:54:07,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:54:07,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:54:07,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:54:07,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:54:06" (1/3) ... [2022-02-20 16:54:07,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df1457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:54:07, skipping insertion in model container [2022-02-20 16:54:07,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:07" (2/3) ... [2022-02-20 16:54:07,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df1457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:54:07, skipping insertion in model container [2022-02-20 16:54:07,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:54:07" (3/3) ... [2022-02-20 16:54:07,678 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2022-02-20 16:54:07,682 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:54:07,683 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:54:07,732 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:54:07,742 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:07,742 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:54:07,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 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:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:54:07,772 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:07,773 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, 1] [2022-02-20 16:54:07,773 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:07,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:07,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1243287101, now seen corresponding path program 1 times [2022-02-20 16:54:07,790 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:07,790 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080636338] [2022-02-20 16:54:07,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:07,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:08,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:54:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:08,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {59#(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; {47#true} is VALID [2022-02-20 16:54:08,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {47#true} is VALID [2022-02-20 16:54:08,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {47#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; {47#true} is VALID [2022-02-20 16:54:08,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {47#true} assume true; {47#true} is VALID [2022-02-20 16:54:08,103 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {47#true} {47#true} #144#return; {47#true} is VALID [2022-02-20 16:54:08,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 16:54:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:08,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {59#(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; {47#true} is VALID [2022-02-20 16:54:08,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {47#true} is VALID [2022-02-20 16:54:08,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {47#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; {47#true} is VALID [2022-02-20 16:54:08,142 INFO L290 TraceCheckUtils]: 3: Hoare triple {47#true} assume true; {47#true} is VALID [2022-02-20 16:54:08,143 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {47#true} {48#false} #148#return; {48#false} is VALID [2022-02-20 16:54:08,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {47#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); {47#true} is VALID [2022-02-20 16:54:08,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#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_~mid_index~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; {47#true} is VALID [2022-02-20 16:54:08,146 INFO L272 TraceCheckUtils]: 2: Hoare triple {47#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {59#(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:08,146 INFO L290 TraceCheckUtils]: 3: Hoare triple {59#(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; {47#true} is VALID [2022-02-20 16:54:08,146 INFO L290 TraceCheckUtils]: 4: Hoare triple {47#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {47#true} is VALID [2022-02-20 16:54:08,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {47#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; {47#true} is VALID [2022-02-20 16:54:08,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#true} assume true; {47#true} is VALID [2022-02-20 16:54:08,147 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {47#true} {47#true} #144#return; {47#true} is VALID [2022-02-20 16:54:08,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {47#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; {47#true} is VALID [2022-02-20 16:54:08,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {47#true} assume !true; {48#false} is VALID [2022-02-20 16:54:08,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {48#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; {48#false} is VALID [2022-02-20 16:54:08,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {48#false} main_#t~ret18#1.base, main_#t~ret18#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~ret18#1.base, main_#t~ret18#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret18#1.base, main_#t~ret18#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_circular_insert } true;dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset, dll_circular_insert_#in~data#1, dll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset, dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset, dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset, dll_circular_insert_#t~post12#1, dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset, dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, dll_circular_insert_~data#1, dll_circular_insert_~index#1, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset := dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset;dll_circular_insert_~data#1 := dll_circular_insert_#in~data#1;dll_circular_insert_~index#1 := dll_circular_insert_#in~index#1; {48#false} is VALID [2022-02-20 16:54:08,150 INFO L272 TraceCheckUtils]: 12: Hoare triple {48#false} call dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset := node_create(dll_circular_insert_~data#1); {59#(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:08,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {59#(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; {47#true} is VALID [2022-02-20 16:54:08,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {47#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {47#true} is VALID [2022-02-20 16:54:08,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {47#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; {47#true} is VALID [2022-02-20 16:54:08,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {47#true} assume true; {47#true} is VALID [2022-02-20 16:54:08,151 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {47#true} {48#false} #148#return; {48#false} is VALID [2022-02-20 16:54:08,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {48#false} dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset := dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset;havoc dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset; {48#false} is VALID [2022-02-20 16:54:08,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {48#false} assume !(dll_circular_insert_~index#1 > 0); {48#false} is VALID [2022-02-20 16:54:08,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {48#false} assume dll_circular_insert_~snd_to_last~0#1.base != 0 || dll_circular_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~new_node~0#1.base, 4 + dll_circular_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~last~1#1.base, 4 + dll_circular_insert_~last~1#1.offset, 4); {48#false} is VALID [2022-02-20 16:54:08,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {48#false} assume { :end_inline_dll_circular_insert } true;call main_#t~mem19#1.base, main_#t~mem19#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~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;main_~count~0#1 := 0; {48#false} is VALID [2022-02-20 16:54:08,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {48#false} call main_#t~mem21#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {48#false} is VALID [2022-02-20 16:54:08,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {48#false} assume main_~data~0#1 != main_#t~mem21#1;havoc main_#t~mem21#1; {48#false} is VALID [2022-02-20 16:54:08,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {48#false} assume !false; {48#false} is VALID [2022-02-20 16:54:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 16:54:08,155 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:08,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080636338] [2022-02-20 16:54:08,156 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080636338] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:08,156 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:08,156 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:54:08,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229343589] [2022-02-20 16:54:08,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:08,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 25 [2022-02-20 16:54:08,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:08,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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:54:08,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:08,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:54:08,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:08,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:54:08,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:54:08,226 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 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.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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:54:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:08,462 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2022-02-20 16:54:08,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:54:08,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 25 [2022-02-20 16:54:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:08,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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:54:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-02-20 16:54:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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:54:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-02-20 16:54:08,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2022-02-20 16:54:08,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:08,612 INFO L225 Difference]: With dead ends: 79 [2022-02-20 16:54:08,613 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 16:54:08,616 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:54:08,622 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:08,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:54:08,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 16:54:08,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-20 16:54:08,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:08,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:54:08,655 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:54:08,656 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:54:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:08,667 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-02-20 16:54:08,668 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-02-20 16:54:08,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:08,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:08,670 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 36 states. [2022-02-20 16:54:08,670 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 36 states. [2022-02-20 16:54:08,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:08,673 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-02-20 16:54:08,674 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-02-20 16:54:08,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:08,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:08,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:08,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:54:08,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-02-20 16:54:08,678 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 25 [2022-02-20 16:54:08,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:08,679 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-02-20 16:54:08,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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:54:08,679 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-02-20 16:54:08,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:54:08,680 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:08,680 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, 1] [2022-02-20 16:54:08,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:54:08,681 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:08,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:08,681 INFO L85 PathProgramCache]: Analyzing trace with hash -709703190, now seen corresponding path program 1 times [2022-02-20 16:54:08,682 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:08,682 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273423442] [2022-02-20 16:54:08,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:08,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:08,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:54:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:08,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {295#(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; {282#true} is VALID [2022-02-20 16:54:08,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {282#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {282#true} is VALID [2022-02-20 16:54:08,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#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; {282#true} is VALID [2022-02-20 16:54:08,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {282#true} assume true; {282#true} is VALID [2022-02-20 16:54:08,787 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {282#true} {284#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} #144#return; {284#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:54:08,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 16:54:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:08,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {295#(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; {282#true} is VALID [2022-02-20 16:54:08,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {282#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {282#true} is VALID [2022-02-20 16:54:08,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#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; {282#true} is VALID [2022-02-20 16:54:08,803 INFO L290 TraceCheckUtils]: 3: Hoare triple {282#true} assume true; {282#true} is VALID [2022-02-20 16:54:08,803 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {282#true} {283#false} #148#return; {283#false} is VALID [2022-02-20 16:54:08,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {282#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); {282#true} is VALID [2022-02-20 16:54:08,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {282#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#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_~mid_index~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; {284#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:54:08,806 INFO L272 TraceCheckUtils]: 2: Hoare triple {284#(= (+ (- 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); {295#(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:08,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {295#(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; {282#true} is VALID [2022-02-20 16:54:08,806 INFO L290 TraceCheckUtils]: 4: Hoare triple {282#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {282#true} is VALID [2022-02-20 16:54:08,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {282#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; {282#true} is VALID [2022-02-20 16:54:08,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {282#true} assume true; {282#true} is VALID [2022-02-20 16:54:08,807 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {282#true} {284#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} #144#return; {284#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:54:08,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {284#(= (+ (- 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; {284#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:54:08,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#(= (+ (- 2) |ULTIMATE.start_dll_circular_create_~len#1|) 0)} assume !(dll_circular_create_~len#1 > 1); {283#false} is VALID [2022-02-20 16:54:08,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {283#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; {283#false} is VALID [2022-02-20 16:54:08,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {283#false} main_#t~ret18#1.base, main_#t~ret18#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~ret18#1.base, main_#t~ret18#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret18#1.base, main_#t~ret18#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_circular_insert } true;dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset, dll_circular_insert_#in~data#1, dll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset, dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset, dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset, dll_circular_insert_#t~post12#1, dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset, dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, dll_circular_insert_~data#1, dll_circular_insert_~index#1, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset := dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset;dll_circular_insert_~data#1 := dll_circular_insert_#in~data#1;dll_circular_insert_~index#1 := dll_circular_insert_#in~index#1; {283#false} is VALID [2022-02-20 16:54:08,809 INFO L272 TraceCheckUtils]: 12: Hoare triple {283#false} call dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset := node_create(dll_circular_insert_~data#1); {295#(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:08,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {295#(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; {282#true} is VALID [2022-02-20 16:54:08,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {282#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {282#true} is VALID [2022-02-20 16:54:08,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {282#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; {282#true} is VALID [2022-02-20 16:54:08,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {282#true} assume true; {282#true} is VALID [2022-02-20 16:54:08,810 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {282#true} {283#false} #148#return; {283#false} is VALID [2022-02-20 16:54:08,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {283#false} dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset := dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset;havoc dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset; {283#false} is VALID [2022-02-20 16:54:08,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {283#false} assume !(dll_circular_insert_~index#1 > 0); {283#false} is VALID [2022-02-20 16:54:08,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {283#false} assume dll_circular_insert_~snd_to_last~0#1.base != 0 || dll_circular_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~new_node~0#1.base, 4 + dll_circular_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~last~1#1.base, 4 + dll_circular_insert_~last~1#1.offset, 4); {283#false} is VALID [2022-02-20 16:54:08,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {283#false} assume { :end_inline_dll_circular_insert } true;call main_#t~mem19#1.base, main_#t~mem19#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~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;main_~count~0#1 := 0; {283#false} is VALID [2022-02-20 16:54:08,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {283#false} call main_#t~mem21#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {283#false} is VALID [2022-02-20 16:54:08,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {283#false} assume main_~data~0#1 != main_#t~mem21#1;havoc main_#t~mem21#1; {283#false} is VALID [2022-02-20 16:54:08,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {283#false} assume !false; {283#false} is VALID [2022-02-20 16:54:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 16:54:08,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:08,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273423442] [2022-02-20 16:54:08,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273423442] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:08,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:08,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:54:08,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294756329] [2022-02-20 16:54:08,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:08,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 25 [2022-02-20 16:54:08,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:08,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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:54:08,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:08,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:54:08,836 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:08,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:54:08,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:54:08,837 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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:54:09,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:09,061 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2022-02-20 16:54:09,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:54:09,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 25 [2022-02-20 16:54:09,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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:54:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-02-20 16:54:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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:54:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-02-20 16:54:09,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 89 transitions. [2022-02-20 16:54:09,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:09,157 INFO L225 Difference]: With dead ends: 68 [2022-02-20 16:54:09,157 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 16:54:09,158 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:54:09,159 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:09,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 104 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:54:09,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 16:54:09,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-02-20 16:54:09,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:09,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:54:09,164 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:54:09,164 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:54:09,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:09,169 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2022-02-20 16:54:09,170 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2022-02-20 16:54:09,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:09,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:09,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-02-20 16:54:09,173 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-02-20 16:54:09,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:09,185 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2022-02-20 16:54:09,186 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2022-02-20 16:54:09,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:09,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:09,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:09,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:54:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-02-20 16:54:09,191 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 25 [2022-02-20 16:54:09,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:09,193 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-02-20 16:54:09,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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:54:09,194 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-02-20 16:54:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 16:54:09,197 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:09,197 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, 1] [2022-02-20 16:54:09,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:54:09,197 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:09,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:09,198 INFO L85 PathProgramCache]: Analyzing trace with hash -37646058, now seen corresponding path program 1 times [2022-02-20 16:54:09,199 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:09,199 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242580819] [2022-02-20 16:54:09,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:09,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:09,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:54:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:09,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {533#(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; {515#true} is VALID [2022-02-20 16:54:09,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {515#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {515#true} is VALID [2022-02-20 16:54:09,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {515#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; {515#true} is VALID [2022-02-20 16:54:09,336 INFO L290 TraceCheckUtils]: 3: Hoare triple {515#true} assume true; {515#true} is VALID [2022-02-20 16:54:09,337 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {515#true} {515#true} #144#return; {515#true} is VALID [2022-02-20 16:54:09,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:54:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:09,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {533#(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; {515#true} is VALID [2022-02-20 16:54:09,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {515#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {515#true} is VALID [2022-02-20 16:54:09,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {515#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; {515#true} is VALID [2022-02-20 16:54:09,346 INFO L290 TraceCheckUtils]: 3: Hoare triple {515#true} assume true; {515#true} is VALID [2022-02-20 16:54:09,346 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {515#true} {515#true} #146#return; {515#true} is VALID [2022-02-20 16:54:09,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 16:54:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:09,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {533#(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; {515#true} is VALID [2022-02-20 16:54:09,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {515#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {515#true} is VALID [2022-02-20 16:54:09,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {515#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; {515#true} is VALID [2022-02-20 16:54:09,355 INFO L290 TraceCheckUtils]: 3: Hoare triple {515#true} assume true; {515#true} is VALID [2022-02-20 16:54:09,356 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {515#true} {515#true} #148#return; {515#true} is VALID [2022-02-20 16:54:09,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {515#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); {515#true} is VALID [2022-02-20 16:54:09,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {515#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#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_~mid_index~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; {515#true} is VALID [2022-02-20 16:54:09,357 INFO L272 TraceCheckUtils]: 2: Hoare triple {515#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {533#(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:09,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {533#(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; {515#true} is VALID [2022-02-20 16:54:09,358 INFO L290 TraceCheckUtils]: 4: Hoare triple {515#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {515#true} is VALID [2022-02-20 16:54:09,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {515#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; {515#true} is VALID [2022-02-20 16:54:09,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {515#true} assume true; {515#true} is VALID [2022-02-20 16:54:09,358 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {515#true} {515#true} #144#return; {515#true} is VALID [2022-02-20 16:54:09,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {515#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; {515#true} is VALID [2022-02-20 16:54:09,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {515#true} assume !!(dll_circular_create_~len#1 > 1); {515#true} is VALID [2022-02-20 16:54:09,360 INFO L272 TraceCheckUtils]: 10: Hoare triple {515#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {533#(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:09,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {533#(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; {515#true} is VALID [2022-02-20 16:54:09,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {515#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {515#true} is VALID [2022-02-20 16:54:09,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {515#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; {515#true} is VALID [2022-02-20 16:54:09,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {515#true} assume true; {515#true} is VALID [2022-02-20 16:54:09,361 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {515#true} {515#true} #146#return; {515#true} is VALID [2022-02-20 16:54:09,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {515#true} 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); {515#true} is VALID [2022-02-20 16:54:09,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {515#true} 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); {515#true} is VALID [2022-02-20 16:54:09,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {515#true} 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; {515#true} is VALID [2022-02-20 16:54:09,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {515#true} assume !(dll_circular_create_~len#1 > 1); {515#true} is VALID [2022-02-20 16:54:09,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {515#true} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 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; {515#true} is VALID [2022-02-20 16:54:09,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {515#true} main_#t~ret18#1.base, main_#t~ret18#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~ret18#1.base, main_#t~ret18#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret18#1.base, main_#t~ret18#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_circular_insert } true;dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset, dll_circular_insert_#in~data#1, dll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset, dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset, dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset, dll_circular_insert_#t~post12#1, dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset, dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, dll_circular_insert_~data#1, dll_circular_insert_~index#1, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset := dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset;dll_circular_insert_~data#1 := dll_circular_insert_#in~data#1;dll_circular_insert_~index#1 := dll_circular_insert_#in~index#1; {515#true} is VALID [2022-02-20 16:54:09,363 INFO L272 TraceCheckUtils]: 22: Hoare triple {515#true} call dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset := node_create(dll_circular_insert_~data#1); {533#(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:09,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {533#(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; {515#true} is VALID [2022-02-20 16:54:09,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {515#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {515#true} is VALID [2022-02-20 16:54:09,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {515#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; {515#true} is VALID [2022-02-20 16:54:09,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {515#true} assume true; {515#true} is VALID [2022-02-20 16:54:09,364 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {515#true} {515#true} #148#return; {515#true} is VALID [2022-02-20 16:54:09,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {515#true} dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset := dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset;havoc dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset; {532#(and (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 0))} is VALID [2022-02-20 16:54:09,365 INFO L290 TraceCheckUtils]: 29: Hoare triple {532#(and (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 0))} assume !(dll_circular_insert_~index#1 > 0); {532#(and (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 0))} is VALID [2022-02-20 16:54:09,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {532#(and (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 0))} assume dll_circular_insert_~snd_to_last~0#1.base != 0 || dll_circular_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~new_node~0#1.base, 4 + dll_circular_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~last~1#1.base, 4 + dll_circular_insert_~last~1#1.offset, 4); {516#false} is VALID [2022-02-20 16:54:09,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {516#false} assume { :end_inline_dll_circular_insert } true;call main_#t~mem19#1.base, main_#t~mem19#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~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;main_~count~0#1 := 0; {516#false} is VALID [2022-02-20 16:54:09,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {516#false} call main_#t~mem21#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {516#false} is VALID [2022-02-20 16:54:09,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {516#false} assume main_~data~0#1 != main_#t~mem21#1;havoc main_#t~mem21#1; {516#false} is VALID [2022-02-20 16:54:09,367 INFO L290 TraceCheckUtils]: 34: Hoare triple {516#false} assume !false; {516#false} is VALID [2022-02-20 16:54:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 16:54:09,368 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:09,368 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242580819] [2022-02-20 16:54:09,368 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242580819] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:09,368 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:09,368 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:54:09,369 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299244447] [2022-02-20 16:54:09,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:09,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-02-20 16:54:09,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:09,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:54:09,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:09,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:54:09,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:09,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:54:09,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:54:09,400 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:54:09,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:09,602 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2022-02-20 16:54:09,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:54:09,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-02-20 16:54:09,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:09,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:54:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-02-20 16:54:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:54:09,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-02-20 16:54:09,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-02-20 16:54:09,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:09,688 INFO L225 Difference]: With dead ends: 67 [2022-02-20 16:54:09,688 INFO L226 Difference]: Without dead ends: 53 [2022-02-20 16:54:09,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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:54:09,689 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:09,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 130 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:54:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-20 16:54:09,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2022-02-20 16:54:09,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:09,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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,695 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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,695 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:09,698 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-02-20 16:54:09,698 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2022-02-20 16:54:09,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:09,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:09,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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 53 states. [2022-02-20 16:54:09,699 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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 53 states. [2022-02-20 16:54:09,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:09,701 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-02-20 16:54:09,702 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2022-02-20 16:54:09,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:09,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:09,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:09,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:09,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-02-20 16:54:09,704 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 35 [2022-02-20 16:54:09,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:09,705 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-02-20 16:54:09,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:54:09,705 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-02-20 16:54:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 16:54:09,706 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:09,706 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, 1, 1] [2022-02-20 16:54:09,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:54:09,707 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:09,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:09,707 INFO L85 PathProgramCache]: Analyzing trace with hash 368663721, now seen corresponding path program 1 times [2022-02-20 16:54:09,707 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:09,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918149253] [2022-02-20 16:54:09,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:09,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:10,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:54:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:10,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {810#(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; {811#(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:10,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {811#(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); {811#(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:10,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {811#(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; {812#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:10,788 INFO L290 TraceCheckUtils]: 3: Hoare triple {812#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {812#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:10,789 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {812#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} {780#(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|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} #144#return; {786#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (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:10,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:54:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:10,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {810#(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; {813#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:10,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {813#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (= |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); {813#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:10,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {813#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (= |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; {814#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:10,891 INFO L290 TraceCheckUtils]: 3: Hoare triple {814#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {814#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:10,893 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {814#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {787#(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) (<= (+ |#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|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} #146#return; {793#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (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_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 16:54:10,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 16:54:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:11,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {810#(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; {815#(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)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:11,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {815#(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)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {815#(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)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:11,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {815#(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)|) (= 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; {816#(and (= |#memory_int| (store (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|)))) (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |#memory_int| (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)))) (= (select |old(#valid)| (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|)) 0)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (= |#memory_int| |old(#memory_int)|) (= (select |old(#valid)| (@diff |old(#memory_int)| |#memory_int|)) 0)) (= |#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$.base| |old(#memory_$Pointer$.base)|) (= (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) 0)) (or (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= (select |old(#valid)| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)) 0)) (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:11,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {816#(and (= |#memory_int| (store (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|)))) (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |#memory_int| (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)))) (= (select |old(#valid)| (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|)) 0)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (= |#memory_int| |old(#memory_int)|) (= (select |old(#valid)| (@diff |old(#memory_int)| |#memory_int|)) 0)) (= |#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$.base| |old(#memory_$Pointer$.base)|) (= (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) 0)) (or (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= (select |old(#valid)| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)) 0)) (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; {816#(and (= |#memory_int| (store (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|)))) (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |#memory_int| (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)))) (= (select |old(#valid)| (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|)) 0)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (= |#memory_int| |old(#memory_int)|) (= (select |old(#valid)| (@diff |old(#memory_int)| |#memory_int|)) 0)) (= |#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$.base| |old(#memory_$Pointer$.base)|) (= (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) 0)) (or (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= (select |old(#valid)| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)) 0)) (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:11,286 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {816#(and (= |#memory_int| (store (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|)))) (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |#memory_int| (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)))) (= (select |old(#valid)| (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|)) 0)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (= |#memory_int| |old(#memory_int)|) (= (select |old(#valid)| (@diff |old(#memory_int)| |#memory_int|)) 0)) (= |#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$.base| |old(#memory_$Pointer$.base)|) (= (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) 0)) (or (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= (select |old(#valid)| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)) 0)) (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|)))))} {798#(and (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|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8) |ULTIMATE.start_main_~data~0#1|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} #148#return; {804#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 8) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:54:11,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {778#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); {778#true} is VALID [2022-02-20 16:54:11,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {778#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#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_~mid_index~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; {780#(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|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:54:11,290 INFO L272 TraceCheckUtils]: 2: Hoare triple {780#(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|) (= |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); {810#(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:11,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {810#(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; {811#(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:11,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {811#(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); {811#(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:11,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {811#(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; {812#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:11,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {812#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {812#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:11,294 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {812#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |node_create_#res#1.base|) 1))} {780#(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|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} #144#return; {786#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (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:11,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {786#(and (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (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; {787#(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) (<= (+ |#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|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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:11,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {787#(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) (<= (+ |#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|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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); {787#(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) (<= (+ |#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|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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:11,297 INFO L272 TraceCheckUtils]: 10: Hoare triple {787#(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) (<= (+ |#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|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {810#(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:11,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {810#(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; {813#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:11,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {813#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (= |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); {813#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:11,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {813#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~data#1| |node_create_#in~data#1|) (= |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; {814#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:11,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {814#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {814#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:11,302 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {814#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {787#(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) (<= (+ |#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|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} #146#return; {793#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (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_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 16:54:11,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {793#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (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_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~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); {794#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |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|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|))} is VALID [2022-02-20 16:54:11,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {794#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |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|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|))} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4); {795#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |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|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|))} is VALID [2022-02-20 16:54:11,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {795#(and (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |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|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := dll_circular_create_#t~post6#1 - 1;havoc dll_circular_create_#t~post6#1; {796#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (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:11,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {796#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (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); {796#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (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:11,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {796#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (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; {797#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_create_#res#1.offset|) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_create_#res#1.offset|) |ULTIMATE.start_dll_circular_create_#res#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|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 16:54:11,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {797#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_create_#res#1.offset|) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) |ULTIMATE.start_dll_circular_create_#res#1.offset|) |ULTIMATE.start_dll_circular_create_#res#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|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} main_#t~ret18#1.base, main_#t~ret18#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~ret18#1.base, main_#t~ret18#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret18#1.base, main_#t~ret18#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_circular_insert } true;dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset, dll_circular_insert_#in~data#1, dll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset, dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset, dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset, dll_circular_insert_#t~post12#1, dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset, dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, dll_circular_insert_~data#1, dll_circular_insert_~index#1, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset := dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset;dll_circular_insert_~data#1 := dll_circular_insert_#in~data#1;dll_circular_insert_~index#1 := dll_circular_insert_#in~index#1; {798#(and (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|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8) |ULTIMATE.start_main_~data~0#1|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:54:11,311 INFO L272 TraceCheckUtils]: 22: Hoare triple {798#(and (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|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8) |ULTIMATE.start_main_~data~0#1|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} call dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset := node_create(dll_circular_insert_~data#1); {810#(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:11,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {810#(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; {815#(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)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:11,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {815#(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)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {815#(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)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:11,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {815#(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)|) (= 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; {816#(and (= |#memory_int| (store (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|)))) (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |#memory_int| (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)))) (= (select |old(#valid)| (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|)) 0)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (= |#memory_int| |old(#memory_int)|) (= (select |old(#valid)| (@diff |old(#memory_int)| |#memory_int|)) 0)) (= |#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$.base| |old(#memory_$Pointer$.base)|) (= (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) 0)) (or (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= (select |old(#valid)| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)) 0)) (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:11,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {816#(and (= |#memory_int| (store (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|)))) (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |#memory_int| (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)))) (= (select |old(#valid)| (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|)) 0)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (= |#memory_int| |old(#memory_int)|) (= (select |old(#valid)| (@diff |old(#memory_int)| |#memory_int|)) 0)) (= |#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$.base| |old(#memory_$Pointer$.base)|) (= (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) 0)) (or (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= (select |old(#valid)| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)) 0)) (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; {816#(and (= |#memory_int| (store (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|)))) (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |#memory_int| (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)))) (= (select |old(#valid)| (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|)) 0)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (= |#memory_int| |old(#memory_int)|) (= (select |old(#valid)| (@diff |old(#memory_int)| |#memory_int|)) 0)) (= |#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$.base| |old(#memory_$Pointer$.base)|) (= (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) 0)) (or (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= (select |old(#valid)| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)) 0)) (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:11,325 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {816#(and (= |#memory_int| (store (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|)))) (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |#memory_int| (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)))) (= (select |old(#valid)| (@diff (store (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (select |#memory_int| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|))) |#memory_int|)) 0)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (= |#memory_int| |old(#memory_int)|) (= (select |old(#valid)| (@diff |old(#memory_int)| |#memory_int|)) 0)) (= |#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$.base| |old(#memory_$Pointer$.base)|) (= (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) 0)) (or (= (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|) (= (select |old(#valid)| (@diff (store |old(#memory_int)| (@diff |old(#memory_int)| |#memory_int|) (select |#memory_int| (@diff |old(#memory_int)| |#memory_int|))) |#memory_int|)) 0)) (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|)))))} {798#(and (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|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8) |ULTIMATE.start_main_~data~0#1|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} #148#return; {804#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 8) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:54:11,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {804#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 8) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset := dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset;havoc dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset; {805#(and (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 8)))} is VALID [2022-02-20 16:54:11,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {805#(and (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 8)))} assume !!(dll_circular_insert_~index#1 > 0);dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;call dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset := read~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;havoc dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;dll_circular_insert_#t~post12#1 := dll_circular_insert_~index#1;dll_circular_insert_~index#1 := dll_circular_insert_#t~post12#1 - 1;havoc dll_circular_insert_#t~post12#1; {806#(and (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 8)))} is VALID [2022-02-20 16:54:11,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {806#(and (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 8)))} assume !(dll_circular_insert_~index#1 > 0); {806#(and (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 8)))} is VALID [2022-02-20 16:54:11,330 INFO L290 TraceCheckUtils]: 31: Hoare triple {806#(and (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 8)))} assume dll_circular_insert_~snd_to_last~0#1.base != 0 || dll_circular_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~new_node~0#1.base, 4 + dll_circular_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~last~1#1.base, 4 + dll_circular_insert_~last~1#1.offset, 4); {807#(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:11,330 INFO L290 TraceCheckUtils]: 32: Hoare triple {807#(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_insert } true;call main_#t~mem19#1.base, main_#t~mem19#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~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;main_~count~0#1 := 0; {808#(and (= (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|) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))} is VALID [2022-02-20 16:54:11,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {808#(and (= (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|) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))} call main_#t~mem21#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {809#(= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_main_#t~mem21#1|)} is VALID [2022-02-20 16:54:11,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {809#(= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_main_#t~mem21#1|)} assume main_~data~0#1 != main_#t~mem21#1;havoc main_#t~mem21#1; {779#false} is VALID [2022-02-20 16:54:11,331 INFO L290 TraceCheckUtils]: 35: Hoare triple {779#false} assume !false; {779#false} is VALID [2022-02-20 16:54:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:54:11,332 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:11,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918149253] [2022-02-20 16:54:11,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918149253] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:11,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814032006] [2022-02-20 16:54:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:11,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:11,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:11,339 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:54:11,376 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:54:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:11,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 192 conjunts are in the unsatisfiable core [2022-02-20 16:54:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:11,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:12,083 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:12,543 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:12,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:12,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:12,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:12,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-02-20 16:54:12,744 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:12,920 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 16:54:12,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-20 16:54:13,088 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 11 treesize of output 7 [2022-02-20 16:54:13,107 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:13,129 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:13,313 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 16:54:13,314 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 55 [2022-02-20 16:54:13,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 25 treesize of output 25 [2022-02-20 16:54:13,337 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:13,817 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-02-20 16:54:13,817 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 71 [2022-02-20 16:54:13,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:13,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-02-20 16:54:13,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:13,893 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 33 treesize of output 28 [2022-02-20 16:54:13,914 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:13,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-02-20 16:54:14,361 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-02-20 16:54:14,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 51 [2022-02-20 16:54:14,442 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:14,533 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:14,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:14,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-02-20 16:54:15,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:15,082 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-02-20 16:54:15,082 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 119 treesize of output 101 [2022-02-20 16:54:15,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:15,099 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:15,128 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-02-20 16:54:15,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-02-20 16:54:15,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:15,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:15,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-02-20 16:54:16,290 INFO L356 Elim1Store]: treesize reduction 72, result has 20.0 percent of original size [2022-02-20 16:54:16,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 291 treesize of output 172 [2022-02-20 16:54:16,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:16,513 INFO L356 Elim1Store]: treesize reduction 74, result has 17.8 percent of original size [2022-02-20 16:54:16,513 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 298 treesize of output 233 [2022-02-20 16:54:16,723 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 73 [2022-02-20 16:54:16,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:16,894 INFO L356 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2022-02-20 16:54:16,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 205 treesize of output 160 [2022-02-20 16:54:17,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:17,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:17,050 INFO L356 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-02-20 16:54:17,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 162 [2022-02-20 16:54:17,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:17,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-02-20 16:54:17,312 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 10 treesize of output 9 [2022-02-20 16:54:17,375 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 9 treesize of output 7 [2022-02-20 16:54:17,526 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 16:54:17,527 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 91 treesize of output 46 [2022-02-20 16:54:17,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:17,576 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 16:54:17,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2022-02-20 16:54:17,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 16:54:17,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {778#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); {778#true} is VALID [2022-02-20 16:54:17,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {778#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#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_~mid_index~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; {823#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:54:17,703 INFO L272 TraceCheckUtils]: 2: Hoare triple {823#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |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); {778#true} is VALID [2022-02-20 16:54:17,703 INFO L290 TraceCheckUtils]: 3: Hoare triple {778#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; {830#(and (< |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0))} is VALID [2022-02-20 16:54:17,704 INFO L290 TraceCheckUtils]: 4: Hoare triple {830#(and (< |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {830#(and (< |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 0))} is VALID [2022-02-20 16:54:17,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {830#(and (< |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (= |node_create_~temp~0#1.offset| 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; {837#(and (< |node_create_#res#1.base| |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:17,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {837#(and (< |node_create_#res#1.base| |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {837#(and (< |node_create_#res#1.base| |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:17,712 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {837#(and (< |node_create_#res#1.base| |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {823#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} #144#return; {844#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1) (< |ULTIMATE.start_dll_circular_create_#t~ret4#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 16:54:17,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {844#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1) (< |ULTIMATE.start_dll_circular_create_#t~ret4#1.base| |#StackHeapBarrier|))} 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; {848#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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:17,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {848#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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); {848#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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:17,715 INFO L272 TraceCheckUtils]: 10: Hoare triple {848#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {855#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 16:54:17,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {855#(= |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; {859#(and (< |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |node_create_~data#1| |node_create_#in~data#1|) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:17,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {859#(and (< |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |node_create_~data#1| |node_create_#in~data#1|) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|) (= |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); {859#(and (< |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |node_create_~data#1| |node_create_#in~data#1|) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|) (= |node_create_~temp~0#1.offset| 0) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:17,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {859#(and (< |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |node_create_~data#1| |node_create_#in~data#1|) (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|) (= |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; {866#(and (< |node_create_#res#1.base| |#StackHeapBarrier|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= (select (select |#memory_int| |node_create_#res#1.base|) (+ 8 |node_create_#res#1.offset|)) |node_create_#in~data#1|) (= (store |old(#valid)| |node_create_#res#1.base| 1) |#valid|) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_#res#1.base|) (+ 4 |node_create_#res#1.offset|))) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 16:54:17,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {866#(and (< |node_create_#res#1.base| |#StackHeapBarrier|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= (select (select |#memory_int| |node_create_#res#1.base|) (+ 8 |node_create_#res#1.offset|)) |node_create_#in~data#1|) (= (store |old(#valid)| |node_create_#res#1.base| 1) |#valid|) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_#res#1.base|) (+ 4 |node_create_#res#1.offset|))) (= 0 |node_create_#res#1.offset|))} assume true; {866#(and (< |node_create_#res#1.base| |#StackHeapBarrier|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= (select (select |#memory_int| |node_create_#res#1.base|) (+ 8 |node_create_#res#1.offset|)) |node_create_#in~data#1|) (= (store |old(#valid)| |node_create_#res#1.base| 1) |#valid|) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_#res#1.base|) (+ 4 |node_create_#res#1.offset|))) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 16:54:17,722 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {866#(and (< |node_create_#res#1.base| |#StackHeapBarrier|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= (select (select |#memory_int| |node_create_#res#1.base|) (+ 8 |node_create_#res#1.offset|)) |node_create_#in~data#1|) (= (store |old(#valid)| |node_create_#res#1.base| 1) |#valid|) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_#res#1.base|) (+ 4 |node_create_#res#1.offset|))) (= 0 |node_create_#res#1.offset|))} {848#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} #146#return; {873#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 4) 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (< |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 16:54:17,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {873#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 1) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 4) 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (< |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |#StackHeapBarrier|))} 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); {877#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (< |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|))} is VALID [2022-02-20 16:54:17,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (< |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|))} assume dll_circular_create_~head~0#1.base != 0 || dll_circular_create_~head~0#1.offset != 0;call write~$Pointer$(dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, dll_circular_create_~head~0#1.base, 4 + dll_circular_create_~head~0#1.offset, 4); {881#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (< |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|))} is VALID [2022-02-20 16:54:17,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {881#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (< |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|))} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset;dll_circular_create_#t~post6#1 := dll_circular_create_~len#1;dll_circular_create_~len#1 := dll_circular_create_#t~post6#1 - 1;havoc dll_circular_create_#t~post6#1; {885#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4) 0) (= |ULTIMATE.start_main_~data~0#1| 1) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|))} is VALID [2022-02-20 16:54:17,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {885#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4) 0) (= |ULTIMATE.start_main_~data~0#1| 1) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|))} assume !(dll_circular_create_~len#1 > 1); {885#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4) 0) (= |ULTIMATE.start_main_~data~0#1| 1) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|))} is VALID [2022-02-20 16:54:17,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {885#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 4) 0) (= |ULTIMATE.start_main_~data~0#1| 1) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|))} 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; {892#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (< |ULTIMATE.start_dll_circular_create_#res#1.base| |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base|) 0) 0) (not (= |ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 0) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) 0) |ULTIMATE.start_dll_circular_create_#res#1.base|))} is VALID [2022-02-20 16:54:17,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {892#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (< |ULTIMATE.start_dll_circular_create_#res#1.base| |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base|) 0) 0) (not (= |ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#res#1.base|) 1) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 0) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) 0) |ULTIMATE.start_dll_circular_create_#res#1.base|))} main_#t~ret18#1.base, main_#t~ret18#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~ret18#1.base, main_#t~ret18#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret18#1.base, main_#t~ret18#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_circular_insert } true;dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset, dll_circular_insert_#in~data#1, dll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset, dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset, dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset, dll_circular_insert_#t~post12#1, dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset, dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, dll_circular_insert_~data#1, dll_circular_insert_~index#1, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset := dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset;dll_circular_insert_~data#1 := dll_circular_insert_#in~data#1;dll_circular_insert_~index#1 := dll_circular_insert_#in~index#1; {896#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0)) 1) (= (select (select |#memory_$Pointer$.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|)) 0)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|) (= (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|)) 0) (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) (= (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|) (= |ULTIMATE.start_main_~data~0#1| 1) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:54:17,733 INFO L272 TraceCheckUtils]: 22: Hoare triple {896#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0)) 1) (= (select (select |#memory_$Pointer$.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|)) 0)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|) (= (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|)) 0) (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) (= (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|) (= |ULTIMATE.start_main_~data~0#1| 1) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} call dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset := node_create(dll_circular_insert_~data#1); {900#(and (= |#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:17,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {900#(and (= |#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; {904#(and (< |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:17,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {904#(and (< |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {904#(and (< |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:17,759 WARN L290 TraceCheckUtils]: 25: Hoare triple {904#(and (< |node_create_~temp~0#1.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 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; {911#(and (< |node_create_#res#1.base| |#StackHeapBarrier|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (exists ((v_ArrVal_727 (Array Int Int))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_#res#1.base| v_ArrVal_727))) (exists ((v_ArrVal_729 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |node_create_#res#1.base| v_ArrVal_729))) (exists ((v_ArrVal_725 (Array Int Int))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_725))) (= 0 |node_create_#res#1.offset|))} is UNKNOWN [2022-02-20 16:54:17,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {911#(and (< |node_create_#res#1.base| |#StackHeapBarrier|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (exists ((v_ArrVal_727 (Array Int Int))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_#res#1.base| v_ArrVal_727))) (exists ((v_ArrVal_729 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |node_create_#res#1.base| v_ArrVal_729))) (exists ((v_ArrVal_725 (Array Int Int))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_725))) (= 0 |node_create_#res#1.offset|))} assume true; {911#(and (< |node_create_#res#1.base| |#StackHeapBarrier|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (exists ((v_ArrVal_727 (Array Int Int))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_#res#1.base| v_ArrVal_727))) (exists ((v_ArrVal_729 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |node_create_#res#1.base| v_ArrVal_729))) (exists ((v_ArrVal_725 (Array Int Int))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_725))) (= 0 |node_create_#res#1.offset|))} is VALID [2022-02-20 16:54:17,764 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {911#(and (< |node_create_#res#1.base| |#StackHeapBarrier|) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (exists ((v_ArrVal_727 (Array Int Int))) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |node_create_#res#1.base| v_ArrVal_727))) (exists ((v_ArrVal_729 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |node_create_#res#1.base| v_ArrVal_729))) (exists ((v_ArrVal_725 (Array Int Int))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_725))) (= 0 |node_create_#res#1.offset|))} {896#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0)) 1) (= (select (select |#memory_$Pointer$.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|)) 0)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|) (= (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|)) 0) (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) (= (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|) (= |ULTIMATE.start_main_~data~0#1| 1) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} #148#return; {918#(and (= |ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= (select (select |#memory_$Pointer$.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|)) 0)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (< (+ |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_insert_#t~ret9#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|)) 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (< (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 1) |ULTIMATE.start_main_~#s~0#1.base|) (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|)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (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|) (= |ULTIMATE.start_main_~data~0#1| 1) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:54:17,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {918#(and (= |ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= (select (select |#memory_$Pointer$.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|)) 0)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (< (+ |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_insert_#t~ret9#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|)) 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (< (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 1) |ULTIMATE.start_main_~#s~0#1.base|) (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|)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (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|) (= |ULTIMATE.start_main_~data~0#1| 1) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset := dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset;havoc dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset; {922#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) (= (select (select |#memory_$Pointer$.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|)) 0)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (< (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 1) |ULTIMATE.start_main_~#s~0#1.base|) (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|)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (< (+ |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_insert_~new_node~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|) (= |ULTIMATE.start_main_~data~0#1| 1) (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|)) 0) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 0) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} is VALID [2022-02-20 16:54:17,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {922#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) (= (select (select |#memory_$Pointer$.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|)) 0)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (< (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 1) |ULTIMATE.start_main_~#s~0#1.base|) (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|)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (< (+ |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_insert_~new_node~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|) (= |ULTIMATE.start_main_~data~0#1| 1) (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|)) 0) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 0) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} assume !!(dll_circular_insert_~index#1 > 0);dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;call dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset := read~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;havoc dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;dll_circular_insert_#t~post12#1 := dll_circular_insert_~index#1;dll_circular_insert_~index#1 := dll_circular_insert_#t~post12#1 - 1;havoc dll_circular_insert_#t~post12#1; {926#(and (<= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)) (= (select (select |#memory_$Pointer$.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|)) 0)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (< (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 1) |ULTIMATE.start_main_~#s~0#1.base|) (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|)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (< (+ |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |ULTIMATE.start_dll_circular_insert_~new_node~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|) (= |ULTIMATE.start_main_~data~0#1| 1) (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|)) 0) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 0) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} is VALID [2022-02-20 16:54:17,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {926#(and (<= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)) (= (select (select |#memory_$Pointer$.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|)) 0)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (< (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 1) |ULTIMATE.start_main_~#s~0#1.base|) (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|)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (< (+ |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |ULTIMATE.start_dll_circular_insert_~new_node~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|) (= |ULTIMATE.start_main_~data~0#1| 1) (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|)) 0) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 0) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} assume !(dll_circular_insert_~index#1 > 0); {926#(and (<= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)) (= (select (select |#memory_$Pointer$.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|)) 0)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (< (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 1) |ULTIMATE.start_main_~#s~0#1.base|) (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|)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (< (+ |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |ULTIMATE.start_dll_circular_insert_~new_node~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|) (= |ULTIMATE.start_main_~data~0#1| 1) (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|)) 0) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 0) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} is VALID [2022-02-20 16:54:17,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {926#(and (<= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)) (= (select (select |#memory_$Pointer$.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|)) 0)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (< (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 1) |ULTIMATE.start_main_~#s~0#1.base|) (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|)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (< (+ |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= |ULTIMATE.start_dll_circular_insert_~new_node~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|) (= |ULTIMATE.start_main_~data~0#1| 1) (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|)) 0) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 0) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} assume dll_circular_insert_~snd_to_last~0#1.base != 0 || dll_circular_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~new_node~0#1.base, 4 + dll_circular_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~last~1#1.base, 4 + dll_circular_insert_~last~1#1.offset, 4); {933#(and (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|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) (< (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 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|) (= |ULTIMATE.start_main_~data~0#1| 1) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} is VALID [2022-02-20 16:54:17,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {933#(and (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|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) (< (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 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|) (= |ULTIMATE.start_main_~data~0#1| 1) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} assume { :end_inline_dll_circular_insert } true;call main_#t~mem19#1.base, main_#t~mem19#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~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;main_~count~0#1 := 0; {937#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1))} is VALID [2022-02-20 16:54:17,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {937#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 8) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1))} call main_#t~mem21#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {941#(and (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_main_#t~mem21#1|))} is VALID [2022-02-20 16:54:17,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {941#(and (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_main_#t~mem21#1|))} assume main_~data~0#1 != main_#t~mem21#1;havoc main_#t~mem21#1; {779#false} is VALID [2022-02-20 16:54:17,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {779#false} assume !false; {779#false} is VALID [2022-02-20 16:54:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:54:17,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:54:17,985 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_751 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_745 (Array Int Int)) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_751)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_735))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4) v_ArrVal_752))) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_745) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_731) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_744) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-02-20 16:54:18,209 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_751 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_745 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| Int) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| v_ArrVal_751)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_735))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| 4) v_ArrVal_752))) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_745) .cse1 v_ArrVal_731) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_744) .cse1 v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) (not (<= |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| (select .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))))) is different from false [2022-02-20 16:54:18,398 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_751 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_745 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| Int) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (<= |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| (select .cse0 .cse1))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse3 (select .cse5 .cse1))) (select (select (let ((.cse2 (store (store |c_#memory_int| .cse4 (store (select |c_#memory_int| .cse4) .cse1 v_ArrVal_751)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_735))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| 4) v_ArrVal_752))) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_745) .cse3 v_ArrVal_731) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse4 (store .cse0 .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_744) .cse3 v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2022-02-20 16:54:19,016 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_763 (Array Int Int)) (v_ArrVal_730 (Array Int Int)) (v_ArrVal_744 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_751 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_745 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| Int) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_763))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_761)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse8 (select .cse7 .cse3)) (.cse4 (select (select .cse7 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (select .cse5 .cse3))) (let ((.cse1 (select .cse6 .cse4))) (select (select (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_762))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_751))) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_735))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| 4) v_ArrVal_752))) (select (select (store (store (store .cse5 .cse3 (store .cse6 .cse4 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_745) .cse1 v_ArrVal_731) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store .cse7 .cse3 (store .cse8 .cse4 0)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_744) .cse1 v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) (not (<= |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| (select .cse8 .cse4))) (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9|) 0))))))) is different from false [2022-02-20 16:54:19,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814032006] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:19,021 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:54:19,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2022-02-20 16:54:19,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278142959] [2022-02-20 16:54:19,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:54:19,022 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 38 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2022-02-20 16:54:19,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:19,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 47 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 38 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 16:54:19,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 69 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:19,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-02-20 16:54:19,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:19,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-02-20 16:54:19,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2203, Unknown=6, NotChecked=388, Total=2756 [2022-02-20 16:54:19,128 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 47 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 38 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 16:54:25,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:25,794 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2022-02-20 16:54:25,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 16:54:25,794 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 38 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2022-02-20 16:54:25,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:25,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 38 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 16:54:25,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 104 transitions. [2022-02-20 16:54:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 38 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 16:54:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 104 transitions. [2022-02-20 16:54:25,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 104 transitions. [2022-02-20 16:54:25,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 103 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:25,930 INFO L225 Difference]: With dead ends: 78 [2022-02-20 16:54:25,930 INFO L226 Difference]: Without dead ends: 76 [2022-02-20 16:54:25,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=243, Invalid=3073, Unknown=6, NotChecked=460, Total=3782 [2022-02-20 16:54:25,933 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 73 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:25,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 508 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1260 Invalid, 0 Unknown, 45 Unchecked, 2.5s Time] [2022-02-20 16:54:25,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-02-20 16:54:25,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2022-02-20 16:54:25,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:25,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 54 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:25,956 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 54 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:25,957 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 54 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:25,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:25,960 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2022-02-20 16:54:25,960 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 105 transitions. [2022-02-20 16:54:25,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:25,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:25,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 76 states. [2022-02-20 16:54:25,961 INFO L87 Difference]: Start difference. First operand has 54 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 76 states. [2022-02-20 16:54:25,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:25,964 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2022-02-20 16:54:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 105 transitions. [2022-02-20 16:54:25,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:25,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:25,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:25,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2022-02-20 16:54:25,967 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 36 [2022-02-20 16:54:25,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:25,968 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2022-02-20 16:54:25,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 38 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 16:54:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2022-02-20 16:54:25,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 16:54:25,969 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:25,969 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, 1, 1, 1] [2022-02-20 16:54:25,999 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:26,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:26,188 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:26,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:26,188 INFO L85 PathProgramCache]: Analyzing trace with hash -220702884, now seen corresponding path program 1 times [2022-02-20 16:54:26,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:26,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065505519] [2022-02-20 16:54:26,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:26,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:26,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:54:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:26,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {1345#(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; {1326#true} is VALID [2022-02-20 16:54:26,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1326#true} is VALID [2022-02-20 16:54:26,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {1326#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; {1326#true} is VALID [2022-02-20 16:54:26,326 INFO L290 TraceCheckUtils]: 3: Hoare triple {1326#true} assume true; {1326#true} is VALID [2022-02-20 16:54:26,327 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1326#true} {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #144#return; {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:54:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:26,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {1345#(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; {1326#true} is VALID [2022-02-20 16:54:26,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1326#true} is VALID [2022-02-20 16:54:26,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {1326#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; {1326#true} is VALID [2022-02-20 16:54:26,339 INFO L290 TraceCheckUtils]: 3: Hoare triple {1326#true} assume true; {1326#true} is VALID [2022-02-20 16:54:26,339 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1326#true} {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #146#return; {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 16:54:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:26,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {1345#(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; {1326#true} is VALID [2022-02-20 16:54:26,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1326#true} is VALID [2022-02-20 16:54:26,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {1326#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; {1326#true} is VALID [2022-02-20 16:54:26,351 INFO L290 TraceCheckUtils]: 3: Hoare triple {1326#true} assume true; {1326#true} is VALID [2022-02-20 16:54:26,352 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1326#true} {1339#(<= 1 |ULTIMATE.start_dll_circular_insert_~index#1|)} #148#return; {1339#(<= 1 |ULTIMATE.start_dll_circular_insert_~index#1|)} is VALID [2022-02-20 16:54:26,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {1326#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); {1326#true} is VALID [2022-02-20 16:54:26,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#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_~mid_index~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; {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,354 INFO L272 TraceCheckUtils]: 2: Hoare triple {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {1345#(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:26,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {1345#(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; {1326#true} is VALID [2022-02-20 16:54:26,354 INFO L290 TraceCheckUtils]: 4: Hoare triple {1326#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1326#true} is VALID [2022-02-20 16:54:26,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {1326#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; {1326#true} is VALID [2022-02-20 16:54:26,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {1326#true} assume true; {1326#true} is VALID [2022-02-20 16:54:26,355 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1326#true} {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #144#return; {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#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; {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} assume !!(dll_circular_create_~len#1 > 1); {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,357 INFO L272 TraceCheckUtils]: 10: Hoare triple {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {1345#(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:26,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {1345#(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; {1326#true} is VALID [2022-02-20 16:54:26,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {1326#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1326#true} is VALID [2022-02-20 16:54:26,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {1326#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; {1326#true} is VALID [2022-02-20 16:54:26,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {1326#true} assume true; {1326#true} is VALID [2022-02-20 16:54:26,358 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1326#true} {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #146#return; {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 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); {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} 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); {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} 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; {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} assume !(dll_circular_create_~len#1 > 1); {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 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; {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {1328#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} main_#t~ret18#1.base, main_#t~ret18#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~ret18#1.base, main_#t~ret18#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret18#1.base, main_#t~ret18#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_circular_insert } true;dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset, dll_circular_insert_#in~data#1, dll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset, dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset, dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset, dll_circular_insert_#t~post12#1, dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset, dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, dll_circular_insert_~data#1, dll_circular_insert_~index#1, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset := dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset;dll_circular_insert_~data#1 := dll_circular_insert_#in~data#1;dll_circular_insert_~index#1 := dll_circular_insert_#in~index#1; {1339#(<= 1 |ULTIMATE.start_dll_circular_insert_~index#1|)} is VALID [2022-02-20 16:54:26,368 INFO L272 TraceCheckUtils]: 22: Hoare triple {1339#(<= 1 |ULTIMATE.start_dll_circular_insert_~index#1|)} call dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset := node_create(dll_circular_insert_~data#1); {1345#(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:26,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {1345#(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; {1326#true} is VALID [2022-02-20 16:54:26,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {1326#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1326#true} is VALID [2022-02-20 16:54:26,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {1326#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; {1326#true} is VALID [2022-02-20 16:54:26,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {1326#true} assume true; {1326#true} is VALID [2022-02-20 16:54:26,373 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1326#true} {1339#(<= 1 |ULTIMATE.start_dll_circular_insert_~index#1|)} #148#return; {1339#(<= 1 |ULTIMATE.start_dll_circular_insert_~index#1|)} is VALID [2022-02-20 16:54:26,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {1339#(<= 1 |ULTIMATE.start_dll_circular_insert_~index#1|)} dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset := dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset;havoc dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset; {1339#(<= 1 |ULTIMATE.start_dll_circular_insert_~index#1|)} is VALID [2022-02-20 16:54:26,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {1339#(<= 1 |ULTIMATE.start_dll_circular_insert_~index#1|)} assume !(dll_circular_insert_~index#1 > 0); {1327#false} is VALID [2022-02-20 16:54:26,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {1327#false} assume !(dll_circular_insert_~snd_to_last~0#1.base != 0 || dll_circular_insert_~snd_to_last~0#1.offset != 0);call dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4); {1327#false} is VALID [2022-02-20 16:54:26,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {1327#false} assume dll_circular_insert_#t~mem13#1.base != 0 || dll_circular_insert_#t~mem13#1.offset != 0;havoc dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset;call dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);call write~$Pointer$(dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, 4);havoc dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset;call dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);call write~$Pointer$(dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_~new_node~0#1.base, 4 + dll_circular_insert_~new_node~0#1.offset, 4);havoc dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset;call dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, 4);havoc dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset;call dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_#t~mem17#1.base, 4 + dll_circular_insert_#t~mem17#1.offset, 4);havoc dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset; {1327#false} is VALID [2022-02-20 16:54:26,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {1327#false} call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4); {1327#false} is VALID [2022-02-20 16:54:26,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {1327#false} assume { :end_inline_dll_circular_insert } true;call main_#t~mem19#1.base, main_#t~mem19#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~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;main_~count~0#1 := 0; {1327#false} is VALID [2022-02-20 16:54:26,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {1327#false} call main_#t~mem21#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {1327#false} is VALID [2022-02-20 16:54:26,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {1327#false} assume main_~data~0#1 != main_#t~mem21#1;havoc main_#t~mem21#1; {1327#false} is VALID [2022-02-20 16:54:26,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {1327#false} assume !false; {1327#false} is VALID [2022-02-20 16:54:26,381 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 16:54:26,381 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:26,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065505519] [2022-02-20 16:54:26,381 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065505519] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:26,381 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:26,381 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:54:26,381 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873340458] [2022-02-20 16:54:26,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:26,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2022-02-20 16:54:26,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:26,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:26,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:26,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:54:26,415 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:26,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:54:26,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:54:26,416 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:26,623 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2022-02-20 16:54:26,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:54:26,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2022-02-20 16:54:26,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:26,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-02-20 16:54:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-02-20 16:54:26,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-02-20 16:54:26,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:26,702 INFO L225 Difference]: With dead ends: 70 [2022-02-20 16:54:26,702 INFO L226 Difference]: Without dead ends: 53 [2022-02-20 16:54:26,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:54:26,703 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 28 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:26,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 109 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-20 16:54:26,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-02-20 16:54:26,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:26,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:26,732 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:26,732 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:26,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:26,734 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-02-20 16:54:26,734 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-02-20 16:54:26,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:26,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:26,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 53 states. [2022-02-20 16:54:26,736 INFO L87 Difference]: Start difference. First operand has 53 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 53 states. [2022-02-20 16:54:26,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:26,739 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-02-20 16:54:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-02-20 16:54:26,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:26,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:26,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:26,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2022-02-20 16:54:26,743 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 37 [2022-02-20 16:54:26,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:26,743 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2022-02-20 16:54:26,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-02-20 16:54:26,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 16:54:26,745 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:26,745 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 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:26,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 16:54:26,745 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:26,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:26,746 INFO L85 PathProgramCache]: Analyzing trace with hash 79364982, now seen corresponding path program 2 times [2022-02-20 16:54:26,746 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:26,746 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345456583] [2022-02-20 16:54:26,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:26,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:26,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:54:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:26,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {1640#(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; {1620#true} is VALID [2022-02-20 16:54:26,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {1620#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1620#true} is VALID [2022-02-20 16:54:26,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {1620#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; {1620#true} is VALID [2022-02-20 16:54:26,860 INFO L290 TraceCheckUtils]: 3: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-02-20 16:54:26,861 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1620#true} {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #144#return; {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:54:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:26,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {1640#(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; {1620#true} is VALID [2022-02-20 16:54:26,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {1620#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1620#true} is VALID [2022-02-20 16:54:26,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {1620#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; {1620#true} is VALID [2022-02-20 16:54:26,878 INFO L290 TraceCheckUtils]: 3: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-02-20 16:54:26,879 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1620#true} {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #146#return; {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 16:54:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:26,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {1640#(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; {1620#true} is VALID [2022-02-20 16:54:26,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {1620#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1620#true} is VALID [2022-02-20 16:54:26,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {1620#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; {1620#true} is VALID [2022-02-20 16:54:26,891 INFO L290 TraceCheckUtils]: 3: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-02-20 16:54:26,891 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1620#true} {1633#(<= |ULTIMATE.start_dll_circular_insert_~index#1| 1)} #148#return; {1633#(<= |ULTIMATE.start_dll_circular_insert_~index#1| 1)} is VALID [2022-02-20 16:54:26,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {1620#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); {1620#true} is VALID [2022-02-20 16:54:26,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {1620#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#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_~mid_index~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; {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,893 INFO L272 TraceCheckUtils]: 2: Hoare triple {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {1640#(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:26,893 INFO L290 TraceCheckUtils]: 3: Hoare triple {1640#(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; {1620#true} is VALID [2022-02-20 16:54:26,893 INFO L290 TraceCheckUtils]: 4: Hoare triple {1620#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1620#true} is VALID [2022-02-20 16:54:26,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {1620#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; {1620#true} is VALID [2022-02-20 16:54:26,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-02-20 16:54:26,895 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1620#true} {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #144#return; {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#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; {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} assume !!(dll_circular_create_~len#1 > 1); {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,897 INFO L272 TraceCheckUtils]: 10: Hoare triple {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {1640#(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:26,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {1640#(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; {1620#true} is VALID [2022-02-20 16:54:26,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {1620#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1620#true} is VALID [2022-02-20 16:54:26,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {1620#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; {1620#true} is VALID [2022-02-20 16:54:26,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-02-20 16:54:26,898 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1620#true} {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #146#return; {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 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); {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} 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); {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} 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; {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} assume !(dll_circular_create_~len#1 > 1); {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 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; {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:54:26,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {1622#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} main_#t~ret18#1.base, main_#t~ret18#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~ret18#1.base, main_#t~ret18#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret18#1.base, main_#t~ret18#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_circular_insert } true;dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset, dll_circular_insert_#in~data#1, dll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset, dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset, dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset, dll_circular_insert_#t~post12#1, dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset, dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, dll_circular_insert_~data#1, dll_circular_insert_~index#1, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset := dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset;dll_circular_insert_~data#1 := dll_circular_insert_#in~data#1;dll_circular_insert_~index#1 := dll_circular_insert_#in~index#1; {1633#(<= |ULTIMATE.start_dll_circular_insert_~index#1| 1)} is VALID [2022-02-20 16:54:26,902 INFO L272 TraceCheckUtils]: 22: Hoare triple {1633#(<= |ULTIMATE.start_dll_circular_insert_~index#1| 1)} call dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset := node_create(dll_circular_insert_~data#1); {1640#(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:26,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {1640#(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; {1620#true} is VALID [2022-02-20 16:54:26,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {1620#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1620#true} is VALID [2022-02-20 16:54:26,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {1620#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; {1620#true} is VALID [2022-02-20 16:54:26,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {1620#true} assume true; {1620#true} is VALID [2022-02-20 16:54:26,904 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1620#true} {1633#(<= |ULTIMATE.start_dll_circular_insert_~index#1| 1)} #148#return; {1633#(<= |ULTIMATE.start_dll_circular_insert_~index#1| 1)} is VALID [2022-02-20 16:54:26,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {1633#(<= |ULTIMATE.start_dll_circular_insert_~index#1| 1)} dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset := dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset;havoc dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset; {1633#(<= |ULTIMATE.start_dll_circular_insert_~index#1| 1)} is VALID [2022-02-20 16:54:26,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {1633#(<= |ULTIMATE.start_dll_circular_insert_~index#1| 1)} assume !!(dll_circular_insert_~index#1 > 0);dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;call dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset := read~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;havoc dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;dll_circular_insert_#t~post12#1 := dll_circular_insert_~index#1;dll_circular_insert_~index#1 := dll_circular_insert_#t~post12#1 - 1;havoc dll_circular_insert_#t~post12#1; {1639#(<= |ULTIMATE.start_dll_circular_insert_~index#1| 0)} is VALID [2022-02-20 16:54:26,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {1639#(<= |ULTIMATE.start_dll_circular_insert_~index#1| 0)} assume !!(dll_circular_insert_~index#1 > 0);dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;call dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset := read~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;havoc dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;dll_circular_insert_#t~post12#1 := dll_circular_insert_~index#1;dll_circular_insert_~index#1 := dll_circular_insert_#t~post12#1 - 1;havoc dll_circular_insert_#t~post12#1; {1621#false} is VALID [2022-02-20 16:54:26,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {1621#false} assume !(dll_circular_insert_~index#1 > 0); {1621#false} is VALID [2022-02-20 16:54:26,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {1621#false} assume dll_circular_insert_~snd_to_last~0#1.base != 0 || dll_circular_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~new_node~0#1.base, 4 + dll_circular_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~last~1#1.base, 4 + dll_circular_insert_~last~1#1.offset, 4); {1621#false} is VALID [2022-02-20 16:54:26,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {1621#false} assume { :end_inline_dll_circular_insert } true;call main_#t~mem19#1.base, main_#t~mem19#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~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;main_~count~0#1 := 0; {1621#false} is VALID [2022-02-20 16:54:26,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {1621#false} call main_#t~mem21#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {1621#false} is VALID [2022-02-20 16:54:26,906 INFO L290 TraceCheckUtils]: 35: Hoare triple {1621#false} assume main_~data~0#1 != main_#t~mem21#1;havoc main_#t~mem21#1; {1621#false} is VALID [2022-02-20 16:54:26,907 INFO L290 TraceCheckUtils]: 36: Hoare triple {1621#false} assume !false; {1621#false} is VALID [2022-02-20 16:54:26,907 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 16:54:26,907 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:26,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345456583] [2022-02-20 16:54:26,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345456583] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:26,908 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:26,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:54:26,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449877632] [2022-02-20 16:54:26,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:26,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2022-02-20 16:54:26,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:26,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:26,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:26,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:54:26,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:26,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:54:26,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:54:26,936 INFO L87 Difference]: Start difference. First operand 53 states and 70 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:27,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:27,158 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2022-02-20 16:54:27,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:54:27,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2022-02-20 16:54:27,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:27,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:27,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-02-20 16:54:27,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:27,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-02-20 16:54:27,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2022-02-20 16:54:27,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:27,225 INFO L225 Difference]: With dead ends: 71 [2022-02-20 16:54:27,225 INFO L226 Difference]: Without dead ends: 53 [2022-02-20 16:54:27,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:54:27,226 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 51 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:27,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 104 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:54:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-20 16:54:27,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-02-20 16:54:27,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:27,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:27,263 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:27,263 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:27,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:27,265 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-02-20 16:54:27,265 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-02-20 16:54:27,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:27,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:27,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 53 states. [2022-02-20 16:54:27,266 INFO L87 Difference]: Start difference. First operand has 53 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 53 states. [2022-02-20 16:54:27,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:27,267 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-02-20 16:54:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-02-20 16:54:27,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:27,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:27,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:27,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:27,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:27,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-02-20 16:54:27,270 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 37 [2022-02-20 16:54:27,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:27,270 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-02-20 16:54:27,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-02-20 16:54:27,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 16:54:27,270 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:27,271 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, 1, 1, 1, 1] [2022-02-20 16:54:27,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 16:54:27,271 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:27,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:27,271 INFO L85 PathProgramCache]: Analyzing trace with hash -599029201, now seen corresponding path program 1 times [2022-02-20 16:54:27,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:27,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680893740] [2022-02-20 16:54:27,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:27,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:27,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:54:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:27,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {1939#(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; {1919#true} is VALID [2022-02-20 16:54:27,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {1919#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1919#true} is VALID [2022-02-20 16:54:27,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:27,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {1919#true} assume true; {1919#true} is VALID [2022-02-20 16:54:27,429 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1919#true} {1919#true} #144#return; {1919#true} is VALID [2022-02-20 16:54:27,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:54:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:27,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {1939#(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; {1919#true} is VALID [2022-02-20 16:54:27,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {1919#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1919#true} is VALID [2022-02-20 16:54:27,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:27,437 INFO L290 TraceCheckUtils]: 3: Hoare triple {1919#true} assume true; {1919#true} is VALID [2022-02-20 16:54:27,437 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1919#true} {1919#true} #146#return; {1919#true} is VALID [2022-02-20 16:54:27,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 16:54:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:27,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {1939#(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; {1919#true} is VALID [2022-02-20 16:54:27,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {1919#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1919#true} is VALID [2022-02-20 16:54:27,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:27,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {1919#true} assume true; {1919#true} is VALID [2022-02-20 16:54:27,451 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1919#true} {1919#true} #148#return; {1919#true} is VALID [2022-02-20 16:54:27,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {1919#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); {1919#true} is VALID [2022-02-20 16:54:27,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {1919#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#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_~mid_index~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; {1919#true} is VALID [2022-02-20 16:54:27,453 INFO L272 TraceCheckUtils]: 2: Hoare triple {1919#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {1939#(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:27,453 INFO L290 TraceCheckUtils]: 3: Hoare triple {1939#(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; {1919#true} is VALID [2022-02-20 16:54:27,453 INFO L290 TraceCheckUtils]: 4: Hoare triple {1919#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1919#true} is VALID [2022-02-20 16:54:27,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:27,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {1919#true} assume true; {1919#true} is VALID [2022-02-20 16:54:27,459 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1919#true} {1919#true} #144#return; {1919#true} is VALID [2022-02-20 16:54:27,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:27,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {1919#true} assume !!(dll_circular_create_~len#1 > 1); {1919#true} is VALID [2022-02-20 16:54:27,460 INFO L272 TraceCheckUtils]: 10: Hoare triple {1919#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {1939#(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:27,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {1939#(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; {1919#true} is VALID [2022-02-20 16:54:27,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {1919#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1919#true} is VALID [2022-02-20 16:54:27,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:27,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {1919#true} assume true; {1919#true} is VALID [2022-02-20 16:54:27,461 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1919#true} {1919#true} #146#return; {1919#true} is VALID [2022-02-20 16:54:27,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {1919#true} 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); {1919#true} is VALID [2022-02-20 16:54:27,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {1919#true} 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); {1919#true} is VALID [2022-02-20 16:54:27,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {1919#true} 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; {1919#true} is VALID [2022-02-20 16:54:27,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {1919#true} assume !(dll_circular_create_~len#1 > 1); {1919#true} is VALID [2022-02-20 16:54:27,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {1919#true} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 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; {1919#true} is VALID [2022-02-20 16:54:27,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {1919#true} main_#t~ret18#1.base, main_#t~ret18#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~ret18#1.base, main_#t~ret18#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret18#1.base, main_#t~ret18#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_circular_insert } true;dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset, dll_circular_insert_#in~data#1, dll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset, dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset, dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset, dll_circular_insert_#t~post12#1, dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset, dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, dll_circular_insert_~data#1, dll_circular_insert_~index#1, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset := dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset;dll_circular_insert_~data#1 := dll_circular_insert_#in~data#1;dll_circular_insert_~index#1 := dll_circular_insert_#in~index#1; {1919#true} is VALID [2022-02-20 16:54:27,463 INFO L272 TraceCheckUtils]: 22: Hoare triple {1919#true} call dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset := node_create(dll_circular_insert_~data#1); {1939#(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:27,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {1939#(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; {1919#true} is VALID [2022-02-20 16:54:27,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {1919#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1919#true} is VALID [2022-02-20 16:54:27,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:27,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {1919#true} assume true; {1919#true} is VALID [2022-02-20 16:54:27,464 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1919#true} {1919#true} #148#return; {1919#true} is VALID [2022-02-20 16:54:27,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {1919#true} dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset := dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset;havoc dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset; {1936#(and (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~last~1#1.base|))} is VALID [2022-02-20 16:54:27,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {1936#(and (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~last~1#1.base|))} assume !!(dll_circular_insert_~index#1 > 0);dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;call dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset := read~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;havoc dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;dll_circular_insert_#t~post12#1 := dll_circular_insert_~index#1;dll_circular_insert_~index#1 := dll_circular_insert_#t~post12#1 - 1;havoc dll_circular_insert_#t~post12#1; {1937#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|))} is VALID [2022-02-20 16:54:27,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {1937#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|))} assume !(dll_circular_insert_~index#1 > 0); {1937#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|))} is VALID [2022-02-20 16:54:27,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {1937#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|))} assume !(dll_circular_insert_~snd_to_last~0#1.base != 0 || dll_circular_insert_~snd_to_last~0#1.offset != 0);call dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4); {1938#(and (= |ULTIMATE.start_dll_circular_insert_#t~mem13#1.offset| 0) (= 0 |ULTIMATE.start_dll_circular_insert_#t~mem13#1.base|))} is VALID [2022-02-20 16:54:27,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {1938#(and (= |ULTIMATE.start_dll_circular_insert_#t~mem13#1.offset| 0) (= 0 |ULTIMATE.start_dll_circular_insert_#t~mem13#1.base|))} assume dll_circular_insert_#t~mem13#1.base != 0 || dll_circular_insert_#t~mem13#1.offset != 0;havoc dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset;call dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);call write~$Pointer$(dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, 4);havoc dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset;call dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);call write~$Pointer$(dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_~new_node~0#1.base, 4 + dll_circular_insert_~new_node~0#1.offset, 4);havoc dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset;call dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, 4);havoc dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset;call dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_#t~mem17#1.base, 4 + dll_circular_insert_#t~mem17#1.offset, 4);havoc dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset; {1920#false} is VALID [2022-02-20 16:54:27,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {1920#false} call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4); {1920#false} is VALID [2022-02-20 16:54:27,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {1920#false} assume { :end_inline_dll_circular_insert } true;call main_#t~mem19#1.base, main_#t~mem19#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~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;main_~count~0#1 := 0; {1920#false} is VALID [2022-02-20 16:54:27,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {1920#false} call main_#t~mem21#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {1920#false} is VALID [2022-02-20 16:54:27,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {1920#false} assume main_~data~0#1 != main_#t~mem21#1;havoc main_#t~mem21#1; {1920#false} is VALID [2022-02-20 16:54:27,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {1920#false} assume !false; {1920#false} is VALID [2022-02-20 16:54:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 16:54:27,468 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:27,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680893740] [2022-02-20 16:54:27,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680893740] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:27,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233801031] [2022-02-20 16:54:27,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:27,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:27,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:27,472 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:27,499 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:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:27,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 16:54:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:27,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:27,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 16:54:28,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 16:54:28,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {1919#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); {1919#true} is VALID [2022-02-20 16:54:28,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {1919#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#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_~mid_index~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; {1919#true} is VALID [2022-02-20 16:54:28,016 INFO L272 TraceCheckUtils]: 2: Hoare triple {1919#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {1919#true} is VALID [2022-02-20 16:54:28,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:28,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {1919#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1919#true} is VALID [2022-02-20 16:54:28,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:28,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {1919#true} assume true; {1919#true} is VALID [2022-02-20 16:54:28,017 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1919#true} {1919#true} #144#return; {1919#true} is VALID [2022-02-20 16:54:28,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:28,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {1919#true} assume !!(dll_circular_create_~len#1 > 1); {1919#true} is VALID [2022-02-20 16:54:28,017 INFO L272 TraceCheckUtils]: 10: Hoare triple {1919#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {1919#true} is VALID [2022-02-20 16:54:28,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:28,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {1919#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1919#true} is VALID [2022-02-20 16:54:28,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:28,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {1919#true} assume true; {1919#true} is VALID [2022-02-20 16:54:28,018 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1919#true} {1919#true} #146#return; {1919#true} is VALID [2022-02-20 16:54:28,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {1919#true} 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); {1919#true} is VALID [2022-02-20 16:54:28,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {1919#true} 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); {1919#true} is VALID [2022-02-20 16:54:28,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {1919#true} 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; {1919#true} is VALID [2022-02-20 16:54:28,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {1919#true} assume !(dll_circular_create_~len#1 > 1); {1919#true} is VALID [2022-02-20 16:54:28,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {1919#true} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 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; {1919#true} is VALID [2022-02-20 16:54:28,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {1919#true} main_#t~ret18#1.base, main_#t~ret18#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~ret18#1.base, main_#t~ret18#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret18#1.base, main_#t~ret18#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_circular_insert } true;dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset, dll_circular_insert_#in~data#1, dll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset, dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset, dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset, dll_circular_insert_#t~post12#1, dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset, dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, dll_circular_insert_~data#1, dll_circular_insert_~index#1, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset := dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset;dll_circular_insert_~data#1 := dll_circular_insert_#in~data#1;dll_circular_insert_~index#1 := dll_circular_insert_#in~index#1; {1919#true} is VALID [2022-02-20 16:54:28,023 INFO L272 TraceCheckUtils]: 22: Hoare triple {1919#true} call dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset := node_create(dll_circular_insert_~data#1); {1919#true} is VALID [2022-02-20 16:54:28,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:28,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {1919#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1919#true} is VALID [2022-02-20 16:54:28,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:28,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {1919#true} assume true; {1919#true} is VALID [2022-02-20 16:54:28,024 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1919#true} {1919#true} #148#return; {1919#true} is VALID [2022-02-20 16:54:28,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {1919#true} dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset := dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset;havoc dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset; {1936#(and (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~last~1#1.base|))} is VALID [2022-02-20 16:54:28,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {1936#(and (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~last~1#1.base|))} assume !!(dll_circular_insert_~index#1 > 0);dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;call dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset := read~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;havoc dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;dll_circular_insert_#t~post12#1 := dll_circular_insert_~index#1;dll_circular_insert_~index#1 := dll_circular_insert_#t~post12#1 - 1;havoc dll_circular_insert_#t~post12#1; {1937#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|))} is VALID [2022-02-20 16:54:28,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {1937#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|))} assume !(dll_circular_insert_~index#1 > 0); {1937#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|))} is VALID [2022-02-20 16:54:28,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {1937#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|))} assume !(dll_circular_insert_~snd_to_last~0#1.base != 0 || dll_circular_insert_~snd_to_last~0#1.offset != 0);call dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4); {1938#(and (= |ULTIMATE.start_dll_circular_insert_#t~mem13#1.offset| 0) (= 0 |ULTIMATE.start_dll_circular_insert_#t~mem13#1.base|))} is VALID [2022-02-20 16:54:28,028 INFO L290 TraceCheckUtils]: 32: Hoare triple {1938#(and (= |ULTIMATE.start_dll_circular_insert_#t~mem13#1.offset| 0) (= 0 |ULTIMATE.start_dll_circular_insert_#t~mem13#1.base|))} assume dll_circular_insert_#t~mem13#1.base != 0 || dll_circular_insert_#t~mem13#1.offset != 0;havoc dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset;call dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);call write~$Pointer$(dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, 4);havoc dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset;call dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);call write~$Pointer$(dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_~new_node~0#1.base, 4 + dll_circular_insert_~new_node~0#1.offset, 4);havoc dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset;call dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, 4);havoc dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset;call dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_#t~mem17#1.base, 4 + dll_circular_insert_#t~mem17#1.offset, 4);havoc dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset; {1920#false} is VALID [2022-02-20 16:54:28,028 INFO L290 TraceCheckUtils]: 33: Hoare triple {1920#false} call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4); {1920#false} is VALID [2022-02-20 16:54:28,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {1920#false} assume { :end_inline_dll_circular_insert } true;call main_#t~mem19#1.base, main_#t~mem19#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~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;main_~count~0#1 := 0; {1920#false} is VALID [2022-02-20 16:54:28,032 INFO L290 TraceCheckUtils]: 35: Hoare triple {1920#false} call main_#t~mem21#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {1920#false} is VALID [2022-02-20 16:54:28,032 INFO L290 TraceCheckUtils]: 36: Hoare triple {1920#false} assume main_~data~0#1 != main_#t~mem21#1;havoc main_#t~mem21#1; {1920#false} is VALID [2022-02-20 16:54:28,032 INFO L290 TraceCheckUtils]: 37: Hoare triple {1920#false} assume !false; {1920#false} is VALID [2022-02-20 16:54:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 16:54:28,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:54:28,181 INFO L290 TraceCheckUtils]: 37: Hoare triple {1920#false} assume !false; {1920#false} is VALID [2022-02-20 16:54:28,181 INFO L290 TraceCheckUtils]: 36: Hoare triple {1920#false} assume main_~data~0#1 != main_#t~mem21#1;havoc main_#t~mem21#1; {1920#false} is VALID [2022-02-20 16:54:28,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {1920#false} call main_#t~mem21#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {1920#false} is VALID [2022-02-20 16:54:28,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {1920#false} assume { :end_inline_dll_circular_insert } true;call main_#t~mem19#1.base, main_#t~mem19#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~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;main_~count~0#1 := 0; {1920#false} is VALID [2022-02-20 16:54:28,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {1920#false} call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4); {1920#false} is VALID [2022-02-20 16:54:28,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {1938#(and (= |ULTIMATE.start_dll_circular_insert_#t~mem13#1.offset| 0) (= 0 |ULTIMATE.start_dll_circular_insert_#t~mem13#1.base|))} assume dll_circular_insert_#t~mem13#1.base != 0 || dll_circular_insert_#t~mem13#1.offset != 0;havoc dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset;call dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);call write~$Pointer$(dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, 4);havoc dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset;call dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);call write~$Pointer$(dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_~new_node~0#1.base, 4 + dll_circular_insert_~new_node~0#1.offset, 4);havoc dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset;call dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, 4);havoc dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset;call dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_#t~mem17#1.base, 4 + dll_circular_insert_#t~mem17#1.offset, 4);havoc dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset; {1920#false} is VALID [2022-02-20 16:54:28,189 INFO L290 TraceCheckUtils]: 31: Hoare triple {2072#(or (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0)) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 0)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0)))} assume !(dll_circular_insert_~snd_to_last~0#1.base != 0 || dll_circular_insert_~snd_to_last~0#1.offset != 0);call dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4); {1938#(and (= |ULTIMATE.start_dll_circular_insert_#t~mem13#1.offset| 0) (= 0 |ULTIMATE.start_dll_circular_insert_#t~mem13#1.base|))} is VALID [2022-02-20 16:54:28,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {2072#(or (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0)) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 0)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0)))} assume !(dll_circular_insert_~index#1 > 0); {2072#(or (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0)) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 0)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0)))} is VALID [2022-02-20 16:54:28,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {2079#(or (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| 0)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0)))} assume !!(dll_circular_insert_~index#1 > 0);dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;call dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset := read~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;havoc dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;dll_circular_insert_#t~post12#1 := dll_circular_insert_~index#1;dll_circular_insert_~index#1 := dll_circular_insert_#t~post12#1 - 1;havoc dll_circular_insert_#t~post12#1; {2072#(or (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0)) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 0)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0)))} is VALID [2022-02-20 16:54:28,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {1919#true} dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset := dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset;havoc dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset; {2079#(or (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| 0)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0)))} is VALID [2022-02-20 16:54:28,191 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1919#true} {1919#true} #148#return; {1919#true} is VALID [2022-02-20 16:54:28,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {1919#true} assume true; {1919#true} is VALID [2022-02-20 16:54:28,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:28,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {1919#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1919#true} is VALID [2022-02-20 16:54:28,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:28,192 INFO L272 TraceCheckUtils]: 22: Hoare triple {1919#true} call dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset := node_create(dll_circular_insert_~data#1); {1919#true} is VALID [2022-02-20 16:54:28,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {1919#true} main_#t~ret18#1.base, main_#t~ret18#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~ret18#1.base, main_#t~ret18#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret18#1.base, main_#t~ret18#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_circular_insert } true;dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset, dll_circular_insert_#in~data#1, dll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset, dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset, dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset, dll_circular_insert_#t~post12#1, dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset, dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, dll_circular_insert_~data#1, dll_circular_insert_~index#1, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset := dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset;dll_circular_insert_~data#1 := dll_circular_insert_#in~data#1;dll_circular_insert_~index#1 := dll_circular_insert_#in~index#1; {1919#true} is VALID [2022-02-20 16:54:28,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {1919#true} call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset, 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; {1919#true} is VALID [2022-02-20 16:54:28,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {1919#true} assume !(dll_circular_create_~len#1 > 1); {1919#true} is VALID [2022-02-20 16:54:28,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {1919#true} 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; {1919#true} is VALID [2022-02-20 16:54:28,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {1919#true} 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); {1919#true} is VALID [2022-02-20 16:54:28,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {1919#true} 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); {1919#true} is VALID [2022-02-20 16:54:28,193 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1919#true} {1919#true} #146#return; {1919#true} is VALID [2022-02-20 16:54:28,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {1919#true} assume true; {1919#true} is VALID [2022-02-20 16:54:28,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:28,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {1919#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1919#true} is VALID [2022-02-20 16:54:28,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:28,193 INFO L272 TraceCheckUtils]: 10: Hoare triple {1919#true} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {1919#true} is VALID [2022-02-20 16:54:28,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {1919#true} assume !!(dll_circular_create_~len#1 > 1); {1919#true} is VALID [2022-02-20 16:54:28,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:28,194 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1919#true} {1919#true} #144#return; {1919#true} is VALID [2022-02-20 16:54:28,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {1919#true} assume true; {1919#true} is VALID [2022-02-20 16:54:28,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:28,194 INFO L290 TraceCheckUtils]: 4: Hoare triple {1919#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1919#true} is VALID [2022-02-20 16:54:28,194 INFO L290 TraceCheckUtils]: 3: Hoare triple {1919#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; {1919#true} is VALID [2022-02-20 16:54:28,195 INFO L272 TraceCheckUtils]: 2: Hoare triple {1919#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {1919#true} is VALID [2022-02-20 16:54:28,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {1919#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#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_~mid_index~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; {1919#true} is VALID [2022-02-20 16:54:28,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {1919#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); {1919#true} is VALID [2022-02-20 16:54:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 16:54:28,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233801031] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:54:28,197 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:54:28,197 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-02-20 16:54:28,197 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550611481] [2022-02-20 16:54:28,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:54:28,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-02-20 16:54:28,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:28,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:54:28,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:28,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:54:28,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:28,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:54:28,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:54:28,235 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:54:28,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:28,615 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-02-20 16:54:28,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:54:28,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-02-20 16:54:28,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:28,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:54:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-02-20 16:54:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:54:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-02-20 16:54:28,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 84 transitions. [2022-02-20 16:54:28,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:28,682 INFO L225 Difference]: With dead ends: 82 [2022-02-20 16:54:28,682 INFO L226 Difference]: Without dead ends: 67 [2022-02-20 16:54:28,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:54:28,683 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 20 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:28,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 194 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:54:28,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-20 16:54:28,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2022-02-20 16:54:28,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:28,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 53 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:28,716 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 53 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:28,716 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 53 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:28,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:28,717 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2022-02-20 16:54:28,717 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-02-20 16:54:28,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:28,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:28,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 67 states. [2022-02-20 16:54:28,718 INFO L87 Difference]: Start difference. First operand has 53 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 67 states. [2022-02-20 16:54:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:28,720 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2022-02-20 16:54:28,720 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-02-20 16:54:28,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:28,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:28,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:28,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-02-20 16:54:28,723 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 38 [2022-02-20 16:54:28,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:28,723 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-02-20 16:54:28,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 16:54:28,723 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-02-20 16:54:28,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 16:54:28,724 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:28,724 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, 1, 1, 1, 1] [2022-02-20 16:54:28,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:54:28,939 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,SelfDestructingSolverStorable6 [2022-02-20 16:54:28,939 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:28,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:28,940 INFO L85 PathProgramCache]: Analyzing trace with hash -541770899, now seen corresponding path program 1 times [2022-02-20 16:54:28,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:28,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708631957] [2022-02-20 16:54:28,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:28,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:29,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:54:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:29,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {2507#(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; {2481#true} is VALID [2022-02-20 16:54:29,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {2481#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2481#true} is VALID [2022-02-20 16:54:29,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {2481#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; {2481#true} is VALID [2022-02-20 16:54:29,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {2481#true} assume true; {2481#true} is VALID [2022-02-20 16:54:29,131 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2481#true} {2483#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #144#return; {2483#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:54:29,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:54:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:29,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {2507#(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; {2508#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:54:29,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {2508#(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); {2508#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:54:29,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {2508#(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; {2509#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:54:29,180 INFO L290 TraceCheckUtils]: 3: Hoare triple {2509#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} assume true; {2509#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:54:29,181 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2509#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} {2483#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #146#return; {2494#(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:54:29,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 16:54:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:29,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {2507#(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; {2510#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:54:29,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {2510#(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); {2510#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:54:29,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {2510#(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; {2511#(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:54:29,248 INFO L290 TraceCheckUtils]: 3: Hoare triple {2511#(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; {2511#(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:54:29,250 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2511#(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|)))))} {2498#(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_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} #148#return; {2504#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0)))} is VALID [2022-02-20 16:54:29,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {2481#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); {2481#true} is VALID [2022-02-20 16:54:29,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {2481#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#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_~mid_index~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; {2483#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:54:29,252 INFO L272 TraceCheckUtils]: 2: Hoare triple {2483#(<= (+ |#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); {2507#(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:29,253 INFO L290 TraceCheckUtils]: 3: Hoare triple {2507#(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; {2481#true} is VALID [2022-02-20 16:54:29,253 INFO L290 TraceCheckUtils]: 4: Hoare triple {2481#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2481#true} is VALID [2022-02-20 16:54:29,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {2481#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; {2481#true} is VALID [2022-02-20 16:54:29,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {2481#true} assume true; {2481#true} is VALID [2022-02-20 16:54:29,254 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2481#true} {2483#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #144#return; {2483#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:54:29,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {2483#(<= (+ |#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; {2483#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:54:29,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {2483#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !!(dll_circular_create_~len#1 > 1); {2483#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:54:29,256 INFO L272 TraceCheckUtils]: 10: Hoare triple {2483#(<= (+ |#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); {2507#(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:29,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {2507#(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; {2508#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:54:29,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {2508#(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); {2508#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:54:29,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {2508#(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; {2509#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:54:29,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {2509#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} assume true; {2509#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:54:29,260 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2509#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} {2483#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #146#return; {2494#(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:54:29,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {2494#(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); {2495#(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:54:29,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {2495#(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); {2495#(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:54:29,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {2495#(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; {2496#(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:54:29,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {2496#(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); {2496#(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:54:29,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {2496#(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; {2497#(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:54:29,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {2497#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#res#1.base| 0)))} main_#t~ret18#1.base, main_#t~ret18#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~ret18#1.base, main_#t~ret18#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret18#1.base, main_#t~ret18#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_circular_insert } true;dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset, dll_circular_insert_#in~data#1, dll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset, dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset, dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset, dll_circular_insert_#t~post12#1, dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset, dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, dll_circular_insert_~data#1, dll_circular_insert_~index#1, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset := dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset;dll_circular_insert_~data#1 := dll_circular_insert_#in~data#1;dll_circular_insert_~index#1 := dll_circular_insert_#in~index#1; {2498#(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_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:54:29,265 INFO L272 TraceCheckUtils]: 22: Hoare triple {2498#(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_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} call dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset := node_create(dll_circular_insert_~data#1); {2507#(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:29,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {2507#(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; {2510#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:54:29,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {2510#(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); {2510#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:54:29,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {2510#(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; {2511#(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:54:29,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {2511#(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; {2511#(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:54:29,271 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2511#(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|)))))} {2498#(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_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} #148#return; {2504#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0)))} is VALID [2022-02-20 16:54:29,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {2504#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0)))} dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset := dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset;havoc dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset; {2505#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| 0)))} is VALID [2022-02-20 16:54:29,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {2505#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| 0)))} assume !!(dll_circular_insert_~index#1 > 0);dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;call dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset := read~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;havoc dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;dll_circular_insert_#t~post12#1 := dll_circular_insert_~index#1;dll_circular_insert_~index#1 := dll_circular_insert_#t~post12#1 - 1;havoc dll_circular_insert_#t~post12#1; {2506#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 0)))} is VALID [2022-02-20 16:54:29,273 INFO L290 TraceCheckUtils]: 30: Hoare triple {2506#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 0)))} assume !(dll_circular_insert_~index#1 > 0); {2506#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 0)))} is VALID [2022-02-20 16:54:29,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {2506#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 0)))} assume !(dll_circular_insert_~snd_to_last~0#1.base != 0 || dll_circular_insert_~snd_to_last~0#1.offset != 0);call dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4); {2482#false} is VALID [2022-02-20 16:54:29,274 INFO L290 TraceCheckUtils]: 32: Hoare triple {2482#false} assume !(dll_circular_insert_#t~mem13#1.base != 0 || dll_circular_insert_#t~mem13#1.offset != 0);havoc dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset;call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~new_node~0#1.base, 4 + dll_circular_insert_~new_node~0#1.offset, 4); {2482#false} is VALID [2022-02-20 16:54:29,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {2482#false} call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4); {2482#false} is VALID [2022-02-20 16:54:29,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {2482#false} assume { :end_inline_dll_circular_insert } true;call main_#t~mem19#1.base, main_#t~mem19#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~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;main_~count~0#1 := 0; {2482#false} is VALID [2022-02-20 16:54:29,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {2482#false} call main_#t~mem21#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {2482#false} is VALID [2022-02-20 16:54:29,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {2482#false} assume main_~data~0#1 != main_#t~mem21#1;havoc main_#t~mem21#1; {2482#false} is VALID [2022-02-20 16:54:29,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {2482#false} assume !false; {2482#false} is VALID [2022-02-20 16:54:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:54:29,275 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:29,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708631957] [2022-02-20 16:54:29,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708631957] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:29,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472439495] [2022-02-20 16:54:29,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:29,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:29,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:29,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:54:29,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 16:54:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:29,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 34 conjunts are in the unsatisfiable core [2022-02-20 16:54:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:29,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:29,913 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:54:29,988 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_2639 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2639) |c_#memory_$Pointer$.base|)))) is different from true [2022-02-20 16:54:30,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:30,097 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:54:30,140 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:54:30,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {2481#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); {2481#true} is VALID [2022-02-20 16:54:30,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {2481#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#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_~mid_index~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; {2518#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:54:30,202 INFO L272 TraceCheckUtils]: 2: Hoare triple {2518#(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); {2481#true} is VALID [2022-02-20 16:54:30,202 INFO L290 TraceCheckUtils]: 3: Hoare triple {2481#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; {2481#true} is VALID [2022-02-20 16:54:30,202 INFO L290 TraceCheckUtils]: 4: Hoare triple {2481#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2481#true} is VALID [2022-02-20 16:54:30,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {2481#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; {2481#true} is VALID [2022-02-20 16:54:30,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {2481#true} assume true; {2481#true} is VALID [2022-02-20 16:54:30,203 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2481#true} {2518#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} #144#return; {2518#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:54:30,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {2518#(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; {2518#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:54:30,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {2518#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(dll_circular_create_~len#1 > 1); {2518#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:54:30,204 INFO L272 TraceCheckUtils]: 10: Hoare triple {2518#(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); {2481#true} is VALID [2022-02-20 16:54:30,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {2481#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; {2508#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:54:30,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {2508#(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); {2508#(or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0))} is VALID [2022-02-20 16:54:30,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {2508#(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; {2509#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:54:30,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {2509#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} assume true; {2509#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} is VALID [2022-02-20 16:54:30,207 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2509#(or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|))} {2518#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} #146#return; {2561#(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:54:30,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {2561#(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); {2565#(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:54:30,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {2565#(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); {2565#(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:54:30,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {2565#(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; {2572#(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:54:30,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {2572#(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); {2572#(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:54:30,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {2572#(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; {2579#(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:54:30,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {2579#(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~ret18#1.base, main_#t~ret18#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~ret18#1.base, main_#t~ret18#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret18#1.base, main_#t~ret18#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_circular_insert } true;dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset, dll_circular_insert_#in~data#1, dll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset, dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset, dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset, dll_circular_insert_#t~post12#1, dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset, dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, dll_circular_insert_~data#1, dll_circular_insert_~index#1, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset := dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset;dll_circular_insert_~data#1 := dll_circular_insert_#in~data#1;dll_circular_insert_~index#1 := dll_circular_insert_#in~index#1; {2583#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (< |#StackHeapBarrier| |ULTIMATE.start_dll_circular_insert_~head#1.base|) (or (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 0) 1) 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 0))))} is VALID [2022-02-20 16:54:30,213 INFO L272 TraceCheckUtils]: 22: Hoare triple {2583#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (< |#StackHeapBarrier| |ULTIMATE.start_dll_circular_insert_~head#1.base|) (or (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 0) 1) 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 0))))} call dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset := node_create(dll_circular_insert_~data#1); {2587#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)} is VALID [2022-02-20 16:54:30,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {2587#(= |#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; {2510#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:54:30,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {2510#(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); {2510#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:54:30,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {2510#(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; {2597#(exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (exists ((v_ArrVal_2639 (Array Int Int))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2639)))))} is VALID [2022-02-20 16:54:30,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {2597#(exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (exists ((v_ArrVal_2639 (Array Int Int))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2639)))))} assume true; {2597#(exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (exists ((v_ArrVal_2639 (Array Int Int))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2639)))))} is VALID [2022-02-20 16:54:30,218 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2597#(exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (exists ((v_ArrVal_2639 (Array Int Int))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2639)))))} {2583#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (< |#StackHeapBarrier| |ULTIMATE.start_dll_circular_insert_~head#1.base|) (or (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 0) 1) 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 0))))} #148#return; {2604#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (or (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 0) 1) 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 0))))} is VALID [2022-02-20 16:54:30,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {2604#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (or (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 0) 1) 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) 0))))} dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset := dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset;havoc dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset; {2608#(or (<= 1 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (<= (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.base| 1) 0))} is VALID [2022-02-20 16:54:30,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {2608#(or (<= 1 |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (<= (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.base| 1) 0))} assume !!(dll_circular_insert_~index#1 > 0);dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;call dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset := read~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;havoc dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;dll_circular_insert_#t~post12#1 := dll_circular_insert_~index#1;dll_circular_insert_~index#1 := dll_circular_insert_#t~post12#1 - 1;havoc dll_circular_insert_#t~post12#1; {2612#(or (<= (+ |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 1) 0) (<= 1 |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|))} is VALID [2022-02-20 16:54:30,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {2612#(or (<= (+ |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 1) 0) (<= 1 |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|))} assume !(dll_circular_insert_~index#1 > 0); {2612#(or (<= (+ |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 1) 0) (<= 1 |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|))} is VALID [2022-02-20 16:54:30,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {2612#(or (<= (+ |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 1) 0) (<= 1 |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|))} assume !(dll_circular_insert_~snd_to_last~0#1.base != 0 || dll_circular_insert_~snd_to_last~0#1.offset != 0);call dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4); {2482#false} is VALID [2022-02-20 16:54:30,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {2482#false} assume !(dll_circular_insert_#t~mem13#1.base != 0 || dll_circular_insert_#t~mem13#1.offset != 0);havoc dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset;call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~new_node~0#1.base, 4 + dll_circular_insert_~new_node~0#1.offset, 4); {2482#false} is VALID [2022-02-20 16:54:30,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {2482#false} call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4); {2482#false} is VALID [2022-02-20 16:54:30,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {2482#false} assume { :end_inline_dll_circular_insert } true;call main_#t~mem19#1.base, main_#t~mem19#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~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;main_~count~0#1 := 0; {2482#false} is VALID [2022-02-20 16:54:30,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {2482#false} call main_#t~mem21#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {2482#false} is VALID [2022-02-20 16:54:30,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {2482#false} assume main_~data~0#1 != main_#t~mem21#1;havoc main_#t~mem21#1; {2482#false} is VALID [2022-02-20 16:54:30,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {2482#false} assume !false; {2482#false} is VALID [2022-02-20 16:54:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-02-20 16:54:30,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:54:30,428 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_19| Int) (v_ArrVal_2642 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_19| v_ArrVal_2642) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (not (< |v_node_create_~temp~0#1.base_19| |c_#StackHeapBarrier|)) (<= 1 .cse0)))) is different from false [2022-02-20 16:54:30,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472439495] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:30,430 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:54:30,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2022-02-20 16:54:30,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636585762] [2022-02-20 16:54:30,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:54:30,431 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.0) internal successors, (50), 21 states have internal predecessors, (50), 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 38 [2022-02-20 16:54:30,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:30,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 27 states, 25 states have (on average 2.0) internal successors, (50), 21 states have internal predecessors, (50), 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:30,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:30,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-20 16:54:30,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:30,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-20 16:54:30,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=622, Unknown=2, NotChecked=102, Total=812 [2022-02-20 16:54:30,511 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 27 states, 25 states have (on average 2.0) internal successors, (50), 21 states have internal predecessors, (50), 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:31,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:31,631 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2022-02-20 16:54:31,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 16:54:31,631 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.0) internal successors, (50), 21 states have internal predecessors, (50), 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 38 [2022-02-20 16:54:31,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:31,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 2.0) internal successors, (50), 21 states have internal predecessors, (50), 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:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 67 transitions. [2022-02-20 16:54:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 2.0) internal successors, (50), 21 states have internal predecessors, (50), 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:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 67 transitions. [2022-02-20 16:54:31,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 67 transitions. [2022-02-20 16:54:31,690 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:31,691 INFO L225 Difference]: With dead ends: 67 [2022-02-20 16:54:31,691 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 16:54:31,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=1041, Unknown=2, NotChecked=134, Total=1332 [2022-02-20 16:54:31,692 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 67 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:31,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 374 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 276 Invalid, 0 Unknown, 42 Unchecked, 0.3s Time] [2022-02-20 16:54:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 16:54:31,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-20 16:54:31,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:31,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:31,753 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:31,753 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:31,755 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-02-20 16:54:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-02-20 16:54:31,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:31,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:31,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-02-20 16:54:31,756 INFO L87 Difference]: Start difference. First operand has 51 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-02-20 16:54:31,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:31,757 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-02-20 16:54:31,757 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-02-20 16:54:31,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:31,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:31,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:31,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 16:54:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-02-20 16:54:31,759 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 38 [2022-02-20 16:54:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:31,760 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-02-20 16:54:31,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.0) internal successors, (50), 21 states have internal predecessors, (50), 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:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-02-20 16:54:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 16:54:31,760 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:31,760 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, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:31,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 16:54:31,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:31,979 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:31,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:31,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1955198847, now seen corresponding path program 1 times [2022-02-20 16:54:31,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:31,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469501304] [2022-02-20 16:54:31,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:31,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:32,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:54:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:32,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {2981#(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; {2982#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0))} is VALID [2022-02-20 16:54:32,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {2982#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2982#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0))} is VALID [2022-02-20 16:54:32,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {2982#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 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; {2983#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:32,859 INFO L290 TraceCheckUtils]: 3: Hoare triple {2983#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {2983#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:32,860 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2983#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {2950#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #144#return; {2956#(and (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| 0) (<= (+ |#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:32,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:54:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:32,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {2981#(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; {2984#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:32,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {2984#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2984#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:32,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {2984#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} 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; {2985#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:32,969 INFO L290 TraceCheckUtils]: 3: Hoare triple {2985#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {2985#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:32,971 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2985#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {2957#(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|)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} #146#return; {2963#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret5#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_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} is VALID [2022-02-20 16:54:32,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 16:54:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:33,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {2981#(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; {2986#(and (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:33,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {2986#(and (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2986#(and (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:33,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {2986#(and (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 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; {2987#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (or (= |node_create_#res#1.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |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|)) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (= 0 |node_create_#res#1.offset|) (= |#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:33,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {2987#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (or (= |node_create_#res#1.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |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|)) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (= 0 |node_create_#res#1.offset|) (= |#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; {2987#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (or (= |node_create_#res#1.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |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|)) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (= 0 |node_create_#res#1.offset|) (= |#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:33,171 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2987#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (or (= |node_create_#res#1.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |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|)) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (= 0 |node_create_#res#1.offset|) (= |#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|)))))} {2968#(and (<= |ULTIMATE.start_main_~uneq~0#1| |ULTIMATE.start_dll_circular_insert_~data#1|) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0)) 1) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= |ULTIMATE.start_dll_circular_insert_~data#1| |ULTIMATE.start_main_~uneq~0#1|) (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|)) 0) (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) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 0) (not (= |ULTIMATE.start_dll_circular_insert_~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|)) 0))) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} #148#return; {2974#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 0) |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 0) 0) (= |ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 0) |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:54:33,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {2948#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); {2948#true} is VALID [2022-02-20 16:54:33,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {2948#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#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_~mid_index~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; {2950#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:54:33,173 INFO L272 TraceCheckUtils]: 2: Hoare triple {2950#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 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); {2981#(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:33,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {2981#(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; {2982#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0))} is VALID [2022-02-20 16:54:33,174 INFO L290 TraceCheckUtils]: 4: Hoare triple {2982#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2982#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0))} is VALID [2022-02-20 16:54:33,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {2982#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 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; {2983#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:33,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {2983#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {2983#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:33,176 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2983#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {2950#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|))} #144#return; {2956#(and (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| 0) (<= (+ |#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:33,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {2956#(and (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| 0) (<= (+ |#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; {2957#(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|)) (= |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:33,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {2957#(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|)) (= |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); {2957#(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|)) (= |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:33,178 INFO L272 TraceCheckUtils]: 10: Hoare triple {2957#(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|)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {2981#(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:33,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {2981#(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; {2984#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:33,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {2984#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2984#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:33,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {2984#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#valid| (store |old(#valid)| |node_create_~temp~0#1.base| (select |#valid| |node_create_~temp~0#1.base|))) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} 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; {2985#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:33,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {2985#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {2985#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:54:33,182 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2985#(and (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1))} {2957#(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|)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))} #146#return; {2963#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret5#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_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} is VALID [2022-02-20 16:54:33,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {2963#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret5#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_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)))} dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset := dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;havoc dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset;call write~$Pointer$(dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset, dll_circular_create_~new_head~0#1.base, dll_circular_create_~new_head~0#1.offset, 4); {2964#(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|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |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|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~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))} is VALID [2022-02-20 16:54:33,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {2964#(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|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |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|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~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))} 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); {2965#(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|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |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|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 16:54:33,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {2965#(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|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |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|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))} 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; {2966#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (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:33,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {2966#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (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); {2966#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (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:33,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {2966#(and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (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; {2967#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base|) 0) 0) (not (= |ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 0) |ULTIMATE.start_main_~#s~0#1.base|)) (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:33,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {2967#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#res#1.base|) 0) 0) (not (= |ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 0)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 0) |ULTIMATE.start_main_~#s~0#1.base|)) (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~ret18#1.base, main_#t~ret18#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~ret18#1.base, main_#t~ret18#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret18#1.base, main_#t~ret18#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_circular_insert } true;dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset, dll_circular_insert_#in~data#1, dll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset, dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset, dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset, dll_circular_insert_#t~post12#1, dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset, dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, dll_circular_insert_~data#1, dll_circular_insert_~index#1, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset := dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset;dll_circular_insert_~data#1 := dll_circular_insert_#in~data#1;dll_circular_insert_~index#1 := dll_circular_insert_#in~index#1; {2968#(and (<= |ULTIMATE.start_main_~uneq~0#1| |ULTIMATE.start_dll_circular_insert_~data#1|) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0)) 1) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= |ULTIMATE.start_dll_circular_insert_~data#1| |ULTIMATE.start_main_~uneq~0#1|) (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|)) 0) (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) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 0) (not (= |ULTIMATE.start_dll_circular_insert_~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|)) 0))) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:54:33,198 INFO L272 TraceCheckUtils]: 22: Hoare triple {2968#(and (<= |ULTIMATE.start_main_~uneq~0#1| |ULTIMATE.start_dll_circular_insert_~data#1|) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0)) 1) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= |ULTIMATE.start_dll_circular_insert_~data#1| |ULTIMATE.start_main_~uneq~0#1|) (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|)) 0) (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) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 0) (not (= |ULTIMATE.start_dll_circular_insert_~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|)) 0))) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} call dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset := node_create(dll_circular_insert_~data#1); {2981#(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:33,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {2981#(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; {2986#(and (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:33,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {2986#(and (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2986#(and (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:54:33,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {2986#(and (= |node_create_~data#1| |node_create_#in~data#1|) (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |node_create_~temp~0#1.offset| 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 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; {2987#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (or (= |node_create_#res#1.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |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|)) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (= 0 |node_create_#res#1.offset|) (= |#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:33,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {2987#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (or (= |node_create_#res#1.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |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|)) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (= 0 |node_create_#res#1.offset|) (= |#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; {2987#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (or (= |node_create_#res#1.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |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|)) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (= 0 |node_create_#res#1.offset|) (= |#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:33,206 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2987#(and (= (select (select |#memory_int| |node_create_#res#1.base|) 8) |node_create_#in~data#1|) (or (= |node_create_#res#1.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (<= (+ |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|)) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)))) (= 0 |node_create_#res#1.offset|) (= |#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|)))))} {2968#(and (<= |ULTIMATE.start_main_~uneq~0#1| |ULTIMATE.start_dll_circular_insert_~data#1|) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0)) 1) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= |ULTIMATE.start_dll_circular_insert_~data#1| |ULTIMATE.start_main_~uneq~0#1|) (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|)) 0) (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) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_circular_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) 0) (not (= |ULTIMATE.start_dll_circular_insert_~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|)) 0))) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} #148#return; {2974#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 0) |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 0) 0) (= |ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 0) |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:54:33,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {2974#(and (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 0) |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 8)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 0) 0) (= |ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 0) |ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset := dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := 0, 0;call dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset;havoc dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset; {2975#(and (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)))} is VALID [2022-02-20 16:54:33,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {2975#(and (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)))} assume !!(dll_circular_insert_~index#1 > 0);dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;call dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset := read~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, 4);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;havoc dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset;dll_circular_insert_#t~post12#1 := dll_circular_insert_~index#1;dll_circular_insert_~index#1 := dll_circular_insert_#t~post12#1 - 1;havoc dll_circular_insert_#t~post12#1; {2976#(and (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))} is VALID [2022-02-20 16:54:33,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {2976#(and (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))} assume !(dll_circular_insert_~index#1 > 0); {2976#(and (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))} is VALID [2022-02-20 16:54:33,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {2976#(and (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))} assume dll_circular_insert_~snd_to_last~0#1.base != 0 || dll_circular_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~new_node~0#1.base, 4 + dll_circular_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~last~1#1.base, 4 + dll_circular_insert_~last~1#1.offset, 4); {2977#(= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8)))} is VALID [2022-02-20 16:54:33,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {2977#(= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8)))} assume { :end_inline_dll_circular_insert } true;call main_#t~mem19#1.base, main_#t~mem19#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~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;main_~count~0#1 := 0; {2978#(= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|)) (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))))} is VALID [2022-02-20 16:54:33,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {2978#(= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|)) (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))))} call main_#t~mem21#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {2978#(= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|)) (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))))} is VALID [2022-02-20 16:54:33,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {2978#(= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|)) (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))))} assume !(main_~data~0#1 != main_#t~mem21#1);havoc main_#t~mem21#1;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~ptr~0#1.base, main_~ptr~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;main_#t~post23#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post23#1;havoc main_#t~post23#1; {2979#(= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8)))} is VALID [2022-02-20 16:54:33,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {2979#(= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8)))} call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2979#(= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8)))} is VALID [2022-02-20 16:54:33,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {2979#(= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8)))} assume !((main_~ptr~0#1.base != main_#t~mem20#1.base || main_~ptr~0#1.offset != main_#t~mem20#1.offset) && main_~count~0#1 != main_~mid_index~0#1);havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {2979#(= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8)))} is VALID [2022-02-20 16:54:33,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {2979#(= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8)))} call main_#t~mem24#1 := read~int(main_~ptr~0#1.base, 8 + main_~ptr~0#1.offset, 4); {2980#(= |ULTIMATE.start_main_~uneq~0#1| |ULTIMATE.start_main_#t~mem24#1|)} is VALID [2022-02-20 16:54:33,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {2980#(= |ULTIMATE.start_main_~uneq~0#1| |ULTIMATE.start_main_#t~mem24#1|)} assume main_~uneq~0#1 != main_#t~mem24#1;havoc main_#t~mem24#1; {2949#false} is VALID [2022-02-20 16:54:33,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {2949#false} assume !false; {2949#false} is VALID [2022-02-20 16:54:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:54:33,215 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:33,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469501304] [2022-02-20 16:54:33,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469501304] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:33,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837726966] [2022-02-20 16:54:33,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:33,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:33,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:33,217 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:54:33,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 16:54:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:33,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 177 conjunts are in the unsatisfiable core [2022-02-20 16:54:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:33,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:33,831 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:33,918 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:34,092 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 16:54:34,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-20 16:54:34,335 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:34,566 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 16:54:34,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:54:34,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:34,767 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 416823 column 46: unknown constant v_old(#valid)_AFTER_CALL_16 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 16:54:34,772 INFO L158 Benchmark]: Toolchain (without parser) took 28145.85ms. Allocated memory was 81.8MB in the beginning and 234.9MB in the end (delta: 153.1MB). Free memory was 45.6MB in the beginning and 77.1MB in the end (delta: -31.5MB). Peak memory consumption was 122.3MB. Max. memory is 16.1GB. [2022-02-20 16:54:34,772 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 81.8MB. Free memory was 54.8MB in the beginning and 54.8MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:54:34,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.94ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 45.3MB in the beginning and 70.9MB in the end (delta: -25.6MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2022-02-20 16:54:34,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.39ms. Allocated memory is still 107.0MB. Free memory was 70.9MB in the beginning and 67.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:54:34,773 INFO L158 Benchmark]: Boogie Preprocessor took 29.33ms. Allocated memory is still 107.0MB. Free memory was 67.9MB in the beginning and 65.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:54:34,773 INFO L158 Benchmark]: RCFGBuilder took 542.99ms. Allocated memory is still 107.0MB. Free memory was 65.1MB in the beginning and 71.2MB in the end (delta: -6.0MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2022-02-20 16:54:34,773 INFO L158 Benchmark]: TraceAbstraction took 27097.87ms. Allocated memory was 107.0MB in the beginning and 234.9MB in the end (delta: 127.9MB). Free memory was 70.7MB in the beginning and 77.1MB in the end (delta: -6.4MB). Peak memory consumption was 121.2MB. Max. memory is 16.1GB. [2022-02-20 16:54:34,775 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.09ms. Allocated memory is still 81.8MB. Free memory was 54.8MB in the beginning and 54.8MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.94ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 45.3MB in the beginning and 70.9MB in the end (delta: -25.6MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.39ms. Allocated memory is still 107.0MB. Free memory was 70.9MB in the beginning and 67.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.33ms. Allocated memory is still 107.0MB. Free memory was 67.9MB in the beginning and 65.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 542.99ms. Allocated memory is still 107.0MB. Free memory was 65.1MB in the beginning and 71.2MB in the end (delta: -6.0MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 27097.87ms. Allocated memory was 107.0MB in the beginning and 234.9MB in the end (delta: 127.9MB). Free memory was 70.7MB in the beginning and 77.1MB in the end (delta: -6.4MB). Peak memory consumption was 121.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 416823 column 46: unknown constant v_old(#valid)_AFTER_CALL_16 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 416823 column 46: unknown constant v_old(#valid)_AFTER_CALL_16: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:54:34,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2c_insert_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 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:54:36,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:54:36,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:54:36,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:54:36,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:54:36,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:54:36,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:54:36,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:54:36,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:54:36,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:54:36,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:54:36,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:54:36,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:54:36,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:54:36,646 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:54:36,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:54:36,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:54:36,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:54:36,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:54:36,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:54:36,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:54:36,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:54:36,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:54:36,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:54:36,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:54:36,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:54:36,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:54:36,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:54:36,671 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:54:36,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:54:36,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:54:36,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:54:36,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:54:36,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:54:36,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:54:36,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:54:36,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:54:36,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:54:36,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:54:36,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:54:36,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:54:36,679 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:36,720 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:54:36,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:54:36,721 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:54:36,721 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:54:36,722 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:54:36,722 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:54:36,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:54:36,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:54:36,724 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:54:36,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:54:36,725 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:54:36,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:54:36,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:54:36,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:54:36,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:54:36,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:54:36,726 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:54:36,726 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:54:36,726 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:54:36,727 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:54:36,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:54:36,727 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:54:36,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:54:36,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:54:36,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:54:36,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:54:36,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:54:36,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:54:36,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:54:36,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:54:36,729 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:54:36,729 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:54:36,729 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:54:36,729 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:54:36,730 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:54:36,730 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:54:36,730 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2022-02-20 16:54:37,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:54:37,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:54:37,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:54:37,043 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:54:37,044 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:54:37,044 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2022-02-20 16:54:37,090 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114412cd3/9d08ed53b0c64838a49b32f302dbbd86/FLAG0baaa98e2 [2022-02-20 16:54:37,522 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:54:37,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2022-02-20 16:54:37,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114412cd3/9d08ed53b0c64838a49b32f302dbbd86/FLAG0baaa98e2 [2022-02-20 16:54:37,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114412cd3/9d08ed53b0c64838a49b32f302dbbd86 [2022-02-20 16:54:37,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:54:37,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:54:37,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:54:37,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:54:37,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:54:37,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:54:37" (1/1) ... [2022-02-20 16:54:37,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e62429b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:37, skipping insertion in model container [2022-02-20 16:54:37,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:54:37" (1/1) ... [2022-02-20 16:54:37,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:54:37,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:54:37,936 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_insert_unequal.i[25148,25161] [2022-02-20 16:54:37,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:54:37,963 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:54:38,027 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_insert_unequal.i[25148,25161] [2022-02-20 16:54:38,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:54:38,068 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:54:38,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:38 WrapperNode [2022-02-20 16:54:38,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:54:38,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:54:38,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:54:38,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:54:38,076 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:38" (1/1) ... [2022-02-20 16:54:38,091 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:38" (1/1) ... [2022-02-20 16:54:38,134 INFO L137 Inliner]: procedures = 130, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2022-02-20 16:54:38,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:54:38,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:54:38,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:54:38,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:54:38,146 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:38" (1/1) ... [2022-02-20 16:54:38,146 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:38" (1/1) ... [2022-02-20 16:54:38,163 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:38" (1/1) ... [2022-02-20 16:54:38,164 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:38" (1/1) ... [2022-02-20 16:54:38,191 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:38" (1/1) ... [2022-02-20 16:54:38,206 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:38" (1/1) ... [2022-02-20 16:54:38,209 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:38" (1/1) ... [2022-02-20 16:54:38,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:54:38,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:54:38,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:54:38,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:54:38,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:38" (1/1) ... [2022-02-20 16:54:38,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:54:38,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:38,251 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:38,258 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:38,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:54:38,289 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 16:54:38,289 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 16:54:38,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:54:38,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:54:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:54:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:54:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:54:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:54:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:54:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 16:54:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:54:38,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:54:38,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:54:38,424 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:54:38,425 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:54:39,095 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:54:39,107 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:54:39,108 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 16:54:39,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:54:39 BoogieIcfgContainer [2022-02-20 16:54:39,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:54:39,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:54:39,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:54:39,115 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:54:39,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:54:37" (1/3) ... [2022-02-20 16:54:39,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7153a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:54:39, skipping insertion in model container [2022-02-20 16:54:39,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:38" (2/3) ... [2022-02-20 16:54:39,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7153a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:54:39, skipping insertion in model container [2022-02-20 16:54:39,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:54:39" (3/3) ... [2022-02-20 16:54:39,117 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2022-02-20 16:54:39,121 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:54:39,121 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:54:39,157 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:54:39,162 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:39,162 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:54:39,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 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:39,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:54:39,183 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:39,184 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, 1] [2022-02-20 16:54:39,184 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:39,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:39,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1243287101, now seen corresponding path program 1 times [2022-02-20 16:54:39,203 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:39,204 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671190559] [2022-02-20 16:54:39,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:39,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:39,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:39,207 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:39,218 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:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:39,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:54:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:39,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:39,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {47#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); {47#true} is VALID [2022-02-20 16:54:39,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#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_~mid_index~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; {47#true} is VALID [2022-02-20 16:54:39,554 INFO L272 TraceCheckUtils]: 2: Hoare triple {47#true} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {47#true} is VALID [2022-02-20 16:54:39,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {47#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; {47#true} is VALID [2022-02-20 16:54:39,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {47#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {47#true} is VALID [2022-02-20 16:54:39,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {47#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; {47#true} is VALID [2022-02-20 16:54:39,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#true} assume true; {47#true} is VALID [2022-02-20 16:54:39,555 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {47#true} {47#true} #144#return; {47#true} is VALID [2022-02-20 16:54:39,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {47#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; {47#true} is VALID [2022-02-20 16:54:39,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {47#true} assume !true; {48#false} is VALID [2022-02-20 16:54:39,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {48#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; {48#false} is VALID [2022-02-20 16:54:39,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {48#false} main_#t~ret18#1.base, main_#t~ret18#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~ret18#1.base, main_#t~ret18#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret18#1.base, main_#t~ret18#1.offset;main_~uneq~0#1 := 5bv32;main_~mid_index~0#1 := ~bvsdiv32(main_~len~0#1, 2bv32);assume { :begin_inline_dll_circular_insert } true;dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset, dll_circular_insert_#in~data#1, dll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset, dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset, dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset, dll_circular_insert_#t~post12#1, dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset, dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, dll_circular_insert_~data#1, dll_circular_insert_~index#1, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset := dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset;dll_circular_insert_~data#1 := dll_circular_insert_#in~data#1;dll_circular_insert_~index#1 := dll_circular_insert_#in~index#1; {48#false} is VALID [2022-02-20 16:54:39,558 INFO L272 TraceCheckUtils]: 12: Hoare triple {48#false} call dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset := node_create(dll_circular_insert_~data#1); {48#false} is VALID [2022-02-20 16:54:39,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {48#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; {48#false} is VALID [2022-02-20 16:54:39,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {48#false} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {48#false} is VALID [2022-02-20 16:54:39,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {48#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; {48#false} is VALID [2022-02-20 16:54:39,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {48#false} assume true; {48#false} is VALID [2022-02-20 16:54:39,559 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {48#false} {48#false} #148#return; {48#false} is VALID [2022-02-20 16:54:39,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {48#false} dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset := dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32;call dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4bv32);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset;havoc dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset; {48#false} is VALID [2022-02-20 16:54:39,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {48#false} assume !~bvsgt32(dll_circular_insert_~index#1, 0bv32); {48#false} is VALID [2022-02-20 16:54:39,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {48#false} assume dll_circular_insert_~snd_to_last~0#1.base != 0bv32 || dll_circular_insert_~snd_to_last~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~new_node~0#1.base, ~bvadd32(4bv32, dll_circular_insert_~new_node~0#1.offset), 4bv32);call write~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~last~1#1.base, ~bvadd32(4bv32, dll_circular_insert_~last~1#1.offset), 4bv32); {48#false} is VALID [2022-02-20 16:54:39,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {48#false} assume { :end_inline_dll_circular_insert } true;call main_#t~mem19#1.base, main_#t~mem19#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~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;main_~count~0#1 := 0bv32; {48#false} is VALID [2022-02-20 16:54:39,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {48#false} call main_#t~mem21#1 := read~intINTTYPE4(main_~ptr~0#1.base, ~bvadd32(8bv32, main_~ptr~0#1.offset), 4bv32); {48#false} is VALID [2022-02-20 16:54:39,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {48#false} assume main_~data~0#1 != main_#t~mem21#1;havoc main_#t~mem21#1; {48#false} is VALID [2022-02-20 16:54:39,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {48#false} assume !false; {48#false} is VALID [2022-02-20 16:54:39,564 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:39,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:54:39,564 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:39,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671190559] [2022-02-20 16:54:39,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671190559] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:39,565 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:39,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:54:39,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065270350] [2022-02-20 16:54:39,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:39,572 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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 25 [2022-02-20 16:54:39,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:39,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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:39,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:39,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:54:39,630 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:54:39,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:54:39,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:54:39,646 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 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.5) internal successors, (21), 2 states have internal predecessors, (21), 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:39,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:39,900 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2022-02-20 16:54:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:54:39,900 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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 25 [2022-02-20 16:54:39,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 114 transitions. [2022-02-20 16:54:39,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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:39,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 114 transitions. [2022-02-20 16:54:39,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 114 transitions. [2022-02-20 16:54:40,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:40,102 INFO L225 Difference]: With dead ends: 79 [2022-02-20 16:54:40,103 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 16:54:40,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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:40,111 INFO L933 BasicCegarLoop]: 58 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, 58 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:40,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 58 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:40,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 16:54:40,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-20 16:54:40,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:40,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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:40,151 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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:40,153 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:40,165 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-02-20 16:54:40,165 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-02-20 16:54:40,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:40,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:40,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 36 states. [2022-02-20 16:54:40,171 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 36 states. [2022-02-20 16:54:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:40,176 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-02-20 16:54:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-02-20 16:54:40,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:40,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:40,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:40,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:40,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-02-20 16:54:40,185 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 25 [2022-02-20 16:54:40,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:40,186 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-02-20 16:54:40,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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:40,186 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-02-20 16:54:40,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:54:40,187 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:40,187 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, 1] [2022-02-20 16:54:40,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:54:40,401 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:40,402 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:40,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:40,403 INFO L85 PathProgramCache]: Analyzing trace with hash -709703190, now seen corresponding path program 1 times [2022-02-20 16:54:40,403 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:40,403 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995859437] [2022-02-20 16:54:40,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:40,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:40,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:40,405 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:40,406 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:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:40,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:54:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:40,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:40,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {343#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); {343#true} is VALID [2022-02-20 16:54:40,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {343#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#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_~mid_index~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; {351#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:54:40,766 INFO L272 TraceCheckUtils]: 2: Hoare triple {351#(= |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); {343#true} is VALID [2022-02-20 16:54:40,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {343#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; {343#true} is VALID [2022-02-20 16:54:40,766 INFO L290 TraceCheckUtils]: 4: Hoare triple {343#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {343#true} is VALID [2022-02-20 16:54:40,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {343#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; {343#true} is VALID [2022-02-20 16:54:40,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {343#true} assume true; {343#true} is VALID [2022-02-20 16:54:40,768 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {343#true} {351#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} #144#return; {351#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:54:40,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {351#(= |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; {351#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:54:40,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {351#(= |ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {344#false} is VALID [2022-02-20 16:54:40,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {344#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; {344#false} is VALID [2022-02-20 16:54:40,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {344#false} main_#t~ret18#1.base, main_#t~ret18#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~ret18#1.base, main_#t~ret18#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret18#1.base, main_#t~ret18#1.offset;main_~uneq~0#1 := 5bv32;main_~mid_index~0#1 := ~bvsdiv32(main_~len~0#1, 2bv32);assume { :begin_inline_dll_circular_insert } true;dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset, dll_circular_insert_#in~data#1, dll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset, dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset, dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset, dll_circular_insert_#t~post12#1, dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset, dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, dll_circular_insert_~data#1, dll_circular_insert_~index#1, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset := dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset;dll_circular_insert_~data#1 := dll_circular_insert_#in~data#1;dll_circular_insert_~index#1 := dll_circular_insert_#in~index#1; {344#false} is VALID [2022-02-20 16:54:40,769 INFO L272 TraceCheckUtils]: 12: Hoare triple {344#false} call dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset := node_create(dll_circular_insert_~data#1); {344#false} is VALID [2022-02-20 16:54:40,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {344#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; {344#false} is VALID [2022-02-20 16:54:40,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {344#false} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {344#false} is VALID [2022-02-20 16:54:40,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {344#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; {344#false} is VALID [2022-02-20 16:54:40,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {344#false} assume true; {344#false} is VALID [2022-02-20 16:54:40,770 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {344#false} {344#false} #148#return; {344#false} is VALID [2022-02-20 16:54:40,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {344#false} dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset := dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32;call dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4bv32);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset;havoc dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset; {344#false} is VALID [2022-02-20 16:54:40,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {344#false} assume !~bvsgt32(dll_circular_insert_~index#1, 0bv32); {344#false} is VALID [2022-02-20 16:54:40,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {344#false} assume dll_circular_insert_~snd_to_last~0#1.base != 0bv32 || dll_circular_insert_~snd_to_last~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~new_node~0#1.base, ~bvadd32(4bv32, dll_circular_insert_~new_node~0#1.offset), 4bv32);call write~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~last~1#1.base, ~bvadd32(4bv32, dll_circular_insert_~last~1#1.offset), 4bv32); {344#false} is VALID [2022-02-20 16:54:40,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {344#false} assume { :end_inline_dll_circular_insert } true;call main_#t~mem19#1.base, main_#t~mem19#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~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;main_~count~0#1 := 0bv32; {344#false} is VALID [2022-02-20 16:54:40,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {344#false} call main_#t~mem21#1 := read~intINTTYPE4(main_~ptr~0#1.base, ~bvadd32(8bv32, main_~ptr~0#1.offset), 4bv32); {344#false} is VALID [2022-02-20 16:54:40,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {344#false} assume main_~data~0#1 != main_#t~mem21#1;havoc main_#t~mem21#1; {344#false} is VALID [2022-02-20 16:54:40,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {344#false} assume !false; {344#false} is VALID [2022-02-20 16:54:40,772 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:40,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:54:40,772 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:40,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995859437] [2022-02-20 16:54:40,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995859437] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:40,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:40,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:54:40,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867930166] [2022-02-20 16:54:40,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:40,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 25 [2022-02-20 16:54:40,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:40,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:40,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:40,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:54:40,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:54:40,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:54:40,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:54:40,827 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:41,304 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2022-02-20 16:54:41,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:54:41,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 25 [2022-02-20 16:54:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2022-02-20 16:54:41,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2022-02-20 16:54:41,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 89 transitions. [2022-02-20 16:54:41,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:41,440 INFO L225 Difference]: With dead ends: 68 [2022-02-20 16:54:41,440 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 16:54:41,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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:41,441 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 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:41,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 87 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:41,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 16:54:41,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-02-20 16:54:41,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:41,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:54:41,446 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:54:41,447 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:54:41,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:41,449 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2022-02-20 16:54:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2022-02-20 16:54:41,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:41,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:41,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-02-20 16:54:41,451 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 41 states. [2022-02-20 16:54:41,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:41,453 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2022-02-20 16:54:41,453 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2022-02-20 16:54:41,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:41,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:41,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:41,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:54:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-02-20 16:54:41,457 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 25 [2022-02-20 16:54:41,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:41,457 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-02-20 16:54:41,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:41,457 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-02-20 16:54:41,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 16:54:41,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:41,459 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, 1] [2022-02-20 16:54:41,476 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:41,670 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:41,671 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:41,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:41,671 INFO L85 PathProgramCache]: Analyzing trace with hash -37646058, now seen corresponding path program 1 times [2022-02-20 16:54:41,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:41,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69388285] [2022-02-20 16:54:41,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:41,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:41,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:41,674 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:41,675 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:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:41,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:54:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:41,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:41,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {637#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); {637#true} is VALID [2022-02-20 16:54:41,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {637#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1.base, main_#t~ret18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~post23#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~post26#1, main_#t~mem28#1, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~post30#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem31#1.base, main_#t~mem31#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_~mid_index~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; {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:41,985 INFO L272 TraceCheckUtils]: 2: Hoare triple {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} call dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset := node_create(dll_circular_create_~data#1); {637#true} is VALID [2022-02-20 16:54:41,985 INFO L290 TraceCheckUtils]: 3: Hoare triple {637#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; {637#true} is VALID [2022-02-20 16:54:41,985 INFO L290 TraceCheckUtils]: 4: Hoare triple {637#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {637#true} is VALID [2022-02-20 16:54:41,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {637#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; {637#true} is VALID [2022-02-20 16:54:41,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {637#true} assume true; {637#true} is VALID [2022-02-20 16:54:41,986 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {637#true} {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} #144#return; {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:41,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset := dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;havoc dll_circular_create_#t~ret4#1.base, dll_circular_create_#t~ret4#1.offset;dll_circular_create_~last~0#1.base, dll_circular_create_~last~0#1.offset := dll_circular_create_~head~0#1.base, dll_circular_create_~head~0#1.offset; {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:41,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !!~bvsgt32(dll_circular_create_~len#1, 1bv32); {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:41,988 INFO L272 TraceCheckUtils]: 10: Hoare triple {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} call dll_circular_create_#t~ret5#1.base, dll_circular_create_#t~ret5#1.offset := node_create(dll_circular_create_~data#1); {637#true} is VALID [2022-02-20 16:54:41,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {637#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; {637#true} is VALID [2022-02-20 16:54:41,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {637#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {637#true} is VALID [2022-02-20 16:54:41,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {637#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; {637#true} is VALID [2022-02-20 16:54:41,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {637#true} assume true; {637#true} is VALID [2022-02-20 16:54:41,989 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {637#true} {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} #146#return; {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:41,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} 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); {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:41,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} 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); {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:41,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~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 := ~bvsub32(dll_circular_create_#t~post6#1, 1bv32);havoc dll_circular_create_#t~post6#1; {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:41,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !~bvsgt32(dll_circular_create_~len#1, 1bv32); {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:41,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} 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; {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:41,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {645#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} main_#t~ret18#1.base, main_#t~ret18#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~ret18#1.base, main_#t~ret18#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret18#1.base, main_#t~ret18#1.offset;main_~uneq~0#1 := 5bv32;main_~mid_index~0#1 := ~bvsdiv32(main_~len~0#1, 2bv32);assume { :begin_inline_dll_circular_insert } true;dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset, dll_circular_insert_#in~data#1, dll_circular_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset, dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset, dll_circular_insert_#t~mem11#1.base, dll_circular_insert_#t~mem11#1.offset, dll_circular_insert_#t~post12#1, dll_circular_insert_#t~mem13#1.base, dll_circular_insert_#t~mem13#1.offset, dll_circular_insert_#t~mem14#1.base, dll_circular_insert_#t~mem14#1.offset, dll_circular_insert_#t~mem15#1.base, dll_circular_insert_#t~mem15#1.offset, dll_circular_insert_#t~mem16#1.base, dll_circular_insert_#t~mem16#1.offset, dll_circular_insert_#t~mem17#1.base, dll_circular_insert_#t~mem17#1.offset, dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, dll_circular_insert_~data#1, dll_circular_insert_~index#1, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset;dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset := dll_circular_insert_#in~head#1.base, dll_circular_insert_#in~head#1.offset;dll_circular_insert_~data#1 := dll_circular_insert_#in~data#1;dll_circular_insert_~index#1 := dll_circular_insert_#in~index#1; {706#(= (_ bv1 32) |ULTIMATE.start_dll_circular_insert_~index#1|)} is VALID [2022-02-20 16:54:41,993 INFO L272 TraceCheckUtils]: 22: Hoare triple {706#(= (_ bv1 32) |ULTIMATE.start_dll_circular_insert_~index#1|)} call dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset := node_create(dll_circular_insert_~data#1); {637#true} is VALID [2022-02-20 16:54:41,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {637#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; {637#true} is VALID [2022-02-20 16:54:41,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {637#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {637#true} is VALID [2022-02-20 16:54:41,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {637#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; {637#true} is VALID [2022-02-20 16:54:41,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {637#true} assume true; {637#true} is VALID [2022-02-20 16:54:41,994 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {637#true} {706#(= (_ bv1 32) |ULTIMATE.start_dll_circular_insert_~index#1|)} #148#return; {706#(= (_ bv1 32) |ULTIMATE.start_dll_circular_insert_~index#1|)} is VALID [2022-02-20 16:54:41,995 INFO L290 TraceCheckUtils]: 28: Hoare triple {706#(= (_ bv1 32) |ULTIMATE.start_dll_circular_insert_~index#1|)} dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset := dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;havoc dll_circular_insert_#t~ret9#1.base, dll_circular_insert_#t~ret9#1.offset;dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32;call dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset := read~$Pointer$(dll_circular_insert_~head#1.base, dll_circular_insert_~head#1.offset, 4bv32);dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset := dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset;havoc dll_circular_insert_#t~mem10#1.base, dll_circular_insert_#t~mem10#1.offset; {706#(= (_ bv1 32) |ULTIMATE.start_dll_circular_insert_~index#1|)} is VALID [2022-02-20 16:54:41,995 INFO L290 TraceCheckUtils]: 29: Hoare triple {706#(= (_ bv1 32) |ULTIMATE.start_dll_circular_insert_~index#1|)} assume !~bvsgt32(dll_circular_insert_~index#1, 0bv32); {638#false} is VALID [2022-02-20 16:54:41,996 INFO L290 TraceCheckUtils]: 30: Hoare triple {638#false} assume dll_circular_insert_~snd_to_last~0#1.base != 0bv32 || dll_circular_insert_~snd_to_last~0#1.offset != 0bv32;call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_insert_~snd_to_last~0#1.base, dll_circular_insert_~snd_to_last~0#1.offset, dll_circular_insert_~new_node~0#1.base, ~bvadd32(4bv32, dll_circular_insert_~new_node~0#1.offset), 4bv32);call write~$Pointer$(dll_circular_insert_~last~1#1.base, dll_circular_insert_~last~1#1.offset, dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, 4bv32);call write~$Pointer$(dll_circular_insert_~new_node~0#1.base, dll_circular_insert_~new_node~0#1.offset, dll_circular_insert_~last~1#1.base, ~bvadd32(4bv32, dll_circular_insert_~last~1#1.offset), 4bv32); {638#false} is VALID [2022-02-20 16:54:41,996 INFO L290 TraceCheckUtils]: 31: Hoare triple {638#false} assume { :end_inline_dll_circular_insert } true;call main_#t~mem19#1.base, main_#t~mem19#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~mem19#1.base, main_#t~mem19#1.offset;havoc main_#t~mem19#1.base, main_#t~mem19#1.offset;main_~count~0#1 := 0bv32; {638#false} is VALID [2022-02-20 16:54:41,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {638#false} call main_#t~mem21#1 := read~intINTTYPE4(main_~ptr~0#1.base, ~bvadd32(8bv32, main_~ptr~0#1.offset), 4bv32); {638#false} is VALID [2022-02-20 16:54:41,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {638#false} assume main_~data~0#1 != main_#t~mem21#1;havoc main_#t~mem21#1; {638#false} is VALID [2022-02-20 16:54:41,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {638#false} assume !false; {638#false} is VALID [2022-02-20 16:54:41,997 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 16:54:41,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:54:41,997 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:41,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69388285] [2022-02-20 16:54:41,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69388285] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:41,997 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:41,998 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:54:41,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334600095] [2022-02-20 16:54:41,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:41,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-02-20 16:54:41,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:41,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:42,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:42,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:54:42,047 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:54:42,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:54:42,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:54:42,048 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:42,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:42,533 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2022-02-20 16:54:42,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:54:42,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-02-20 16:54:42,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:42,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-02-20 16:54:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:42,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-02-20 16:54:42,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 72 transitions. [2022-02-20 16:54:42,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:42,640 INFO L225 Difference]: With dead ends: 55 [2022-02-20 16:54:42,640 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 16:54:42,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:54:42,641 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:42,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 93 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:42,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 16:54:42,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-20 16:54:42,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:42,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 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:42,646 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 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:42,647 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 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:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:42,649 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2022-02-20 16:54:42,649 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-02-20 16:54:42,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:42,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:42,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 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 38 states. [2022-02-20 16:54:42,650 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 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 38 states. [2022-02-20 16:54:42,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:42,652 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2022-02-20 16:54:42,652 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-02-20 16:54:42,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:42,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:42,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:42,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 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:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-02-20 16:54:42,655 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 35 [2022-02-20 16:54:42,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:42,656 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-02-20 16:54:42,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:54:42,656 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-02-20 16:54:42,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 16:54:42,657 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:42,657 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, 1, 1] [2022-02-20 16:54:42,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:54:42,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:54:42,870 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:42,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:42,870 INFO L85 PathProgramCache]: Analyzing trace with hash 368663721, now seen corresponding path program 1 times [2022-02-20 16:54:42,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:54:42,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953245345] [2022-02-20 16:54:42,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:42,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:54:42,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:54:42,872 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:54:42,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:54:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:43,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 110 conjunts are in the unsatisfiable core [2022-02-20 16:54:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:43,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:43,319 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:43,377 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:43,563 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 16:54:43,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-02-20 16:54:43,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 16:54:43,970 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:44,160 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-02-20 16:54:44,160 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 24 treesize of output 41 [2022-02-20 16:54:44,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:44,375 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 19 treesize of output 18 [2022-02-20 16:54:44,541 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:44,567 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:44,934 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:54:44,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953245345] [2022-02-20 16:54:44,935 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 16:54:44,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:54:45,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:54:45,148 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_48| 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:45,152 INFO L158 Benchmark]: Toolchain (without parser) took 7606.45ms. Allocated memory was 54.5MB in the beginning and 111.1MB in the end (delta: 56.6MB). Free memory was 30.4MB in the beginning and 35.4MB in the end (delta: -5.0MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2022-02-20 16:54:45,152 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 54.5MB. Free memory was 36.0MB in the beginning and 35.9MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:54:45,153 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.71ms. Allocated memory was 54.5MB in the beginning and 75.5MB in the end (delta: 21.0MB). Free memory was 30.2MB in the beginning and 47.6MB in the end (delta: -17.3MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2022-02-20 16:54:45,153 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.08ms. Allocated memory is still 75.5MB. Free memory was 47.5MB in the beginning and 44.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:54:45,153 INFO L158 Benchmark]: Boogie Preprocessor took 78.66ms. Allocated memory is still 75.5MB. Free memory was 44.4MB in the beginning and 41.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:54:45,154 INFO L158 Benchmark]: RCFGBuilder took 892.21ms. Allocated memory is still 75.5MB. Free memory was 41.4MB in the beginning and 53.5MB in the end (delta: -12.2MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2022-02-20 16:54:45,154 INFO L158 Benchmark]: TraceAbstraction took 6039.47ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 53.0MB in the beginning and 35.4MB in the end (delta: 17.6MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2022-02-20 16:54:45,155 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.09ms. Allocated memory is still 54.5MB. Free memory was 36.0MB in the beginning and 35.9MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 520.71ms. Allocated memory was 54.5MB in the beginning and 75.5MB in the end (delta: 21.0MB). Free memory was 30.2MB in the beginning and 47.6MB in the end (delta: -17.3MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.08ms. Allocated memory is still 75.5MB. Free memory was 47.5MB in the beginning and 44.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.66ms. Allocated memory is still 75.5MB. Free memory was 44.4MB in the beginning and 41.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 892.21ms. Allocated memory is still 75.5MB. Free memory was 41.4MB in the beginning and 53.5MB in the end (delta: -12.2MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6039.47ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 53.0MB in the beginning and 35.4MB in the end (delta: 17.6MB). Peak memory consumption was 52.5MB. 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_48| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_48|: 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:45,184 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_48|