./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all.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/sll2c_update_all.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 e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:55:52,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:55:52,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:55:52,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:55:52,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:55:52,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:55:52,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:55:52,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:55:52,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:55:52,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:55:52,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:55:52,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:55:52,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:55:52,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:55:52,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:55:52,693 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:55:52,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:55:52,694 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:55:52,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:55:52,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:55:52,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:55:52,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:55:52,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:55:52,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:55:52,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:55:52,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:55:52,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:55:52,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:55:52,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:55:52,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:55:52,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:55:52,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:55:52,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:55:52,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:55:52,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:55:52,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:55:52,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:55:52,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:55:52,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:55:52,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:55:52,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:55:52,714 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:55:52,736 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:55:52,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:55:52,738 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:55:52,738 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:55:52,739 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:55:52,739 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:55:52,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:55:52,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:55:52,740 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:55:52,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:55:52,741 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:55:52,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:55:52,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:55:52,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:55:52,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:55:52,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:55:52,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:55:52,742 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:55:52,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:55:52,742 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:55:52,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:55:52,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:55:52,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:55:52,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:55:52,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:55:52,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:55:52,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:55:52,745 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:55:52,745 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:55:52,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:55:52,745 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:55:52,745 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:55:52,745 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:55:52,746 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 -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2022-02-20 16:55:52,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:55:52,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:55:52,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:55:52,932 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:55:52,933 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:55:52,934 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all.i [2022-02-20 16:55:52,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f9cb3d1/622a1af459cf42d090bb3bd21ad955ea/FLAG822affed8 [2022-02-20 16:55:53,460 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:55:53,461 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2022-02-20 16:55:53,472 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f9cb3d1/622a1af459cf42d090bb3bd21ad955ea/FLAG822affed8 [2022-02-20 16:55:53,800 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f9cb3d1/622a1af459cf42d090bb3bd21ad955ea [2022-02-20 16:55:53,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:55:53,804 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:55:53,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:55:53,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:55:53,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:55:53,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:55:53" (1/1) ... [2022-02-20 16:55:53,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373642f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:53, skipping insertion in model container [2022-02-20 16:55:53,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:55:53" (1/1) ... [2022-02-20 16:55:53,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:55:53,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:55:54,088 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/sll2c_update_all.i[24418,24431] [2022-02-20 16:55:54,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:55:54,104 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:55:54,164 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/sll2c_update_all.i[24418,24431] [2022-02-20 16:55:54,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:55:54,181 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:55:54,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:54 WrapperNode [2022-02-20 16:55:54,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:55:54,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:55:54,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:55:54,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:55:54,187 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:55:54" (1/1) ... [2022-02-20 16:55:54,196 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:55:54" (1/1) ... [2022-02-20 16:55:54,212 INFO L137 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 127 [2022-02-20 16:55:54,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:55:54,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:55:54,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:55:54,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:55:54,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:54" (1/1) ... [2022-02-20 16:55:54,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:54" (1/1) ... [2022-02-20 16:55:54,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:54" (1/1) ... [2022-02-20 16:55:54,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:54" (1/1) ... [2022-02-20 16:55:54,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:54" (1/1) ... [2022-02-20 16:55:54,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:54" (1/1) ... [2022-02-20 16:55:54,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:54" (1/1) ... [2022-02-20 16:55:54,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:55:54,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:55:54,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:55:54,231 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:55:54,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:54" (1/1) ... [2022-02-20 16:55:54,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:55:54,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:55:54,253 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:55:54,265 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:55:54,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:55:54,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:55:54,281 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 16:55:54,281 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 16:55:54,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:55:54,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:55:54,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:55:54,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:55:54,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:55:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:55:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:55:54,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:55:54,357 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:55:54,368 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:55:54,562 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:55:54,567 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:55:54,568 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:55:54,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:55:54 BoogieIcfgContainer [2022-02-20 16:55:54,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:55:54,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:55:54,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:55:54,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:55:54,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:55:53" (1/3) ... [2022-02-20 16:55:54,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7efdc9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:55:54, skipping insertion in model container [2022-02-20 16:55:54,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:55:54" (2/3) ... [2022-02-20 16:55:54,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7efdc9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:55:54, skipping insertion in model container [2022-02-20 16:55:54,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:55:54" (3/3) ... [2022-02-20 16:55:54,577 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2022-02-20 16:55:54,580 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:55:54,580 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:55:54,626 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:55:54,630 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:55:54,630 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:55:54,650 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 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:55:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 16:55:54,656 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:55:54,657 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:55:54,658 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:55:54,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:55:54,662 INFO L85 PathProgramCache]: Analyzing trace with hash 663980757, now seen corresponding path program 1 times [2022-02-20 16:55:54,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:55:54,671 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715570291] [2022-02-20 16:55:54,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:54,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:55:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:54,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:55:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:54,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {47#(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(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {40#true} is VALID [2022-02-20 16:55:54,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {40#true} is VALID [2022-02-20 16:55:54,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {40#true} is VALID [2022-02-20 16:55:54,881 INFO L290 TraceCheckUtils]: 3: Hoare triple {40#true} assume true; {40#true} is VALID [2022-02-20 16:55:54,881 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {40#true} {40#true} #123#return; {40#true} is VALID [2022-02-20 16:55:54,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {40#true} is VALID [2022-02-20 16:55:54,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {40#true} is VALID [2022-02-20 16:55:54,884 INFO L272 TraceCheckUtils]: 2: Hoare triple {40#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {47#(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:55:54,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {47#(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(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {40#true} is VALID [2022-02-20 16:55:54,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {40#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {40#true} is VALID [2022-02-20 16:55:54,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {40#true} is VALID [2022-02-20 16:55:54,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {40#true} assume true; {40#true} is VALID [2022-02-20 16:55:54,886 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {40#true} {40#true} #123#return; {40#true} is VALID [2022-02-20 16:55:54,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {40#true} is VALID [2022-02-20 16:55:54,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume !true; {41#false} is VALID [2022-02-20 16:55:54,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {41#false} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {41#false} is VALID [2022-02-20 16:55:54,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {41#false} is VALID [2022-02-20 16:55:54,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-02-20 16:55:54,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} main_~i~0#1 := 0; {41#false} is VALID [2022-02-20 16:55:54,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {41#false} is VALID [2022-02-20 16:55:54,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} assume !(sll_circular_get_data_at_~index#1 > 0); {41#false} is VALID [2022-02-20 16:55:54,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {41#false} is VALID [2022-02-20 16:55:54,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {41#false} is VALID [2022-02-20 16:55:54,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {41#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {41#false} is VALID [2022-02-20 16:55:54,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-02-20 16:55:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:55:54,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:55:54,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715570291] [2022-02-20 16:55:54,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715570291] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:55:54,892 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:55:54,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:55:54,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780803048] [2022-02-20 16:55:54,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:55:54,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 16:55:54,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:55:54,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:55:54,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:54,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:55:54,933 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:55:54,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:55:54,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:55:54,952 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:55:55,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:55,073 INFO L93 Difference]: Finished difference Result 61 states and 87 transitions. [2022-02-20 16:55:55,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:55:55,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 16:55:55,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:55:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:55:55,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-02-20 16:55:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:55:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-02-20 16:55:55,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2022-02-20 16:55:55,140 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:55:55,145 INFO L225 Difference]: With dead ends: 61 [2022-02-20 16:55:55,145 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:55:55,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:55:55,150 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:55:55,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:55:55,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:55:55,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 16:55:55,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:55:55,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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:55:55,176 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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:55:55,176 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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:55:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:55,184 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-20 16:55:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-20 16:55:55,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:55,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:55,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 28 states. [2022-02-20 16:55:55,188 INFO L87 Difference]: Start difference. First operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 28 states. [2022-02-20 16:55:55,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:55,192 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-20 16:55:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-20 16:55:55,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:55,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:55,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:55:55,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:55:55,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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:55:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-02-20 16:55:55,202 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 20 [2022-02-20 16:55:55,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:55:55,203 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-02-20 16:55:55,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:55:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-20 16:55:55,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 16:55:55,204 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:55:55,204 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:55:55,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:55:55,206 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:55:55,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:55:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash 616475652, now seen corresponding path program 1 times [2022-02-20 16:55:55,209 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:55:55,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336737829] [2022-02-20 16:55:55,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:55,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:55:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:55,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:55:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:55,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#(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(8);~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; {229#true} is VALID [2022-02-20 16:55:55,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {229#true} is VALID [2022-02-20 16:55:55,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {229#true} is VALID [2022-02-20 16:55:55,325 INFO L290 TraceCheckUtils]: 3: Hoare triple {229#true} assume true; {229#true} is VALID [2022-02-20 16:55:55,325 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {229#true} {231#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} #123#return; {231#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:55:55,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {229#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(19, 2); {229#true} is VALID [2022-02-20 16:55:55,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {231#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:55:55,327 INFO L272 TraceCheckUtils]: 2: Hoare triple {231#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {237#(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:55:55,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {237#(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(8);~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; {229#true} is VALID [2022-02-20 16:55:55,327 INFO L290 TraceCheckUtils]: 4: Hoare triple {229#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {229#true} is VALID [2022-02-20 16:55:55,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {229#true} is VALID [2022-02-20 16:55:55,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {229#true} assume true; {229#true} is VALID [2022-02-20 16:55:55,328 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {229#true} {231#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} #123#return; {231#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:55:55,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {231#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:55:55,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} assume !(sll_circular_create_~len#1 > 1); {230#false} is VALID [2022-02-20 16:55:55,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {230#false} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {230#false} is VALID [2022-02-20 16:55:55,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {230#false} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {230#false} is VALID [2022-02-20 16:55:55,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {230#false} assume !(main_~i~0#1 < main_~len~0#1); {230#false} is VALID [2022-02-20 16:55:55,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {230#false} main_~i~0#1 := 0; {230#false} is VALID [2022-02-20 16:55:55,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {230#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {230#false} is VALID [2022-02-20 16:55:55,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {230#false} assume !(sll_circular_get_data_at_~index#1 > 0); {230#false} is VALID [2022-02-20 16:55:55,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {230#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {230#false} is VALID [2022-02-20 16:55:55,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {230#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {230#false} is VALID [2022-02-20 16:55:55,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {230#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {230#false} is VALID [2022-02-20 16:55:55,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-02-20 16:55:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:55:55,331 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:55:55,331 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336737829] [2022-02-20 16:55:55,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336737829] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:55:55,332 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:55:55,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:55:55,332 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997459146] [2022-02-20 16:55:55,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:55:55,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 16:55:55,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:55:55,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:55:55,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:55,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:55:55,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:55:55,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:55:55,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:55:55,349 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:55:55,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:55,416 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-02-20 16:55:55,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:55:55,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 16:55:55,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:55:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:55:55,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-02-20 16:55:55,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:55:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-02-20 16:55:55,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2022-02-20 16:55:55,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:55,459 INFO L225 Difference]: With dead ends: 47 [2022-02-20 16:55:55,459 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 16:55:55,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:55:55,460 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:55:55,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:55:55,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 16:55:55,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-02-20 16:55:55,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:55:55,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 29 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:55:55,464 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 29 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:55:55,465 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 29 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:55:55,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:55,466 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-20 16:55:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-20 16:55:55,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:55,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:55,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 31 states. [2022-02-20 16:55:55,467 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 31 states. [2022-02-20 16:55:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:55,469 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-20 16:55:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-20 16:55:55,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:55,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:55,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:55:55,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:55:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:55:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-02-20 16:55:55,471 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 20 [2022-02-20 16:55:55,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:55:55,471 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-02-20 16:55:55,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:55:55,472 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-02-20 16:55:55,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 16:55:55,472 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:55:55,472 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, 1, 1, 1] [2022-02-20 16:55:55,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:55:55,473 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:55:55,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:55:55,473 INFO L85 PathProgramCache]: Analyzing trace with hash -600691076, now seen corresponding path program 1 times [2022-02-20 16:55:55,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:55:55,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698754374] [2022-02-20 16:55:55,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:55,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:55:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:55,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:55:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:55,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {425#(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(8);~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; {410#true} is VALID [2022-02-20 16:55:55,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {410#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {410#true} is VALID [2022-02-20 16:55:55,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {410#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {410#true} is VALID [2022-02-20 16:55:55,594 INFO L290 TraceCheckUtils]: 3: Hoare triple {410#true} assume true; {410#true} is VALID [2022-02-20 16:55:55,594 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {410#true} {412#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #123#return; {412#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:55,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:55:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:55,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {425#(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(8);~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; {410#true} is VALID [2022-02-20 16:55:55,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {410#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {410#true} is VALID [2022-02-20 16:55:55,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {410#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {410#true} is VALID [2022-02-20 16:55:55,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {410#true} assume true; {410#true} is VALID [2022-02-20 16:55:55,608 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {410#true} {412#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #125#return; {412#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:55,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {410#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(19, 2); {410#true} is VALID [2022-02-20 16:55:55,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {410#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {412#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:55,610 INFO L272 TraceCheckUtils]: 2: Hoare triple {412#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {425#(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:55:55,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {425#(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(8);~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; {410#true} is VALID [2022-02-20 16:55:55,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {410#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {410#true} is VALID [2022-02-20 16:55:55,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {410#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {410#true} is VALID [2022-02-20 16:55:55,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {410#true} assume true; {410#true} is VALID [2022-02-20 16:55:55,611 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {410#true} {412#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #123#return; {412#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:55,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {412#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {412#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:55,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {412#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} assume !!(sll_circular_create_~len#1 > 1); {412#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:55,626 INFO L272 TraceCheckUtils]: 10: Hoare triple {412#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {425#(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:55:55,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {425#(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(8);~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; {410#true} is VALID [2022-02-20 16:55:55,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {410#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {410#true} is VALID [2022-02-20 16:55:55,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {410#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {410#true} is VALID [2022-02-20 16:55:55,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {410#true} assume true; {410#true} is VALID [2022-02-20 16:55:55,628 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {410#true} {412#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #125#return; {412#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:55,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {412#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:55,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_create_~len#1 > 1); {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:55,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:55,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {424#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 16:55:55,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {424#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0))} assume !(main_~i~0#1 < main_~len~0#1); {411#false} is VALID [2022-02-20 16:55:55,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {411#false} main_~i~0#1 := 0; {411#false} is VALID [2022-02-20 16:55:55,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {411#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {411#false} is VALID [2022-02-20 16:55:55,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {411#false} assume !(sll_circular_get_data_at_~index#1 > 0); {411#false} is VALID [2022-02-20 16:55:55,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {411#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {411#false} is VALID [2022-02-20 16:55:55,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {411#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {411#false} is VALID [2022-02-20 16:55:55,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {411#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {411#false} is VALID [2022-02-20 16:55:55,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {411#false} assume !false; {411#false} is VALID [2022-02-20 16:55:55,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 16:55:55,632 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:55:55,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698754374] [2022-02-20 16:55:55,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698754374] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:55:55,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853598548] [2022-02-20 16:55:55,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:55,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:55:55,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:55:55,655 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:55:55,656 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:55:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:55,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:55:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:55,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:55:55,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {410#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(19, 2); {410#true} is VALID [2022-02-20 16:55:55,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {410#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:55,928 INFO L272 TraceCheckUtils]: 2: Hoare triple {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {410#true} is VALID [2022-02-20 16:55:55,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {410#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {410#true} is VALID [2022-02-20 16:55:55,929 INFO L290 TraceCheckUtils]: 4: Hoare triple {410#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {410#true} is VALID [2022-02-20 16:55:55,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {410#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {410#true} is VALID [2022-02-20 16:55:55,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {410#true} assume true; {410#true} is VALID [2022-02-20 16:55:55,930 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {410#true} {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #123#return; {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:55,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:55,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_circular_create_~len#1 > 1); {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:55,931 INFO L272 TraceCheckUtils]: 10: Hoare triple {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {410#true} is VALID [2022-02-20 16:55:55,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {410#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {410#true} is VALID [2022-02-20 16:55:55,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {410#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {410#true} is VALID [2022-02-20 16:55:55,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {410#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {410#true} is VALID [2022-02-20 16:55:55,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {410#true} assume true; {410#true} is VALID [2022-02-20 16:55:55,932 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {410#true} {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #125#return; {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:55,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:55,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_create_~len#1 > 1); {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:55,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:55,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {423#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {486#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 16:55:55,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {486#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} assume !(main_~i~0#1 < main_~len~0#1); {411#false} is VALID [2022-02-20 16:55:55,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {411#false} main_~i~0#1 := 0; {411#false} is VALID [2022-02-20 16:55:55,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {411#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {411#false} is VALID [2022-02-20 16:55:55,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {411#false} assume !(sll_circular_get_data_at_~index#1 > 0); {411#false} is VALID [2022-02-20 16:55:55,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {411#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {411#false} is VALID [2022-02-20 16:55:55,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {411#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {411#false} is VALID [2022-02-20 16:55:55,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {411#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {411#false} is VALID [2022-02-20 16:55:55,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {411#false} assume !false; {411#false} is VALID [2022-02-20 16:55:55,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:55:55,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:55:55,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853598548] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:55:55,939 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 16:55:55,939 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-02-20 16:55:55,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827800776] [2022-02-20 16:55:55,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:55:55,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-02-20 16:55:55,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:55:55,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:55:55,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:55,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:55:55,971 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:55:55,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:55:55,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:55:55,972 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:55:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:56,075 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-02-20 16:55:56,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:55:56,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-02-20 16:55:56,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:55:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:55:56,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-02-20 16:55:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:55:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-02-20 16:55:56,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2022-02-20 16:55:56,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:56,125 INFO L225 Difference]: With dead ends: 51 [2022-02-20 16:55:56,125 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 16:55:56,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:55:56,126 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 30 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:55:56,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:55:56,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 16:55:56,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2022-02-20 16:55:56,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:55:56,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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:55:56,145 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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:55:56,145 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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:55:56,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:56,147 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-02-20 16:55:56,147 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-02-20 16:55:56,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:56,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:56,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 42 states. [2022-02-20 16:55:56,147 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 42 states. [2022-02-20 16:55:56,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:56,148 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-02-20 16:55:56,148 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-02-20 16:55:56,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:56,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:56,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:55:56,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:55:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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:55:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-02-20 16:55:56,151 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 28 [2022-02-20 16:55:56,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:55:56,151 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-02-20 16:55:56,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:55:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-02-20 16:55:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 16:55:56,152 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:55:56,152 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:55:56,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 16:55:56,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:55:56,370 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:55:56,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:55:56,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1948852891, now seen corresponding path program 1 times [2022-02-20 16:55:56,370 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:55:56,370 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208725960] [2022-02-20 16:55:56,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:56,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:55:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:56,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:55:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:56,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {726#(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(8);~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; {710#true} is VALID [2022-02-20 16:55:56,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {710#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {710#true} is VALID [2022-02-20 16:55:56,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {710#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {710#true} is VALID [2022-02-20 16:55:56,498 INFO L290 TraceCheckUtils]: 3: Hoare triple {710#true} assume true; {710#true} is VALID [2022-02-20 16:55:56,499 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {710#true} {712#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #123#return; {712#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:56,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:55:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:56,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {726#(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(8);~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; {710#true} is VALID [2022-02-20 16:55:56,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {710#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {710#true} is VALID [2022-02-20 16:55:56,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {710#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {710#true} is VALID [2022-02-20 16:55:56,508 INFO L290 TraceCheckUtils]: 3: Hoare triple {710#true} assume true; {710#true} is VALID [2022-02-20 16:55:56,509 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {710#true} {712#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #125#return; {712#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:56,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {710#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(19, 2); {710#true} is VALID [2022-02-20 16:55:56,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {710#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {712#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:56,511 INFO L272 TraceCheckUtils]: 2: Hoare triple {712#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {726#(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:55:56,511 INFO L290 TraceCheckUtils]: 3: Hoare triple {726#(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(8);~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; {710#true} is VALID [2022-02-20 16:55:56,511 INFO L290 TraceCheckUtils]: 4: Hoare triple {710#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {710#true} is VALID [2022-02-20 16:55:56,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {710#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {710#true} is VALID [2022-02-20 16:55:56,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {710#true} assume true; {710#true} is VALID [2022-02-20 16:55:56,512 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {710#true} {712#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #123#return; {712#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:56,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {712#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:56,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {712#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} assume !!(sll_circular_create_~len#1 > 1); {712#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:56,514 INFO L272 TraceCheckUtils]: 10: Hoare triple {712#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {726#(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:55:56,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {726#(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(8);~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; {710#true} is VALID [2022-02-20 16:55:56,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {710#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {710#true} is VALID [2022-02-20 16:55:56,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {710#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {710#true} is VALID [2022-02-20 16:55:56,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {710#true} assume true; {710#true} is VALID [2022-02-20 16:55:56,515 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {710#true} {712#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #125#return; {712#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:56,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {712#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_create_~len#1 > 1); {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {724#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 16:55:56,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {724#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {724#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 16:55:56,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {724#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0))} assume !(sll_circular_update_at_~index#1 > 0); {724#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 16:55:56,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {724#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0))} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {724#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 16:55:56,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {724#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0))} assume { :end_inline_sll_circular_update_at } true; {724#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 16:55:56,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {724#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~i~0#1| 0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {725#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {725#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)} assume !(main_~i~0#1 < main_~len~0#1); {711#false} is VALID [2022-02-20 16:55:56,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {711#false} main_~i~0#1 := 0; {711#false} is VALID [2022-02-20 16:55:56,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {711#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {711#false} is VALID [2022-02-20 16:55:56,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {711#false} assume !(sll_circular_get_data_at_~index#1 > 0); {711#false} is VALID [2022-02-20 16:55:56,523 INFO L290 TraceCheckUtils]: 29: Hoare triple {711#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {711#false} is VALID [2022-02-20 16:55:56,523 INFO L290 TraceCheckUtils]: 30: Hoare triple {711#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {711#false} is VALID [2022-02-20 16:55:56,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {711#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {711#false} is VALID [2022-02-20 16:55:56,523 INFO L290 TraceCheckUtils]: 32: Hoare triple {711#false} assume !false; {711#false} is VALID [2022-02-20 16:55:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 16:55:56,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:55:56,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208725960] [2022-02-20 16:55:56,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208725960] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:55:56,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946933833] [2022-02-20 16:55:56,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:56,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:55:56,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:55:56,526 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:55:56,542 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:55:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:56,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:55:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:56,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:55:56,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {710#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(19, 2); {710#true} is VALID [2022-02-20 16:55:56,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {710#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,853 INFO L272 TraceCheckUtils]: 2: Hoare triple {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {710#true} is VALID [2022-02-20 16:55:56,853 INFO L290 TraceCheckUtils]: 3: Hoare triple {710#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {710#true} is VALID [2022-02-20 16:55:56,853 INFO L290 TraceCheckUtils]: 4: Hoare triple {710#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {710#true} is VALID [2022-02-20 16:55:56,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {710#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {710#true} is VALID [2022-02-20 16:55:56,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {710#true} assume true; {710#true} is VALID [2022-02-20 16:55:56,854 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {710#true} {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #123#return; {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_circular_create_~len#1 > 1); {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,855 INFO L272 TraceCheckUtils]: 10: Hoare triple {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {710#true} is VALID [2022-02-20 16:55:56,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {710#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {710#true} is VALID [2022-02-20 16:55:56,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {710#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {710#true} is VALID [2022-02-20 16:55:56,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {710#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {710#true} is VALID [2022-02-20 16:55:56,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {710#true} assume true; {710#true} is VALID [2022-02-20 16:55:56,862 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {710#true} {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #125#return; {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_create_~len#1 > 1); {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {787#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 16:55:56,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {787#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {787#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 16:55:56,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {787#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} assume !(sll_circular_update_at_~index#1 > 0); {787#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 16:55:56,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {787#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {787#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 16:55:56,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {787#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} assume { :end_inline_sll_circular_update_at } true; {787#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 16:55:56,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {787#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {803#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 16:55:56,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {803#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_~i~0#1 < main_~len~0#1); {711#false} is VALID [2022-02-20 16:55:56,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {711#false} main_~i~0#1 := 0; {711#false} is VALID [2022-02-20 16:55:56,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {711#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {711#false} is VALID [2022-02-20 16:55:56,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {711#false} assume !(sll_circular_get_data_at_~index#1 > 0); {711#false} is VALID [2022-02-20 16:55:56,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {711#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {711#false} is VALID [2022-02-20 16:55:56,867 INFO L290 TraceCheckUtils]: 30: Hoare triple {711#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {711#false} is VALID [2022-02-20 16:55:56,867 INFO L290 TraceCheckUtils]: 31: Hoare triple {711#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {711#false} is VALID [2022-02-20 16:55:56,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {711#false} assume !false; {711#false} is VALID [2022-02-20 16:55:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:55:56,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:55:56,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {711#false} assume !false; {711#false} is VALID [2022-02-20 16:55:56,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {711#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {711#false} is VALID [2022-02-20 16:55:56,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {711#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {711#false} is VALID [2022-02-20 16:55:56,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {711#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {711#false} is VALID [2022-02-20 16:55:56,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {711#false} assume !(sll_circular_get_data_at_~index#1 > 0); {711#false} is VALID [2022-02-20 16:55:56,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {711#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {711#false} is VALID [2022-02-20 16:55:56,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {711#false} main_~i~0#1 := 0; {711#false} is VALID [2022-02-20 16:55:56,987 INFO L290 TraceCheckUtils]: 25: Hoare triple {725#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)} assume !(main_~i~0#1 < main_~len~0#1); {711#false} is VALID [2022-02-20 16:55:56,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {852#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {725#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {852#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} assume { :end_inline_sll_circular_update_at } true; {852#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {852#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {852#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {852#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_update_at_~index#1 > 0); {852#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {852#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {852#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {852#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_create_~len#1 > 1); {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,993 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {710#true} {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #125#return; {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {710#true} assume true; {710#true} is VALID [2022-02-20 16:55:56,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {710#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {710#true} is VALID [2022-02-20 16:55:56,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {710#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {710#true} is VALID [2022-02-20 16:55:56,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {710#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {710#true} is VALID [2022-02-20 16:55:56,994 INFO L272 TraceCheckUtils]: 10: Hoare triple {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {710#true} is VALID [2022-02-20 16:55:56,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_circular_create_~len#1 > 1); {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,996 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {710#true} {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} #123#return; {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {710#true} assume true; {710#true} is VALID [2022-02-20 16:55:56,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {710#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {710#true} is VALID [2022-02-20 16:55:56,996 INFO L290 TraceCheckUtils]: 4: Hoare triple {710#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {710#true} is VALID [2022-02-20 16:55:56,996 INFO L290 TraceCheckUtils]: 3: Hoare triple {710#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {710#true} is VALID [2022-02-20 16:55:56,996 INFO L272 TraceCheckUtils]: 2: Hoare triple {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {710#true} is VALID [2022-02-20 16:55:56,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {710#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {723#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:56,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {710#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(19, 2); {710#true} is VALID [2022-02-20 16:55:56,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:55:56,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946933833] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:55:56,998 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:55:56,998 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-02-20 16:55:56,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387562501] [2022-02-20 16:55:56,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:55:56,999 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-02-20 16:55:57,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:55:57,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:55:57,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:57,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 16:55:57,036 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:55:57,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 16:55:57,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:55:57,037 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:55:57,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:57,285 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-02-20 16:55:57,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:55:57,285 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-02-20 16:55:57,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:55:57,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:55:57,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-02-20 16:55:57,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:55:57,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-02-20 16:55:57,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 78 transitions. [2022-02-20 16:55:57,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:57,327 INFO L225 Difference]: With dead ends: 66 [2022-02-20 16:55:57,327 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 16:55:57,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:55:57,327 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 105 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:55:57,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 117 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:55:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 16:55:57,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2022-02-20 16:55:57,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:55:57,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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:55:57,342 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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:55:57,342 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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:55:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:57,344 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-02-20 16:55:57,344 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-02-20 16:55:57,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:57,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:57,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-02-20 16:55:57,345 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-02-20 16:55:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:57,346 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-02-20 16:55:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-02-20 16:55:57,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:57,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:57,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:55:57,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:55:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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:55:57,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-02-20 16:55:57,348 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 33 [2022-02-20 16:55:57,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:55:57,348 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-02-20 16:55:57,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:55:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-02-20 16:55:57,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 16:55:57,348 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:55:57,348 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:55:57,367 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:55:57,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 16:55:57,549 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:55:57,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:55:57,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2072516636, now seen corresponding path program 2 times [2022-02-20 16:55:57,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:55:57,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152215031] [2022-02-20 16:55:57,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:57,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:55:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:57,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:55:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:57,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {1202#(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(8);~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; {1185#true} is VALID [2022-02-20 16:55:57,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {1185#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1185#true} is VALID [2022-02-20 16:55:57,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {1185#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1185#true} is VALID [2022-02-20 16:55:57,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {1185#true} assume true; {1185#true} is VALID [2022-02-20 16:55:57,668 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1185#true} {1187#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #123#return; {1187#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:57,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:55:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:57,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {1202#(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(8);~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; {1185#true} is VALID [2022-02-20 16:55:57,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {1185#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1185#true} is VALID [2022-02-20 16:55:57,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {1185#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1185#true} is VALID [2022-02-20 16:55:57,679 INFO L290 TraceCheckUtils]: 3: Hoare triple {1185#true} assume true; {1185#true} is VALID [2022-02-20 16:55:57,679 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1185#true} {1187#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #125#return; {1187#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:57,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {1185#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(19, 2); {1185#true} is VALID [2022-02-20 16:55:57,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {1185#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {1187#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:57,681 INFO L272 TraceCheckUtils]: 2: Hoare triple {1187#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {1202#(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:55:57,681 INFO L290 TraceCheckUtils]: 3: Hoare triple {1202#(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(8);~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; {1185#true} is VALID [2022-02-20 16:55:57,681 INFO L290 TraceCheckUtils]: 4: Hoare triple {1185#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1185#true} is VALID [2022-02-20 16:55:57,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {1185#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1185#true} is VALID [2022-02-20 16:55:57,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {1185#true} assume true; {1185#true} is VALID [2022-02-20 16:55:57,682 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1185#true} {1187#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #123#return; {1187#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:57,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {1187#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1187#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:57,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {1187#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} assume !!(sll_circular_create_~len#1 > 1); {1187#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:57,683 INFO L272 TraceCheckUtils]: 10: Hoare triple {1187#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {1202#(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:55:57,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {1202#(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(8);~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; {1185#true} is VALID [2022-02-20 16:55:57,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {1185#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1185#true} is VALID [2022-02-20 16:55:57,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {1185#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1185#true} is VALID [2022-02-20 16:55:57,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {1185#true} assume true; {1185#true} is VALID [2022-02-20 16:55:57,685 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1185#true} {1187#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #125#return; {1187#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:55:57,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {1187#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {1198#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:57,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {1198#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_create_~len#1 > 1); {1198#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:57,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {1198#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1198#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:57,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {1198#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {1198#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:57,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {1198#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {1198#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:57,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {1198#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_circular_update_at_~index#1 > 0); {1198#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:57,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {1198#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {1198#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:57,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {1198#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume { :end_inline_sll_circular_update_at } true; {1198#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:57,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {1198#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1198#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:57,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {1198#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {1199#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (= (+ |ULTIMATE.start_main_~i~0#1| (* (- 1) |ULTIMATE.start_sll_circular_update_at_~index#1|)) 0))} is VALID [2022-02-20 16:55:57,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {1199#(and (<= 2 |ULTIMATE.start_main_~len~0#1|) (= (+ |ULTIMATE.start_main_~i~0#1| (* (- 1) |ULTIMATE.start_sll_circular_update_at_~index#1|)) 0))} assume !(sll_circular_update_at_~index#1 > 0); {1200#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:57,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {1200#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {1200#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:57,691 INFO L290 TraceCheckUtils]: 28: Hoare triple {1200#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} assume { :end_inline_sll_circular_update_at } true; {1200#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:57,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {1200#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1201#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:55:57,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {1201#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)} assume !(main_~i~0#1 < main_~len~0#1); {1186#false} is VALID [2022-02-20 16:55:57,692 INFO L290 TraceCheckUtils]: 31: Hoare triple {1186#false} main_~i~0#1 := 0; {1186#false} is VALID [2022-02-20 16:55:57,692 INFO L290 TraceCheckUtils]: 32: Hoare triple {1186#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {1186#false} is VALID [2022-02-20 16:55:57,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {1186#false} assume !(sll_circular_get_data_at_~index#1 > 0); {1186#false} is VALID [2022-02-20 16:55:57,692 INFO L290 TraceCheckUtils]: 34: Hoare triple {1186#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {1186#false} is VALID [2022-02-20 16:55:57,692 INFO L290 TraceCheckUtils]: 35: Hoare triple {1186#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {1186#false} is VALID [2022-02-20 16:55:57,692 INFO L290 TraceCheckUtils]: 36: Hoare triple {1186#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {1186#false} is VALID [2022-02-20 16:55:57,692 INFO L290 TraceCheckUtils]: 37: Hoare triple {1186#false} assume !false; {1186#false} is VALID [2022-02-20 16:55:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:55:57,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:55:57,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152215031] [2022-02-20 16:55:57,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152215031] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:55:57,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039042143] [2022-02-20 16:55:57,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:55:57,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:55:57,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:55:57,700 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:55:57,700 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:55:57,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:55:57,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:55:57,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:55:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:57,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:55:57,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {1185#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(19, 2); {1185#true} is VALID [2022-02-20 16:55:57,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {1185#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {1185#true} is VALID [2022-02-20 16:55:57,932 INFO L272 TraceCheckUtils]: 2: Hoare triple {1185#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {1185#true} is VALID [2022-02-20 16:55:57,933 INFO L290 TraceCheckUtils]: 3: Hoare triple {1185#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {1185#true} is VALID [2022-02-20 16:55:57,933 INFO L290 TraceCheckUtils]: 4: Hoare triple {1185#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1185#true} is VALID [2022-02-20 16:55:57,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {1185#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1185#true} is VALID [2022-02-20 16:55:57,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {1185#true} assume true; {1185#true} is VALID [2022-02-20 16:55:57,934 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1185#true} {1185#true} #123#return; {1185#true} is VALID [2022-02-20 16:55:57,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {1185#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1185#true} is VALID [2022-02-20 16:55:57,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {1185#true} assume !!(sll_circular_create_~len#1 > 1); {1185#true} is VALID [2022-02-20 16:55:57,934 INFO L272 TraceCheckUtils]: 10: Hoare triple {1185#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {1185#true} is VALID [2022-02-20 16:55:57,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {1185#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {1185#true} is VALID [2022-02-20 16:55:57,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {1185#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1185#true} is VALID [2022-02-20 16:55:57,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {1185#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1185#true} is VALID [2022-02-20 16:55:57,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {1185#true} assume true; {1185#true} is VALID [2022-02-20 16:55:57,935 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1185#true} {1185#true} #125#return; {1185#true} is VALID [2022-02-20 16:55:57,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {1185#true} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {1185#true} is VALID [2022-02-20 16:55:57,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {1185#true} assume !(sll_circular_create_~len#1 > 1); {1185#true} is VALID [2022-02-20 16:55:57,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {1185#true} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1185#true} is VALID [2022-02-20 16:55:57,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {1185#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:55:57,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:55:57,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(sll_circular_update_at_~index#1 > 0); {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:55:57,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:55:57,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_sll_circular_update_at } true; {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:55:57,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1279#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:55:57,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {1279#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {1283#(<= 1 |ULTIMATE.start_sll_circular_update_at_~index#1|)} is VALID [2022-02-20 16:55:57,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {1283#(<= 1 |ULTIMATE.start_sll_circular_update_at_~index#1|)} assume !(sll_circular_update_at_~index#1 > 0); {1186#false} is VALID [2022-02-20 16:55:57,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {1186#false} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {1186#false} is VALID [2022-02-20 16:55:57,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {1186#false} assume { :end_inline_sll_circular_update_at } true; {1186#false} is VALID [2022-02-20 16:55:57,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {1186#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1186#false} is VALID [2022-02-20 16:55:57,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {1186#false} assume !(main_~i~0#1 < main_~len~0#1); {1186#false} is VALID [2022-02-20 16:55:57,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {1186#false} main_~i~0#1 := 0; {1186#false} is VALID [2022-02-20 16:55:57,942 INFO L290 TraceCheckUtils]: 32: Hoare triple {1186#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {1186#false} is VALID [2022-02-20 16:55:57,942 INFO L290 TraceCheckUtils]: 33: Hoare triple {1186#false} assume !(sll_circular_get_data_at_~index#1 > 0); {1186#false} is VALID [2022-02-20 16:55:57,942 INFO L290 TraceCheckUtils]: 34: Hoare triple {1186#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {1186#false} is VALID [2022-02-20 16:55:57,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {1186#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {1186#false} is VALID [2022-02-20 16:55:57,942 INFO L290 TraceCheckUtils]: 36: Hoare triple {1186#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {1186#false} is VALID [2022-02-20 16:55:57,942 INFO L290 TraceCheckUtils]: 37: Hoare triple {1186#false} assume !false; {1186#false} is VALID [2022-02-20 16:55:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:55:57,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:55:58,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {1186#false} assume !false; {1186#false} is VALID [2022-02-20 16:55:58,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {1186#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {1186#false} is VALID [2022-02-20 16:55:58,039 INFO L290 TraceCheckUtils]: 35: Hoare triple {1186#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {1186#false} is VALID [2022-02-20 16:55:58,039 INFO L290 TraceCheckUtils]: 34: Hoare triple {1186#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {1186#false} is VALID [2022-02-20 16:55:58,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {1186#false} assume !(sll_circular_get_data_at_~index#1 > 0); {1186#false} is VALID [2022-02-20 16:55:58,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {1186#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {1186#false} is VALID [2022-02-20 16:55:58,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {1186#false} main_~i~0#1 := 0; {1186#false} is VALID [2022-02-20 16:55:58,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {1186#false} assume !(main_~i~0#1 < main_~len~0#1); {1186#false} is VALID [2022-02-20 16:55:58,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {1186#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1186#false} is VALID [2022-02-20 16:55:58,040 INFO L290 TraceCheckUtils]: 28: Hoare triple {1186#false} assume { :end_inline_sll_circular_update_at } true; {1186#false} is VALID [2022-02-20 16:55:58,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {1186#false} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {1186#false} is VALID [2022-02-20 16:55:58,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {1283#(<= 1 |ULTIMATE.start_sll_circular_update_at_~index#1|)} assume !(sll_circular_update_at_~index#1 > 0); {1186#false} is VALID [2022-02-20 16:55:58,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {1279#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {1283#(<= 1 |ULTIMATE.start_sll_circular_update_at_~index#1|)} is VALID [2022-02-20 16:55:58,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1279#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:55:58,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_sll_circular_update_at } true; {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:55:58,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:55:58,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(sll_circular_update_at_~index#1 > 0); {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:55:58,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:55:58,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {1185#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {1263#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:55:58,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {1185#true} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1185#true} is VALID [2022-02-20 16:55:58,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {1185#true} assume !(sll_circular_create_~len#1 > 1); {1185#true} is VALID [2022-02-20 16:55:58,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {1185#true} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {1185#true} is VALID [2022-02-20 16:55:58,043 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1185#true} {1185#true} #125#return; {1185#true} is VALID [2022-02-20 16:55:58,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {1185#true} assume true; {1185#true} is VALID [2022-02-20 16:55:58,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {1185#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1185#true} is VALID [2022-02-20 16:55:58,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {1185#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1185#true} is VALID [2022-02-20 16:55:58,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {1185#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {1185#true} is VALID [2022-02-20 16:55:58,044 INFO L272 TraceCheckUtils]: 10: Hoare triple {1185#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {1185#true} is VALID [2022-02-20 16:55:58,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {1185#true} assume !!(sll_circular_create_~len#1 > 1); {1185#true} is VALID [2022-02-20 16:55:58,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {1185#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1185#true} is VALID [2022-02-20 16:55:58,044 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1185#true} {1185#true} #123#return; {1185#true} is VALID [2022-02-20 16:55:58,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {1185#true} assume true; {1185#true} is VALID [2022-02-20 16:55:58,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {1185#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1185#true} is VALID [2022-02-20 16:55:58,045 INFO L290 TraceCheckUtils]: 4: Hoare triple {1185#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1185#true} is VALID [2022-02-20 16:55:58,045 INFO L290 TraceCheckUtils]: 3: Hoare triple {1185#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {1185#true} is VALID [2022-02-20 16:55:58,045 INFO L272 TraceCheckUtils]: 2: Hoare triple {1185#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {1185#true} is VALID [2022-02-20 16:55:58,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {1185#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {1185#true} is VALID [2022-02-20 16:55:58,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {1185#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(19, 2); {1185#true} is VALID [2022-02-20 16:55:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:55:58,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039042143] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:55:58,046 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:55:58,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2022-02-20 16:55:58,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046866322] [2022-02-20 16:55:58,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:55:58,047 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-02-20 16:55:58,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:55:58,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:55:58,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:58,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 16:55:58,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:55:58,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 16:55:58,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:55:58,082 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:55:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:58,406 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-02-20 16:55:58,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 16:55:58,406 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-02-20 16:55:58,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:55:58,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:55:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2022-02-20 16:55:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:55:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2022-02-20 16:55:58,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 78 transitions. [2022-02-20 16:55:58,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:55:58,448 INFO L225 Difference]: With dead ends: 65 [2022-02-20 16:55:58,448 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 16:55:58,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-02-20 16:55:58,448 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 96 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:55:58,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 191 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:55:58,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 16:55:58,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2022-02-20 16:55:58,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:55:58,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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:55:58,470 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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:55:58,470 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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:55:58,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:58,472 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-02-20 16:55:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-02-20 16:55:58,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:58,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:58,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 51 states. [2022-02-20 16:55:58,473 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 51 states. [2022-02-20 16:55:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:55:58,474 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-02-20 16:55:58,474 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-02-20 16:55:58,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:55:58,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:55:58,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:55:58,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:55:58,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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:55:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-02-20 16:55:58,476 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 38 [2022-02-20 16:55:58,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:55:58,476 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-02-20 16:55:58,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:55:58,477 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-02-20 16:55:58,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 16:55:58,477 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:55:58,477 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:55:58,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:55:58,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:55:58,696 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:55:58,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:55:58,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1973765418, now seen corresponding path program 1 times [2022-02-20 16:55:58,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:55:58,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343466723] [2022-02-20 16:55:58,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:58,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:55:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:59,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:55:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:59,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {1718#(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(8);~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; {1719#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:55:59,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {1719#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1719#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:55:59,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {1719#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1720#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:55:59,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {1720#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {1720#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:55:59,101 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1720#(= (select |#valid| |node_create_#res#1.base|) 1)} {1690#true} #123#return; {1697#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 16:55:59,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:55:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:59,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {1718#(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(8);~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; {1721#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:59,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {1721#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1721#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:59,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {1721#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.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~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1722#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} is VALID [2022-02-20 16:55:59,168 INFO L290 TraceCheckUtils]: 3: Hoare triple {1722#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} assume true; {1722#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} is VALID [2022-02-20 16:55:59,169 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1722#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} {1698#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #125#return; {1704#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 16:55:59,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {1690#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(19, 2); {1690#true} is VALID [2022-02-20 16:55:59,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {1690#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {1690#true} is VALID [2022-02-20 16:55:59,170 INFO L272 TraceCheckUtils]: 2: Hoare triple {1690#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {1718#(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:55:59,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {1718#(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(8);~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; {1719#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:55:59,170 INFO L290 TraceCheckUtils]: 4: Hoare triple {1719#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1719#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:55:59,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {1719#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1720#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:55:59,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {1720#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {1720#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:55:59,172 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1720#(= (select |#valid| |node_create_#res#1.base|) 1)} {1690#true} #123#return; {1697#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 16:55:59,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {1697#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1698#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 16:55:59,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {1698#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} assume !!(sll_circular_create_~len#1 > 1); {1698#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 16:55:59,174 INFO L272 TraceCheckUtils]: 10: Hoare triple {1698#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {1718#(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:55:59,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {1718#(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(8);~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; {1721#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:59,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {1721#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1721#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:55:59,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {1721#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.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~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1722#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} is VALID [2022-02-20 16:55:59,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {1722#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} assume true; {1722#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} is VALID [2022-02-20 16:55:59,178 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1722#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} {1698#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #125#return; {1704#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 16:55:59,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {1704#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {1705#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} is VALID [2022-02-20 16:55:59,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {1705#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} assume !(sll_circular_create_~len#1 > 1); {1705#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} is VALID [2022-02-20 16:55:59,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {1705#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1706#(and (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)))} is VALID [2022-02-20 16:55:59,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {1706#(and (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)))} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {1707#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:55:59,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {1707#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {1708#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_sll_circular_update_at_~data#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:55:59,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {1708#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_sll_circular_update_at_~data#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(sll_circular_update_at_~index#1 > 0); {1708#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_sll_circular_update_at_~data#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:55:59,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {1708#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_sll_circular_update_at_~data#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {1709#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:55:59,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {1709#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume { :end_inline_sll_circular_update_at } true; {1709#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:55:59,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {1709#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1710#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:55:59,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {1710#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {1711#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:55:59,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {1711#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {1712#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~len~0#1|) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:55:59,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {1712#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~len~0#1|) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(sll_circular_update_at_~index#1 > 0); {1712#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~len~0#1|) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:55:59,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {1712#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~len~0#1|) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {1713#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:55:59,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {1713#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume { :end_inline_sll_circular_update_at } true; {1713#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:55:59,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {1713#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1713#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:55:59,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {1713#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_~i~0#1 < main_~len~0#1); {1713#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:55:59,194 INFO L290 TraceCheckUtils]: 32: Hoare triple {1713#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_~i~0#1 := 0; {1714#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:55:59,195 INFO L290 TraceCheckUtils]: 33: Hoare triple {1714#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) 4) |ULTIMATE.start_main_~len~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {1715#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:55:59,196 INFO L290 TraceCheckUtils]: 34: Hoare triple {1715#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} assume !(sll_circular_get_data_at_~index#1 > 0); {1715#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:55:59,196 INFO L290 TraceCheckUtils]: 35: Hoare triple {1715#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {1716#(and (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_sll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:55:59,196 INFO L290 TraceCheckUtils]: 36: Hoare triple {1716#(and (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_sll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|))} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {1717#(and (< |ULTIMATE.start_main_#t~ret17#1| (+ |ULTIMATE.start_main_~expected~0#1| 1)) (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|))} is VALID [2022-02-20 16:55:59,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {1717#(and (< |ULTIMATE.start_main_#t~ret17#1| (+ |ULTIMATE.start_main_~expected~0#1| 1)) (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|))} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {1691#false} is VALID [2022-02-20 16:55:59,197 INFO L290 TraceCheckUtils]: 38: Hoare triple {1691#false} assume !false; {1691#false} is VALID [2022-02-20 16:55:59,197 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:55:59,198 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:55:59,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343466723] [2022-02-20 16:55:59,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343466723] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:55:59,198 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214225952] [2022-02-20 16:55:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:55:59,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:55:59,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:55:59,199 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:55:59,259 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:55:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:59,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 100 conjunts are in the unsatisfiable core [2022-02-20 16:55:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:55:59,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:55:59,379 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:55:59,544 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 16:55:59,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 16:55:59,593 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:55:59,659 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 16:55:59,660 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 19 treesize of output 22 [2022-02-20 16:55:59,855 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:55:59,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:55:59,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-02-20 16:55:59,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-02-20 16:56:00,083 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 16 treesize of output 18 [2022-02-20 16:56:00,326 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 19 treesize of output 7 [2022-02-20 16:56:00,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {1690#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(19, 2); {1690#true} is VALID [2022-02-20 16:56:00,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {1690#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {1729#(= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:00,406 INFO L272 TraceCheckUtils]: 2: Hoare triple {1729#(= |ULTIMATE.start_main_~len~0#1| 2)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {1690#true} is VALID [2022-02-20 16:56:00,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {1690#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {1719#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:56:00,407 INFO L290 TraceCheckUtils]: 4: Hoare triple {1719#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1719#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:56:00,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {1719#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1720#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:56:00,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {1720#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {1720#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:56:00,409 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1720#(= (select |#valid| |node_create_#res#1.base|) 1)} {1729#(= |ULTIMATE.start_main_~len~0#1| 2)} #123#return; {1748#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:56:00,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {1748#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| 2))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1752#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:56:00,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {1752#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2))} assume !!(sll_circular_create_~len#1 > 1); {1752#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:56:00,410 INFO L272 TraceCheckUtils]: 10: Hoare triple {1752#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {1759#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 16:56:00,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {1759#(= |old(#valid)| |#valid|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {1721#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:56:00,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {1721#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1721#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:56:00,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {1721#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.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~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1722#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} is VALID [2022-02-20 16:56:00,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {1722#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} assume true; {1722#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} is VALID [2022-02-20 16:56:00,413 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1722#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} {1752#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2))} #125#return; {1775#(and (<= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 16:56:00,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#(and (<= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {1779#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 16:56:00,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {1779#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !(sll_circular_create_~len#1 > 1); {1779#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 16:56:00,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {1779#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1786#(and (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|))} is VALID [2022-02-20 16:56:00,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {1786#(and (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|))} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {1790#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:00,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {1790#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {1794#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_update_at_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:00,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {1794#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_update_at_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(sll_circular_update_at_~index#1 > 0); {1794#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_update_at_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:00,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {1794#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_update_at_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {1801#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:00,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {1801#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume { :end_inline_sll_circular_update_at } true; {1801#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:00,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {1801#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1801#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:00,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {1801#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {1811#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:00,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {1811#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {1815#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:00,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {1815#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(sll_circular_update_at_~index#1 > 0); {1815#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:00,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {1815#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {1822#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:00,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {1822#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume { :end_inline_sll_circular_update_at } true; {1822#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:00,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {1822#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1822#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:00,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {1822#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_~i~0#1 < main_~len~0#1); {1822#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:00,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {1822#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_~i~0#1 := 0; {1835#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:00,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {1835#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {1839#(and (<= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) (= 2 |ULTIMATE.start_main_~expected~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:56:00,424 INFO L290 TraceCheckUtils]: 34: Hoare triple {1839#(and (<= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) (= 2 |ULTIMATE.start_main_~expected~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} assume !(sll_circular_get_data_at_~index#1 > 0); {1839#(and (<= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) (= 2 |ULTIMATE.start_main_~expected~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:56:00,424 INFO L290 TraceCheckUtils]: 35: Hoare triple {1839#(and (<= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) (= 2 |ULTIMATE.start_main_~expected~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {1846#(and (= 2 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:56:00,425 INFO L290 TraceCheckUtils]: 36: Hoare triple {1846#(and (= 2 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|))} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {1850#(and (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|) (= 2 |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:56:00,425 INFO L290 TraceCheckUtils]: 37: Hoare triple {1850#(and (= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|) (= 2 |ULTIMATE.start_main_~expected~0#1|))} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {1691#false} is VALID [2022-02-20 16:56:00,425 INFO L290 TraceCheckUtils]: 38: Hoare triple {1691#false} assume !false; {1691#false} is VALID [2022-02-20 16:56:00,426 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:56:00,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:56:00,619 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_514 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_514) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_514 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_514) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2022-02-20 16:56:00,649 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_514 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_514) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_514 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_514) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2022-02-20 16:56:00,672 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_514 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_514) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_514 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_514) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2022-02-20 16:56:00,748 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:56:00,748 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-02-20 16:56:00,768 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:56:00,768 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 67 [2022-02-20 16:56:00,775 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 25 treesize of output 21 [2022-02-20 16:56:00,840 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:56:00,841 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-02-20 16:56:00,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:56:00,853 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2022-02-20 16:56:00,857 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 25 treesize of output 21 [2022-02-20 16:56:01,084 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_510 Int) (v_ArrVal_508 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_510) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) is different from false [2022-02-20 16:56:01,121 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:56:01,121 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-02-20 16:56:01,128 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 43 treesize of output 39 [2022-02-20 16:56:01,133 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 52 treesize of output 48 [2022-02-20 16:56:01,139 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 24 treesize of output 22 [2022-02-20 16:56:01,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {1691#false} assume !false; {1691#false} is VALID [2022-02-20 16:56:01,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {1717#(and (< |ULTIMATE.start_main_#t~ret17#1| (+ |ULTIMATE.start_main_~expected~0#1| 1)) (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|))} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {1691#false} is VALID [2022-02-20 16:56:01,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {1716#(and (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_sll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|))} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {1717#(and (< |ULTIMATE.start_main_#t~ret17#1| (+ |ULTIMATE.start_main_~expected~0#1| 1)) (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|))} is VALID [2022-02-20 16:56:01,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {1715#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {1716#(and (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_sll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:56:01,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {1715#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} assume !(sll_circular_get_data_at_~index#1 > 0); {1715#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:56:01,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {1872#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))))} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {1715#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:56:01,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {1876#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|))} main_~i~0#1 := 0; {1872#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))))} is VALID [2022-02-20 16:56:01,589 INFO L290 TraceCheckUtils]: 31: Hoare triple {1876#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|))} assume !(main_~i~0#1 < main_~len~0#1); {1876#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:56:01,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {1876#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1876#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:56:01,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {1876#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|))} assume { :end_inline_sll_circular_update_at } true; {1876#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:56:01,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {1889#(and (forall ((v_ArrVal_514 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_514 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|)))} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {1876#(and (<= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|))} is VALID [2022-02-20 16:56:01,591 INFO L290 TraceCheckUtils]: 27: Hoare triple {1889#(and (forall ((v_ArrVal_514 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_514 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|)))} assume !(sll_circular_update_at_~index#1 > 0); {1889#(and (forall ((v_ArrVal_514 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_514 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|)))} is VALID [2022-02-20 16:56:01,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {1896#(and (forall ((v_ArrVal_514 (Array Int Int))) (<= (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_514 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))))} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {1889#(and (forall ((v_ArrVal_514 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_514 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|)))} is VALID [2022-02-20 16:56:01,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {1900#(and (forall ((v_ArrVal_514 (Array Int Int))) (<= (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_514 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {1896#(and (forall ((v_ArrVal_514 (Array Int Int))) (<= (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_514 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))))} is VALID [2022-02-20 16:56:01,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {1900#(and (forall ((v_ArrVal_514 (Array Int Int))) (<= (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_514 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1900#(and (forall ((v_ArrVal_514 (Array Int Int))) (<= (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_514 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))))} is VALID [2022-02-20 16:56:01,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {1900#(and (forall ((v_ArrVal_514 (Array Int Int))) (<= (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_514 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))))} assume { :end_inline_sll_circular_update_at } true; {1900#(and (forall ((v_ArrVal_514 (Array Int Int))) (<= (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_514 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))))} is VALID [2022-02-20 16:56:01,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {1910#(and (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (<= |ULTIMATE.start_sll_circular_update_at_~data#1| |ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_510 Int)) (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_510)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (<= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_update_at_~data#1|))} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {1900#(and (forall ((v_ArrVal_514 (Array Int Int))) (<= (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_514 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))))} is VALID [2022-02-20 16:56:01,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {1910#(and (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (<= |ULTIMATE.start_sll_circular_update_at_~data#1| |ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_510 Int)) (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_510)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (<= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_update_at_~data#1|))} assume !(sll_circular_update_at_~index#1 > 0); {1910#(and (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (<= |ULTIMATE.start_sll_circular_update_at_~data#1| |ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_510 Int)) (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_510)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (<= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_update_at_~data#1|))} is VALID [2022-02-20 16:56:01,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {1917#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_510 Int)) (not (= (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_510) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {1910#(and (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (<= |ULTIMATE.start_sll_circular_update_at_~data#1| |ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_510 Int)) (not (= |ULTIMATE.start_main_~s~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_510)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)))) (<= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_update_at_~data#1|))} is VALID [2022-02-20 16:56:01,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {1921#(forall ((v_ArrVal_510 Int)) (not (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |ULTIMATE.start_sll_circular_create_#res#1.offset| 4) v_ArrVal_510) |ULTIMATE.start_sll_circular_create_#res#1.offset|))))} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {1917#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_510 Int)) (not (= (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_510) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))))} is VALID [2022-02-20 16:56:01,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {1925#(forall ((v_ArrVal_510 Int) (v_ArrVal_508 (Array Int Int))) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_508) |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_510) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1921#(forall ((v_ArrVal_510 Int)) (not (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |ULTIMATE.start_sll_circular_create_#res#1.offset| 4) v_ArrVal_510) |ULTIMATE.start_sll_circular_create_#res#1.offset|))))} is VALID [2022-02-20 16:56:01,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {1925#(forall ((v_ArrVal_510 Int) (v_ArrVal_508 (Array Int Int))) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_508) |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_510) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} assume !(sll_circular_create_~len#1 > 1); {1925#(forall ((v_ArrVal_510 Int) (v_ArrVal_508 (Array Int Int))) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_508) |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_510) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} is VALID [2022-02-20 16:56:01,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {1932#(and (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {1925#(forall ((v_ArrVal_510 Int) (v_ArrVal_508 (Array Int Int))) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_508) |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_510) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))} is VALID [2022-02-20 16:56:01,601 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1940#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} {1936#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)))} #125#return; {1932#(and (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 16:56:01,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {1940#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} assume true; {1940#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} is VALID [2022-02-20 16:56:01,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {1947#(= 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~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1940#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} is VALID [2022-02-20 16:56:01,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {1947#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1947#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:56:01,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {1954#(forall ((|v_node_create_~temp~0#1.base_20| Int)) (or (not (= (select |#valid| |v_node_create_~temp~0#1.base_20|) 0)) (= (select |old(#valid)| |v_node_create_~temp~0#1.base_20|) 0)))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {1947#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:56:01,603 INFO L272 TraceCheckUtils]: 10: Hoare triple {1936#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {1954#(forall ((|v_node_create_~temp~0#1.base_20| Int)) (or (not (= (select |#valid| |v_node_create_~temp~0#1.base_20|) 0)) (= (select |old(#valid)| |v_node_create_~temp~0#1.base_20|) 0)))} is VALID [2022-02-20 16:56:01,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {1936#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)))} assume !!(sll_circular_create_~len#1 > 1); {1936#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)))} is VALID [2022-02-20 16:56:01,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {1961#(not (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {1936#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)))} is VALID [2022-02-20 16:56:01,605 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1968#(not (= (select |#valid| |node_create_#res#1.base|) 0))} {1690#true} #123#return; {1961#(not (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0))} is VALID [2022-02-20 16:56:01,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {1968#(not (= (select |#valid| |node_create_#res#1.base|) 0))} assume true; {1968#(not (= (select |#valid| |node_create_#res#1.base|) 0))} is VALID [2022-02-20 16:56:01,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {1975#(not (= 0 (select |#valid| |node_create_~temp~0#1.base|)))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1968#(not (= (select |#valid| |node_create_#res#1.base|) 0))} is VALID [2022-02-20 16:56:01,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {1975#(not (= 0 (select |#valid| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1975#(not (= 0 (select |#valid| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:56:01,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {1690#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {1975#(not (= 0 (select |#valid| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:56:01,607 INFO L272 TraceCheckUtils]: 2: Hoare triple {1690#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {1690#true} is VALID [2022-02-20 16:56:01,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {1690#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {1690#true} is VALID [2022-02-20 16:56:01,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {1690#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(19, 2); {1690#true} is VALID [2022-02-20 16:56:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-02-20 16:56:01,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214225952] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:56:01,608 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:56:01,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 57 [2022-02-20 16:56:01,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354124225] [2022-02-20 16:56:01,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:56:01,609 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 48 states have internal predecessors, (90), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 39 [2022-02-20 16:56:01,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:01,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 48 states have internal predecessors, (90), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 16:56:01,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:01,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-02-20 16:56:01,700 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:56:01,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-02-20 16:56:01,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2577, Unknown=4, NotChecked=420, Total=3192 [2022-02-20 16:56:01,701 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 48 states have internal predecessors, (90), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 16:56:04,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:04,100 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2022-02-20 16:56:04,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-20 16:56:04,100 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 48 states have internal predecessors, (90), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 39 [2022-02-20 16:56:04,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 48 states have internal predecessors, (90), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 16:56:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 95 transitions. [2022-02-20 16:56:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 48 states have internal predecessors, (90), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 16:56:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 95 transitions. [2022-02-20 16:56:04,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 95 transitions. [2022-02-20 16:56:04,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:04,180 INFO L225 Difference]: With dead ends: 86 [2022-02-20 16:56:04,180 INFO L226 Difference]: Without dead ends: 84 [2022-02-20 16:56:04,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=393, Invalid=4175, Unknown=4, NotChecked=540, Total=5112 [2022-02-20 16:56:04,182 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 141 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 334 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:04,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 532 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 685 Invalid, 0 Unknown, 334 Unchecked, 0.6s Time] [2022-02-20 16:56:04,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-02-20 16:56:04,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 59. [2022-02-20 16:56:04,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:04,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 59 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 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:56:04,277 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 59 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 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:56:04,277 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 59 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 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:56:04,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:04,280 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2022-02-20 16:56:04,280 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2022-02-20 16:56:04,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:04,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:04,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 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 84 states. [2022-02-20 16:56:04,281 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 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 84 states. [2022-02-20 16:56:04,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:04,285 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2022-02-20 16:56:04,285 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2022-02-20 16:56:04,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:04,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:04,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:04,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 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:56:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2022-02-20 16:56:04,292 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 39 [2022-02-20 16:56:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:04,292 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2022-02-20 16:56:04,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 48 states have internal predecessors, (90), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 16:56:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2022-02-20 16:56:04,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 16:56:04,299 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:04,299 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:04,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 16:56:04,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:04,516 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:04,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:04,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1005531927, now seen corresponding path program 1 times [2022-02-20 16:56:04,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:56:04,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239179541] [2022-02-20 16:56:04,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:04,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:56:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:04,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:56:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:04,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {2416#(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(8);~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; {2402#true} is VALID [2022-02-20 16:56:04,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {2402#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2402#true} is VALID [2022-02-20 16:56:04,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {2402#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2402#true} is VALID [2022-02-20 16:56:04,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {2402#true} assume true; {2402#true} is VALID [2022-02-20 16:56:04,572 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2402#true} {2402#true} #123#return; {2402#true} is VALID [2022-02-20 16:56:04,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:56:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:04,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {2416#(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(8);~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; {2402#true} is VALID [2022-02-20 16:56:04,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {2402#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2402#true} is VALID [2022-02-20 16:56:04,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {2402#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2402#true} is VALID [2022-02-20 16:56:04,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {2402#true} assume true; {2402#true} is VALID [2022-02-20 16:56:04,579 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2402#true} {2402#true} #125#return; {2402#true} is VALID [2022-02-20 16:56:04,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {2402#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(19, 2); {2402#true} is VALID [2022-02-20 16:56:04,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {2402#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {2402#true} is VALID [2022-02-20 16:56:04,580 INFO L272 TraceCheckUtils]: 2: Hoare triple {2402#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {2416#(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:56:04,580 INFO L290 TraceCheckUtils]: 3: Hoare triple {2416#(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(8);~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; {2402#true} is VALID [2022-02-20 16:56:04,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {2402#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2402#true} is VALID [2022-02-20 16:56:04,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {2402#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2402#true} is VALID [2022-02-20 16:56:04,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {2402#true} assume true; {2402#true} is VALID [2022-02-20 16:56:04,580 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2402#true} {2402#true} #123#return; {2402#true} is VALID [2022-02-20 16:56:04,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {2402#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {2402#true} is VALID [2022-02-20 16:56:04,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {2402#true} assume !!(sll_circular_create_~len#1 > 1); {2402#true} is VALID [2022-02-20 16:56:04,581 INFO L272 TraceCheckUtils]: 10: Hoare triple {2402#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {2416#(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:56:04,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {2416#(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(8);~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; {2402#true} is VALID [2022-02-20 16:56:04,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {2402#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2402#true} is VALID [2022-02-20 16:56:04,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {2402#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2402#true} is VALID [2022-02-20 16:56:04,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {2402#true} assume true; {2402#true} is VALID [2022-02-20 16:56:04,581 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2402#true} {2402#true} #125#return; {2402#true} is VALID [2022-02-20 16:56:04,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {2402#true} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {2402#true} is VALID [2022-02-20 16:56:04,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {2402#true} assume !(sll_circular_create_~len#1 > 1); {2402#true} is VALID [2022-02-20 16:56:04,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {2402#true} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {2402#true} is VALID [2022-02-20 16:56:04,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {2402#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {2402#true} is VALID [2022-02-20 16:56:04,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {2402#true} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {2402#true} is VALID [2022-02-20 16:56:04,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {2402#true} assume !(sll_circular_update_at_~index#1 > 0); {2402#true} is VALID [2022-02-20 16:56:04,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {2402#true} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {2402#true} is VALID [2022-02-20 16:56:04,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {2402#true} assume { :end_inline_sll_circular_update_at } true; {2402#true} is VALID [2022-02-20 16:56:04,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {2402#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {2402#true} is VALID [2022-02-20 16:56:04,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {2402#true} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {2402#true} is VALID [2022-02-20 16:56:04,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {2402#true} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {2402#true} is VALID [2022-02-20 16:56:04,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {2402#true} assume !(sll_circular_update_at_~index#1 > 0); {2402#true} is VALID [2022-02-20 16:56:04,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {2402#true} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {2402#true} is VALID [2022-02-20 16:56:04,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {2402#true} assume { :end_inline_sll_circular_update_at } true; {2402#true} is VALID [2022-02-20 16:56:04,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {2402#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {2402#true} is VALID [2022-02-20 16:56:04,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {2402#true} assume !(main_~i~0#1 < main_~len~0#1); {2402#true} is VALID [2022-02-20 16:56:04,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {2402#true} main_~i~0#1 := 0; {2414#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:04,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {2414#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {2415#(= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)} is VALID [2022-02-20 16:56:04,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {2415#(= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)} assume !!(sll_circular_get_data_at_~index#1 > 0);call sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;sll_circular_get_data_at_#t~post10#1 := sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#t~post10#1 - 1;havoc sll_circular_get_data_at_#t~post10#1; {2403#false} is VALID [2022-02-20 16:56:04,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {2403#false} assume !(sll_circular_get_data_at_~index#1 > 0); {2403#false} is VALID [2022-02-20 16:56:04,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {2403#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {2403#false} is VALID [2022-02-20 16:56:04,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {2403#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {2403#false} is VALID [2022-02-20 16:56:04,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {2403#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {2403#false} is VALID [2022-02-20 16:56:04,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {2403#false} assume !false; {2403#false} is VALID [2022-02-20 16:56:04,586 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 16:56:04,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:56:04,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239179541] [2022-02-20 16:56:04,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239179541] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:56:04,586 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:56:04,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:56:04,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340260862] [2022-02-20 16:56:04,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:56:04,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-02-20 16:56:04,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:04,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:04,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:04,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:56:04,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:56:04,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:56:04,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:56:04,607 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:04,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:04,794 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2022-02-20 16:56:04,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:56:04,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-02-20 16:56:04,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:04,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:04,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-02-20 16:56:04,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-02-20 16:56:04,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-02-20 16:56:04,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:04,833 INFO L225 Difference]: With dead ends: 76 [2022-02-20 16:56:04,833 INFO L226 Difference]: Without dead ends: 68 [2022-02-20 16:56:04,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:56:04,834 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:04,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 97 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:04,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-20 16:56:04,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2022-02-20 16:56:04,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:04,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 61 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 56 states have internal predecessors, (66), 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:56:04,940 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 61 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 56 states have internal predecessors, (66), 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:56:04,940 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 61 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 56 states have internal predecessors, (66), 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:56:04,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:04,941 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-02-20 16:56:04,941 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-02-20 16:56:04,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:04,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:04,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 56 states have internal predecessors, (66), 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 68 states. [2022-02-20 16:56:04,943 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 56 states have internal predecessors, (66), 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 68 states. [2022-02-20 16:56:04,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:04,944 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-02-20 16:56:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-02-20 16:56:04,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:04,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:04,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:04,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 56 states have internal predecessors, (66), 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:56:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2022-02-20 16:56:04,946 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 40 [2022-02-20 16:56:04,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:04,947 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2022-02-20 16:56:04,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:04,947 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-02-20 16:56:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 16:56:04,948 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:04,948 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:04,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 16:56:04,948 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:04,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:04,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1440509788, now seen corresponding path program 2 times [2022-02-20 16:56:04,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:56:04,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326465769] [2022-02-20 16:56:04,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:04,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:56:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:05,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:56:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:05,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {2777#(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(8);~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; {2761#true} is VALID [2022-02-20 16:56:05,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {2761#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2761#true} is VALID [2022-02-20 16:56:05,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {2761#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2761#true} is VALID [2022-02-20 16:56:05,032 INFO L290 TraceCheckUtils]: 3: Hoare triple {2761#true} assume true; {2761#true} is VALID [2022-02-20 16:56:05,032 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2761#true} {2761#true} #123#return; {2761#true} is VALID [2022-02-20 16:56:05,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:56:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:05,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {2777#(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(8);~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; {2761#true} is VALID [2022-02-20 16:56:05,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {2761#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2761#true} is VALID [2022-02-20 16:56:05,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {2761#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2761#true} is VALID [2022-02-20 16:56:05,039 INFO L290 TraceCheckUtils]: 3: Hoare triple {2761#true} assume true; {2761#true} is VALID [2022-02-20 16:56:05,039 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2761#true} {2761#true} #125#return; {2761#true} is VALID [2022-02-20 16:56:05,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {2761#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(19, 2); {2761#true} is VALID [2022-02-20 16:56:05,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {2761#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {2761#true} is VALID [2022-02-20 16:56:05,040 INFO L272 TraceCheckUtils]: 2: Hoare triple {2761#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {2777#(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:56:05,040 INFO L290 TraceCheckUtils]: 3: Hoare triple {2777#(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(8);~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; {2761#true} is VALID [2022-02-20 16:56:05,040 INFO L290 TraceCheckUtils]: 4: Hoare triple {2761#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2761#true} is VALID [2022-02-20 16:56:05,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {2761#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2761#true} is VALID [2022-02-20 16:56:05,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {2761#true} assume true; {2761#true} is VALID [2022-02-20 16:56:05,041 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2761#true} {2761#true} #123#return; {2761#true} is VALID [2022-02-20 16:56:05,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {2761#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {2761#true} is VALID [2022-02-20 16:56:05,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {2761#true} assume !!(sll_circular_create_~len#1 > 1); {2761#true} is VALID [2022-02-20 16:56:05,042 INFO L272 TraceCheckUtils]: 10: Hoare triple {2761#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {2777#(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:56:05,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {2777#(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(8);~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; {2761#true} is VALID [2022-02-20 16:56:05,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {2761#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2761#true} is VALID [2022-02-20 16:56:05,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {2761#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2761#true} is VALID [2022-02-20 16:56:05,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {2761#true} assume true; {2761#true} is VALID [2022-02-20 16:56:05,042 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2761#true} {2761#true} #125#return; {2761#true} is VALID [2022-02-20 16:56:05,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {2761#true} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {2761#true} is VALID [2022-02-20 16:56:05,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {2761#true} assume !(sll_circular_create_~len#1 > 1); {2761#true} is VALID [2022-02-20 16:56:05,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {2761#true} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {2761#true} is VALID [2022-02-20 16:56:05,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {2761#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {2773#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:05,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {2773#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {2773#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:05,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {2773#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(sll_circular_update_at_~index#1 > 0); {2773#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:05,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {2773#(= |ULTIMATE.start_main_~i~0#1| 0)} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {2773#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:05,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {2773#(= |ULTIMATE.start_main_~i~0#1| 0)} assume { :end_inline_sll_circular_update_at } true; {2773#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:05,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {2773#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {2774#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 16:56:05,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {2774#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {2775#(and (= (+ |ULTIMATE.start_main_~i~0#1| (* (- 1) |ULTIMATE.start_sll_circular_update_at_~index#1|)) 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 16:56:05,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {2775#(and (= (+ |ULTIMATE.start_main_~i~0#1| (* (- 1) |ULTIMATE.start_sll_circular_update_at_~index#1|)) 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {2776#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)} is VALID [2022-02-20 16:56:05,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {2776#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {2762#false} is VALID [2022-02-20 16:56:05,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {2762#false} assume !(sll_circular_update_at_~index#1 > 0); {2762#false} is VALID [2022-02-20 16:56:05,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {2762#false} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {2762#false} is VALID [2022-02-20 16:56:05,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {2762#false} assume { :end_inline_sll_circular_update_at } true; {2762#false} is VALID [2022-02-20 16:56:05,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {2762#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {2762#false} is VALID [2022-02-20 16:56:05,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {2762#false} assume !(main_~i~0#1 < main_~len~0#1); {2762#false} is VALID [2022-02-20 16:56:05,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {2762#false} main_~i~0#1 := 0; {2762#false} is VALID [2022-02-20 16:56:05,046 INFO L290 TraceCheckUtils]: 34: Hoare triple {2762#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {2762#false} is VALID [2022-02-20 16:56:05,046 INFO L290 TraceCheckUtils]: 35: Hoare triple {2762#false} assume !(sll_circular_get_data_at_~index#1 > 0); {2762#false} is VALID [2022-02-20 16:56:05,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {2762#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {2762#false} is VALID [2022-02-20 16:56:05,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {2762#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {2762#false} is VALID [2022-02-20 16:56:05,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {2762#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {2762#false} is VALID [2022-02-20 16:56:05,047 INFO L290 TraceCheckUtils]: 39: Hoare triple {2762#false} assume !false; {2762#false} is VALID [2022-02-20 16:56:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:56:05,047 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:56:05,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326465769] [2022-02-20 16:56:05,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326465769] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:56:05,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765828743] [2022-02-20 16:56:05,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:56:05,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:05,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:56:05,064 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:56:05,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 16:56:05,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:56:05,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:56:05,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 16:56:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:05,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:05,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {2761#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(19, 2); {2761#true} is VALID [2022-02-20 16:56:05,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {2761#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {2761#true} is VALID [2022-02-20 16:56:05,348 INFO L272 TraceCheckUtils]: 2: Hoare triple {2761#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {2761#true} is VALID [2022-02-20 16:56:05,348 INFO L290 TraceCheckUtils]: 3: Hoare triple {2761#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {2761#true} is VALID [2022-02-20 16:56:05,348 INFO L290 TraceCheckUtils]: 4: Hoare triple {2761#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2761#true} is VALID [2022-02-20 16:56:05,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {2761#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2761#true} is VALID [2022-02-20 16:56:05,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {2761#true} assume true; {2761#true} is VALID [2022-02-20 16:56:05,349 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2761#true} {2761#true} #123#return; {2761#true} is VALID [2022-02-20 16:56:05,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {2761#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {2761#true} is VALID [2022-02-20 16:56:05,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {2761#true} assume !!(sll_circular_create_~len#1 > 1); {2761#true} is VALID [2022-02-20 16:56:05,349 INFO L272 TraceCheckUtils]: 10: Hoare triple {2761#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {2761#true} is VALID [2022-02-20 16:56:05,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {2761#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {2761#true} is VALID [2022-02-20 16:56:05,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {2761#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2761#true} is VALID [2022-02-20 16:56:05,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {2761#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2761#true} is VALID [2022-02-20 16:56:05,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {2761#true} assume true; {2761#true} is VALID [2022-02-20 16:56:05,349 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2761#true} {2761#true} #125#return; {2761#true} is VALID [2022-02-20 16:56:05,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {2761#true} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {2761#true} is VALID [2022-02-20 16:56:05,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {2761#true} assume !(sll_circular_create_~len#1 > 1); {2761#true} is VALID [2022-02-20 16:56:05,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {2761#true} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {2761#true} is VALID [2022-02-20 16:56:05,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {2761#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:05,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:05,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(sll_circular_update_at_~index#1 > 0); {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:05,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:05,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume { :end_inline_sll_circular_update_at } true; {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:05,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {2774#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 16:56:05,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {2774#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {2857#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1)} is VALID [2022-02-20 16:56:05,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {2857#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1)} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {2776#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)} is VALID [2022-02-20 16:56:05,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {2776#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {2762#false} is VALID [2022-02-20 16:56:05,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {2762#false} assume !(sll_circular_update_at_~index#1 > 0); {2762#false} is VALID [2022-02-20 16:56:05,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {2762#false} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {2762#false} is VALID [2022-02-20 16:56:05,354 INFO L290 TraceCheckUtils]: 30: Hoare triple {2762#false} assume { :end_inline_sll_circular_update_at } true; {2762#false} is VALID [2022-02-20 16:56:05,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {2762#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {2762#false} is VALID [2022-02-20 16:56:05,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {2762#false} assume !(main_~i~0#1 < main_~len~0#1); {2762#false} is VALID [2022-02-20 16:56:05,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {2762#false} main_~i~0#1 := 0; {2762#false} is VALID [2022-02-20 16:56:05,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {2762#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {2762#false} is VALID [2022-02-20 16:56:05,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {2762#false} assume !(sll_circular_get_data_at_~index#1 > 0); {2762#false} is VALID [2022-02-20 16:56:05,354 INFO L290 TraceCheckUtils]: 36: Hoare triple {2762#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {2762#false} is VALID [2022-02-20 16:56:05,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {2762#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {2762#false} is VALID [2022-02-20 16:56:05,355 INFO L290 TraceCheckUtils]: 38: Hoare triple {2762#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {2762#false} is VALID [2022-02-20 16:56:05,355 INFO L290 TraceCheckUtils]: 39: Hoare triple {2762#false} assume !false; {2762#false} is VALID [2022-02-20 16:56:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:56:05,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:56:05,485 INFO L290 TraceCheckUtils]: 39: Hoare triple {2762#false} assume !false; {2762#false} is VALID [2022-02-20 16:56:05,485 INFO L290 TraceCheckUtils]: 38: Hoare triple {2762#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {2762#false} is VALID [2022-02-20 16:56:05,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {2762#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {2762#false} is VALID [2022-02-20 16:56:05,485 INFO L290 TraceCheckUtils]: 36: Hoare triple {2762#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {2762#false} is VALID [2022-02-20 16:56:05,485 INFO L290 TraceCheckUtils]: 35: Hoare triple {2762#false} assume !(sll_circular_get_data_at_~index#1 > 0); {2762#false} is VALID [2022-02-20 16:56:05,485 INFO L290 TraceCheckUtils]: 34: Hoare triple {2762#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {2762#false} is VALID [2022-02-20 16:56:05,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {2762#false} main_~i~0#1 := 0; {2762#false} is VALID [2022-02-20 16:56:05,486 INFO L290 TraceCheckUtils]: 32: Hoare triple {2762#false} assume !(main_~i~0#1 < main_~len~0#1); {2762#false} is VALID [2022-02-20 16:56:05,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {2762#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {2762#false} is VALID [2022-02-20 16:56:05,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {2762#false} assume { :end_inline_sll_circular_update_at } true; {2762#false} is VALID [2022-02-20 16:56:05,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {2762#false} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {2762#false} is VALID [2022-02-20 16:56:05,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {2762#false} assume !(sll_circular_update_at_~index#1 > 0); {2762#false} is VALID [2022-02-20 16:56:05,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {2776#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {2762#false} is VALID [2022-02-20 16:56:05,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {2857#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1)} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {2776#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)} is VALID [2022-02-20 16:56:05,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {2774#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {2857#(<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1)} is VALID [2022-02-20 16:56:05,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {2774#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 16:56:05,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume { :end_inline_sll_circular_update_at } true; {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:05,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:05,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(sll_circular_update_at_~index#1 > 0); {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:05,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:05,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {2761#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {2838#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:05,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {2761#true} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {2761#true} is VALID [2022-02-20 16:56:05,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {2761#true} assume !(sll_circular_create_~len#1 > 1); {2761#true} is VALID [2022-02-20 16:56:05,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {2761#true} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {2761#true} is VALID [2022-02-20 16:56:05,490 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2761#true} {2761#true} #125#return; {2761#true} is VALID [2022-02-20 16:56:05,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {2761#true} assume true; {2761#true} is VALID [2022-02-20 16:56:05,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {2761#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2761#true} is VALID [2022-02-20 16:56:05,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {2761#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2761#true} is VALID [2022-02-20 16:56:05,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {2761#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {2761#true} is VALID [2022-02-20 16:56:05,491 INFO L272 TraceCheckUtils]: 10: Hoare triple {2761#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {2761#true} is VALID [2022-02-20 16:56:05,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {2761#true} assume !!(sll_circular_create_~len#1 > 1); {2761#true} is VALID [2022-02-20 16:56:05,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {2761#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {2761#true} is VALID [2022-02-20 16:56:05,491 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2761#true} {2761#true} #123#return; {2761#true} is VALID [2022-02-20 16:56:05,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {2761#true} assume true; {2761#true} is VALID [2022-02-20 16:56:05,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {2761#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {2761#true} is VALID [2022-02-20 16:56:05,491 INFO L290 TraceCheckUtils]: 4: Hoare triple {2761#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {2761#true} is VALID [2022-02-20 16:56:05,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {2761#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {2761#true} is VALID [2022-02-20 16:56:05,492 INFO L272 TraceCheckUtils]: 2: Hoare triple {2761#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {2761#true} is VALID [2022-02-20 16:56:05,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {2761#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {2761#true} is VALID [2022-02-20 16:56:05,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {2761#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(19, 2); {2761#true} is VALID [2022-02-20 16:56:05,492 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:56:05,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765828743] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:56:05,492 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:56:05,492 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-02-20 16:56:05,493 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475153599] [2022-02-20 16:56:05,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:56:05,493 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-02-20 16:56:05,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:05,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:05,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:05,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 16:56:05,525 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:56:05,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 16:56:05,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:56:05,526 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:05,807 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2022-02-20 16:56:05,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 16:56:05,807 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-02-20 16:56:05,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:05,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2022-02-20 16:56:05,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:05,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2022-02-20 16:56:05,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 80 transitions. [2022-02-20 16:56:05,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:05,862 INFO L225 Difference]: With dead ends: 102 [2022-02-20 16:56:05,862 INFO L226 Difference]: Without dead ends: 80 [2022-02-20 16:56:05,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-02-20 16:56:05,863 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 63 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:05,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 130 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:05,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-02-20 16:56:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2022-02-20 16:56:06,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:06,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 63 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 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:56:06,004 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 63 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 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:56:06,005 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 63 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 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:56:06,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:06,007 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-02-20 16:56:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-02-20 16:56:06,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:06,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:06,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 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 80 states. [2022-02-20 16:56:06,014 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 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 80 states. [2022-02-20 16:56:06,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:06,018 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-02-20 16:56:06,018 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-02-20 16:56:06,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:06,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:06,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:06,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 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:56:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2022-02-20 16:56:06,022 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 40 [2022-02-20 16:56:06,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:06,022 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2022-02-20 16:56:06,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:06,023 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2022-02-20 16:56:06,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 16:56:06,023 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:06,023 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:06,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-20 16:56:06,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:06,241 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:06,241 INFO L85 PathProgramCache]: Analyzing trace with hash 896238913, now seen corresponding path program 1 times [2022-02-20 16:56:06,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:56:06,242 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973251187] [2022-02-20 16:56:06,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:06,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:56:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:06,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:56:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:06,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {3443#(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(8);~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; {3428#true} is VALID [2022-02-20 16:56:06,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {3428#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3428#true} is VALID [2022-02-20 16:56:06,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {3428#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3428#true} is VALID [2022-02-20 16:56:06,346 INFO L290 TraceCheckUtils]: 3: Hoare triple {3428#true} assume true; {3428#true} is VALID [2022-02-20 16:56:06,346 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3428#true} {3428#true} #123#return; {3428#true} is VALID [2022-02-20 16:56:06,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:56:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:06,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {3443#(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(8);~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; {3428#true} is VALID [2022-02-20 16:56:06,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {3428#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3428#true} is VALID [2022-02-20 16:56:06,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {3428#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3428#true} is VALID [2022-02-20 16:56:06,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {3428#true} assume true; {3428#true} is VALID [2022-02-20 16:56:06,364 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3428#true} {3428#true} #125#return; {3428#true} is VALID [2022-02-20 16:56:06,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {3428#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(19, 2); {3428#true} is VALID [2022-02-20 16:56:06,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {3428#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {3428#true} is VALID [2022-02-20 16:56:06,368 INFO L272 TraceCheckUtils]: 2: Hoare triple {3428#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {3443#(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:56:06,368 INFO L290 TraceCheckUtils]: 3: Hoare triple {3443#(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(8);~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; {3428#true} is VALID [2022-02-20 16:56:06,368 INFO L290 TraceCheckUtils]: 4: Hoare triple {3428#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3428#true} is VALID [2022-02-20 16:56:06,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {3428#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3428#true} is VALID [2022-02-20 16:56:06,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {3428#true} assume true; {3428#true} is VALID [2022-02-20 16:56:06,368 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3428#true} {3428#true} #123#return; {3428#true} is VALID [2022-02-20 16:56:06,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {3428#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {3428#true} is VALID [2022-02-20 16:56:06,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {3428#true} assume !!(sll_circular_create_~len#1 > 1); {3428#true} is VALID [2022-02-20 16:56:06,369 INFO L272 TraceCheckUtils]: 10: Hoare triple {3428#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {3443#(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:56:06,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {3443#(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(8);~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; {3428#true} is VALID [2022-02-20 16:56:06,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {3428#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3428#true} is VALID [2022-02-20 16:56:06,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {3428#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3428#true} is VALID [2022-02-20 16:56:06,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {3428#true} assume true; {3428#true} is VALID [2022-02-20 16:56:06,370 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3428#true} {3428#true} #125#return; {3428#true} is VALID [2022-02-20 16:56:06,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {3428#true} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {3428#true} is VALID [2022-02-20 16:56:06,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {3428#true} assume !(sll_circular_create_~len#1 > 1); {3428#true} is VALID [2022-02-20 16:56:06,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {3428#true} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {3428#true} is VALID [2022-02-20 16:56:06,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {3428#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {3428#true} is VALID [2022-02-20 16:56:06,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {3428#true} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {3428#true} is VALID [2022-02-20 16:56:06,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {3428#true} assume !(sll_circular_update_at_~index#1 > 0); {3428#true} is VALID [2022-02-20 16:56:06,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {3428#true} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {3428#true} is VALID [2022-02-20 16:56:06,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {3428#true} assume { :end_inline_sll_circular_update_at } true; {3428#true} is VALID [2022-02-20 16:56:06,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {3428#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3428#true} is VALID [2022-02-20 16:56:06,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {3428#true} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {3428#true} is VALID [2022-02-20 16:56:06,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {3428#true} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {3428#true} is VALID [2022-02-20 16:56:06,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {3428#true} assume !(sll_circular_update_at_~index#1 > 0); {3428#true} is VALID [2022-02-20 16:56:06,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {3428#true} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {3428#true} is VALID [2022-02-20 16:56:06,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {3428#true} assume { :end_inline_sll_circular_update_at } true; {3428#true} is VALID [2022-02-20 16:56:06,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {3428#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3428#true} is VALID [2022-02-20 16:56:06,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {3428#true} assume !(main_~i~0#1 < main_~len~0#1); {3428#true} is VALID [2022-02-20 16:56:06,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {3428#true} main_~i~0#1 := 0; {3440#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:06,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {3440#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {3440#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:06,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {3440#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(sll_circular_get_data_at_~index#1 > 0); {3440#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:06,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {3440#(= |ULTIMATE.start_main_~i~0#1| 0)} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {3440#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:06,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {3440#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {3440#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:06,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {3440#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~expected~0#1 != main_#t~ret17#1);havoc main_#t~ret17#1; {3440#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:06,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {3440#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {3441#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:06,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {3441#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {3442#(<= 1 |ULTIMATE.start_sll_circular_get_data_at_~index#1|)} is VALID [2022-02-20 16:56:06,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {3442#(<= 1 |ULTIMATE.start_sll_circular_get_data_at_~index#1|)} assume !(sll_circular_get_data_at_~index#1 > 0); {3429#false} is VALID [2022-02-20 16:56:06,374 INFO L290 TraceCheckUtils]: 41: Hoare triple {3429#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {3429#false} is VALID [2022-02-20 16:56:06,374 INFO L290 TraceCheckUtils]: 42: Hoare triple {3429#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {3429#false} is VALID [2022-02-20 16:56:06,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {3429#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {3429#false} is VALID [2022-02-20 16:56:06,374 INFO L290 TraceCheckUtils]: 44: Hoare triple {3429#false} assume !false; {3429#false} is VALID [2022-02-20 16:56:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 16:56:06,375 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:56:06,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973251187] [2022-02-20 16:56:06,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973251187] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:56:06,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574267366] [2022-02-20 16:56:06,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:06,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:06,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:56:06,387 INFO L229 MonitoredProcess]: Starting monitored process 7 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:56:06,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 16:56:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:06,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:56:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:06,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:06,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {3428#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(19, 2); {3428#true} is VALID [2022-02-20 16:56:06,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {3428#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {3428#true} is VALID [2022-02-20 16:56:06,663 INFO L272 TraceCheckUtils]: 2: Hoare triple {3428#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {3428#true} is VALID [2022-02-20 16:56:06,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {3428#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {3428#true} is VALID [2022-02-20 16:56:06,664 INFO L290 TraceCheckUtils]: 4: Hoare triple {3428#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3428#true} is VALID [2022-02-20 16:56:06,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {3428#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3428#true} is VALID [2022-02-20 16:56:06,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {3428#true} assume true; {3428#true} is VALID [2022-02-20 16:56:06,664 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3428#true} {3428#true} #123#return; {3428#true} is VALID [2022-02-20 16:56:06,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {3428#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {3428#true} is VALID [2022-02-20 16:56:06,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {3428#true} assume !!(sll_circular_create_~len#1 > 1); {3428#true} is VALID [2022-02-20 16:56:06,664 INFO L272 TraceCheckUtils]: 10: Hoare triple {3428#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {3428#true} is VALID [2022-02-20 16:56:06,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {3428#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {3428#true} is VALID [2022-02-20 16:56:06,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {3428#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3428#true} is VALID [2022-02-20 16:56:06,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {3428#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3428#true} is VALID [2022-02-20 16:56:06,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {3428#true} assume true; {3428#true} is VALID [2022-02-20 16:56:06,665 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3428#true} {3428#true} #125#return; {3428#true} is VALID [2022-02-20 16:56:06,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {3428#true} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {3428#true} is VALID [2022-02-20 16:56:06,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {3428#true} assume !(sll_circular_create_~len#1 > 1); {3428#true} is VALID [2022-02-20 16:56:06,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {3428#true} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {3428#true} is VALID [2022-02-20 16:56:06,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {3428#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {3428#true} is VALID [2022-02-20 16:56:06,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {3428#true} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {3428#true} is VALID [2022-02-20 16:56:06,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {3428#true} assume !(sll_circular_update_at_~index#1 > 0); {3428#true} is VALID [2022-02-20 16:56:06,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {3428#true} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {3428#true} is VALID [2022-02-20 16:56:06,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {3428#true} assume { :end_inline_sll_circular_update_at } true; {3428#true} is VALID [2022-02-20 16:56:06,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {3428#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3428#true} is VALID [2022-02-20 16:56:06,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {3428#true} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {3428#true} is VALID [2022-02-20 16:56:06,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {3428#true} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {3428#true} is VALID [2022-02-20 16:56:06,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {3428#true} assume !(sll_circular_update_at_~index#1 > 0); {3428#true} is VALID [2022-02-20 16:56:06,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {3428#true} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {3428#true} is VALID [2022-02-20 16:56:06,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {3428#true} assume { :end_inline_sll_circular_update_at } true; {3428#true} is VALID [2022-02-20 16:56:06,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {3428#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3428#true} is VALID [2022-02-20 16:56:06,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {3428#true} assume !(main_~i~0#1 < main_~len~0#1); {3428#true} is VALID [2022-02-20 16:56:06,667 INFO L290 TraceCheckUtils]: 32: Hoare triple {3428#true} main_~i~0#1 := 0; {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:06,667 INFO L290 TraceCheckUtils]: 33: Hoare triple {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:06,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(sll_circular_get_data_at_~index#1 > 0); {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:06,668 INFO L290 TraceCheckUtils]: 35: Hoare triple {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:06,668 INFO L290 TraceCheckUtils]: 36: Hoare triple {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:06,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~expected~0#1 != main_#t~ret17#1);havoc main_#t~ret17#1; {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:06,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {3441#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:06,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {3441#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {3442#(<= 1 |ULTIMATE.start_sll_circular_get_data_at_~index#1|)} is VALID [2022-02-20 16:56:06,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {3442#(<= 1 |ULTIMATE.start_sll_circular_get_data_at_~index#1|)} assume !(sll_circular_get_data_at_~index#1 > 0); {3429#false} is VALID [2022-02-20 16:56:06,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {3429#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {3429#false} is VALID [2022-02-20 16:56:06,670 INFO L290 TraceCheckUtils]: 42: Hoare triple {3429#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {3429#false} is VALID [2022-02-20 16:56:06,670 INFO L290 TraceCheckUtils]: 43: Hoare triple {3429#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {3429#false} is VALID [2022-02-20 16:56:06,670 INFO L290 TraceCheckUtils]: 44: Hoare triple {3429#false} assume !false; {3429#false} is VALID [2022-02-20 16:56:06,671 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 16:56:06,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:56:06,761 INFO L290 TraceCheckUtils]: 44: Hoare triple {3429#false} assume !false; {3429#false} is VALID [2022-02-20 16:56:06,762 INFO L290 TraceCheckUtils]: 43: Hoare triple {3429#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {3429#false} is VALID [2022-02-20 16:56:06,762 INFO L290 TraceCheckUtils]: 42: Hoare triple {3429#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {3429#false} is VALID [2022-02-20 16:56:06,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {3429#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {3429#false} is VALID [2022-02-20 16:56:06,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {3442#(<= 1 |ULTIMATE.start_sll_circular_get_data_at_~index#1|)} assume !(sll_circular_get_data_at_~index#1 > 0); {3429#false} is VALID [2022-02-20 16:56:06,763 INFO L290 TraceCheckUtils]: 39: Hoare triple {3441#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {3442#(<= 1 |ULTIMATE.start_sll_circular_get_data_at_~index#1|)} is VALID [2022-02-20 16:56:06,763 INFO L290 TraceCheckUtils]: 38: Hoare triple {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {3441#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:06,763 INFO L290 TraceCheckUtils]: 37: Hoare triple {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~expected~0#1 != main_#t~ret17#1);havoc main_#t~ret17#1; {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:06,764 INFO L290 TraceCheckUtils]: 36: Hoare triple {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:06,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:06,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(sll_circular_get_data_at_~index#1 > 0); {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:06,764 INFO L290 TraceCheckUtils]: 33: Hoare triple {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:06,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {3428#true} main_~i~0#1 := 0; {3543#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:06,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {3428#true} assume !(main_~i~0#1 < main_~len~0#1); {3428#true} is VALID [2022-02-20 16:56:06,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {3428#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3428#true} is VALID [2022-02-20 16:56:06,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {3428#true} assume { :end_inline_sll_circular_update_at } true; {3428#true} is VALID [2022-02-20 16:56:06,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {3428#true} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {3428#true} is VALID [2022-02-20 16:56:06,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {3428#true} assume !(sll_circular_update_at_~index#1 > 0); {3428#true} is VALID [2022-02-20 16:56:06,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {3428#true} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {3428#true} is VALID [2022-02-20 16:56:06,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {3428#true} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {3428#true} is VALID [2022-02-20 16:56:06,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {3428#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {3428#true} is VALID [2022-02-20 16:56:06,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {3428#true} assume { :end_inline_sll_circular_update_at } true; {3428#true} is VALID [2022-02-20 16:56:06,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {3428#true} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {3428#true} is VALID [2022-02-20 16:56:06,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {3428#true} assume !(sll_circular_update_at_~index#1 > 0); {3428#true} is VALID [2022-02-20 16:56:06,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {3428#true} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {3428#true} is VALID [2022-02-20 16:56:06,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {3428#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {3428#true} is VALID [2022-02-20 16:56:06,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {3428#true} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {3428#true} is VALID [2022-02-20 16:56:06,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {3428#true} assume !(sll_circular_create_~len#1 > 1); {3428#true} is VALID [2022-02-20 16:56:06,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {3428#true} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {3428#true} is VALID [2022-02-20 16:56:06,767 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3428#true} {3428#true} #125#return; {3428#true} is VALID [2022-02-20 16:56:06,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {3428#true} assume true; {3428#true} is VALID [2022-02-20 16:56:06,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {3428#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3428#true} is VALID [2022-02-20 16:56:06,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {3428#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3428#true} is VALID [2022-02-20 16:56:06,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {3428#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {3428#true} is VALID [2022-02-20 16:56:06,767 INFO L272 TraceCheckUtils]: 10: Hoare triple {3428#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {3428#true} is VALID [2022-02-20 16:56:06,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {3428#true} assume !!(sll_circular_create_~len#1 > 1); {3428#true} is VALID [2022-02-20 16:56:06,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {3428#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {3428#true} is VALID [2022-02-20 16:56:06,768 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3428#true} {3428#true} #123#return; {3428#true} is VALID [2022-02-20 16:56:06,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {3428#true} assume true; {3428#true} is VALID [2022-02-20 16:56:06,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {3428#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {3428#true} is VALID [2022-02-20 16:56:06,768 INFO L290 TraceCheckUtils]: 4: Hoare triple {3428#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {3428#true} is VALID [2022-02-20 16:56:06,768 INFO L290 TraceCheckUtils]: 3: Hoare triple {3428#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {3428#true} is VALID [2022-02-20 16:56:06,768 INFO L272 TraceCheckUtils]: 2: Hoare triple {3428#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {3428#true} is VALID [2022-02-20 16:56:06,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {3428#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {3428#true} is VALID [2022-02-20 16:56:06,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {3428#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(19, 2); {3428#true} is VALID [2022-02-20 16:56:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 16:56:06,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574267366] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:56:06,769 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:56:06,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-02-20 16:56:06,769 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161657756] [2022-02-20 16:56:06,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:56:06,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-02-20 16:56:06,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:06,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:06,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:06,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:56:06,794 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:56:06,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:56:06,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:56:06,795 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:07,044 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2022-02-20 16:56:07,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:56:07,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-02-20 16:56:07,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:07,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:07,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-02-20 16:56:07,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-02-20 16:56:07,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-02-20 16:56:07,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:07,084 INFO L225 Difference]: With dead ends: 78 [2022-02-20 16:56:07,084 INFO L226 Difference]: Without dead ends: 70 [2022-02-20 16:56:07,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:56:07,085 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:07,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 124 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:07,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-20 16:56:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-02-20 16:56:07,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:07,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 64 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 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:56:07,179 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 64 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 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:56:07,180 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 64 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 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:56:07,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:07,181 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-02-20 16:56:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-02-20 16:56:07,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:07,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:07,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 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 70 states. [2022-02-20 16:56:07,182 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 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 70 states. [2022-02-20 16:56:07,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:07,183 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-02-20 16:56:07,183 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-02-20 16:56:07,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:07,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:07,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:07,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:07,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 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:56:07,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-02-20 16:56:07,185 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 45 [2022-02-20 16:56:07,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:07,185 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-02-20 16:56:07,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-02-20 16:56:07,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 16:56:07,186 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:07,186 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:07,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 16:56:07,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:07,403 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:07,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:07,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1969553287, now seen corresponding path program 3 times [2022-02-20 16:56:07,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:56:07,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023050237] [2022-02-20 16:56:07,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:07,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:56:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:07,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:56:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:07,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {4084#(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(8);~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; {4067#true} is VALID [2022-02-20 16:56:07,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {4067#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4067#true} is VALID [2022-02-20 16:56:07,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {4067#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4067#true} is VALID [2022-02-20 16:56:07,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {4067#true} assume true; {4067#true} is VALID [2022-02-20 16:56:07,495 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4067#true} {4069#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #123#return; {4069#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:56:07,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:56:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:07,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {4084#(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(8);~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; {4067#true} is VALID [2022-02-20 16:56:07,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {4067#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4067#true} is VALID [2022-02-20 16:56:07,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {4067#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4067#true} is VALID [2022-02-20 16:56:07,505 INFO L290 TraceCheckUtils]: 3: Hoare triple {4067#true} assume true; {4067#true} is VALID [2022-02-20 16:56:07,506 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4067#true} {4069#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #125#return; {4069#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:56:07,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {4067#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(19, 2); {4067#true} is VALID [2022-02-20 16:56:07,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {4067#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {4069#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:56:07,507 INFO L272 TraceCheckUtils]: 2: Hoare triple {4069#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {4084#(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:56:07,507 INFO L290 TraceCheckUtils]: 3: Hoare triple {4084#(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(8);~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; {4067#true} is VALID [2022-02-20 16:56:07,507 INFO L290 TraceCheckUtils]: 4: Hoare triple {4067#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4067#true} is VALID [2022-02-20 16:56:07,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {4067#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4067#true} is VALID [2022-02-20 16:56:07,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {4067#true} assume true; {4067#true} is VALID [2022-02-20 16:56:07,508 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4067#true} {4069#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #123#return; {4069#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:56:07,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {4069#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4069#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:56:07,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {4069#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} assume !!(sll_circular_create_~len#1 > 1); {4069#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:56:07,510 INFO L272 TraceCheckUtils]: 10: Hoare triple {4069#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {4084#(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:56:07,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {4084#(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(8);~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; {4067#true} is VALID [2022-02-20 16:56:07,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {4067#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4067#true} is VALID [2022-02-20 16:56:07,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {4067#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4067#true} is VALID [2022-02-20 16:56:07,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {4067#true} assume true; {4067#true} is VALID [2022-02-20 16:56:07,511 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4067#true} {4069#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} #125#return; {4069#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} is VALID [2022-02-20 16:56:07,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {4069#(and (= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_circular_create_~len#1|) 0))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {4080#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:07,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {4080#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_create_~len#1 > 1); {4080#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:07,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {4080#(<= |ULTIMATE.start_main_~len~0#1| 2)} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4080#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:07,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {4080#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {4081#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:56:07,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {4081#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~len~0#1| 2))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {4081#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:56:07,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {4081#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~len~0#1| 2))} assume !(sll_circular_update_at_~index#1 > 0); {4081#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:56:07,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {4081#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~len~0#1| 2))} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {4081#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:56:07,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {4081#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~len~0#1| 2))} assume { :end_inline_sll_circular_update_at } true; {4081#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:56:07,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {4081#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~len~0#1| 2))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {4082#(<= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 16:56:07,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {4082#(<= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {4082#(<= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 16:56:07,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {4082#(<= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {4082#(<= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 16:56:07,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {4082#(<= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(sll_circular_update_at_~index#1 > 0); {4082#(<= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 16:56:07,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {4082#(<= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {4082#(<= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 16:56:07,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {4082#(<= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume { :end_inline_sll_circular_update_at } true; {4082#(<= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 16:56:07,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {4082#(<= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {4083#(<= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:07,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {4083#(<= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {4068#false} is VALID [2022-02-20 16:56:07,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {4068#false} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {4068#false} is VALID [2022-02-20 16:56:07,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {4068#false} assume !(sll_circular_update_at_~index#1 > 0); {4068#false} is VALID [2022-02-20 16:56:07,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {4068#false} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {4068#false} is VALID [2022-02-20 16:56:07,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {4068#false} assume { :end_inline_sll_circular_update_at } true; {4068#false} is VALID [2022-02-20 16:56:07,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {4068#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {4068#false} is VALID [2022-02-20 16:56:07,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {4068#false} assume !(main_~i~0#1 < main_~len~0#1); {4068#false} is VALID [2022-02-20 16:56:07,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {4068#false} main_~i~0#1 := 0; {4068#false} is VALID [2022-02-20 16:56:07,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {4068#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {4068#false} is VALID [2022-02-20 16:56:07,517 INFO L290 TraceCheckUtils]: 40: Hoare triple {4068#false} assume !(sll_circular_get_data_at_~index#1 > 0); {4068#false} is VALID [2022-02-20 16:56:07,517 INFO L290 TraceCheckUtils]: 41: Hoare triple {4068#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {4068#false} is VALID [2022-02-20 16:56:07,517 INFO L290 TraceCheckUtils]: 42: Hoare triple {4068#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {4068#false} is VALID [2022-02-20 16:56:07,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {4068#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {4068#false} is VALID [2022-02-20 16:56:07,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {4068#false} assume !false; {4068#false} is VALID [2022-02-20 16:56:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:56:07,517 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:56:07,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023050237] [2022-02-20 16:56:07,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023050237] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:56:07,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321065218] [2022-02-20 16:56:07,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 16:56:07,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:07,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:56:07,519 INFO L229 MonitoredProcess]: Starting monitored process 8 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:56:07,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 16:56:07,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 16:56:07,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:56:07,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 16:56:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:07,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:07,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {4067#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(19, 2); {4067#true} is VALID [2022-02-20 16:56:07,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {4067#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {4067#true} is VALID [2022-02-20 16:56:07,986 INFO L272 TraceCheckUtils]: 2: Hoare triple {4067#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {4067#true} is VALID [2022-02-20 16:56:07,986 INFO L290 TraceCheckUtils]: 3: Hoare triple {4067#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {4067#true} is VALID [2022-02-20 16:56:07,986 INFO L290 TraceCheckUtils]: 4: Hoare triple {4067#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4067#true} is VALID [2022-02-20 16:56:07,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {4067#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4067#true} is VALID [2022-02-20 16:56:07,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {4067#true} assume true; {4067#true} is VALID [2022-02-20 16:56:07,986 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4067#true} {4067#true} #123#return; {4067#true} is VALID [2022-02-20 16:56:07,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {4067#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4067#true} is VALID [2022-02-20 16:56:07,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {4067#true} assume !!(sll_circular_create_~len#1 > 1); {4067#true} is VALID [2022-02-20 16:56:07,987 INFO L272 TraceCheckUtils]: 10: Hoare triple {4067#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {4067#true} is VALID [2022-02-20 16:56:07,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {4067#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {4067#true} is VALID [2022-02-20 16:56:07,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {4067#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4067#true} is VALID [2022-02-20 16:56:07,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {4067#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4067#true} is VALID [2022-02-20 16:56:07,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {4067#true} assume true; {4067#true} is VALID [2022-02-20 16:56:07,987 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4067#true} {4067#true} #125#return; {4067#true} is VALID [2022-02-20 16:56:07,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {4067#true} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {4067#true} is VALID [2022-02-20 16:56:07,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {4067#true} assume !(sll_circular_create_~len#1 > 1); {4067#true} is VALID [2022-02-20 16:56:07,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {4067#true} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4067#true} is VALID [2022-02-20 16:56:07,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {4067#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:07,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:07,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(sll_circular_update_at_~index#1 > 0); {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:07,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:07,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_sll_circular_update_at } true; {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:07,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:07,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:07,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:07,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(sll_circular_update_at_~index#1 > 0); {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:07,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:07,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_sll_circular_update_at } true; {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:07,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {4180#(<= 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:07,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {4180#(<= 2 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {4184#(<= 2 |ULTIMATE.start_sll_circular_update_at_~index#1|)} is VALID [2022-02-20 16:56:07,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {4184#(<= 2 |ULTIMATE.start_sll_circular_update_at_~index#1|)} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {4188#(<= 1 |ULTIMATE.start_sll_circular_update_at_~index#1|)} is VALID [2022-02-20 16:56:07,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {4188#(<= 1 |ULTIMATE.start_sll_circular_update_at_~index#1|)} assume !(sll_circular_update_at_~index#1 > 0); {4068#false} is VALID [2022-02-20 16:56:07,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {4068#false} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {4068#false} is VALID [2022-02-20 16:56:07,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {4068#false} assume { :end_inline_sll_circular_update_at } true; {4068#false} is VALID [2022-02-20 16:56:07,994 INFO L290 TraceCheckUtils]: 36: Hoare triple {4068#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {4068#false} is VALID [2022-02-20 16:56:07,994 INFO L290 TraceCheckUtils]: 37: Hoare triple {4068#false} assume !(main_~i~0#1 < main_~len~0#1); {4068#false} is VALID [2022-02-20 16:56:07,994 INFO L290 TraceCheckUtils]: 38: Hoare triple {4068#false} main_~i~0#1 := 0; {4068#false} is VALID [2022-02-20 16:56:07,994 INFO L290 TraceCheckUtils]: 39: Hoare triple {4068#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {4068#false} is VALID [2022-02-20 16:56:07,994 INFO L290 TraceCheckUtils]: 40: Hoare triple {4068#false} assume !(sll_circular_get_data_at_~index#1 > 0); {4068#false} is VALID [2022-02-20 16:56:07,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {4068#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {4068#false} is VALID [2022-02-20 16:56:07,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {4068#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {4068#false} is VALID [2022-02-20 16:56:07,994 INFO L290 TraceCheckUtils]: 43: Hoare triple {4068#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {4068#false} is VALID [2022-02-20 16:56:07,994 INFO L290 TraceCheckUtils]: 44: Hoare triple {4068#false} assume !false; {4068#false} is VALID [2022-02-20 16:56:07,995 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:56:07,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:56:08,158 INFO L290 TraceCheckUtils]: 44: Hoare triple {4068#false} assume !false; {4068#false} is VALID [2022-02-20 16:56:08,158 INFO L290 TraceCheckUtils]: 43: Hoare triple {4068#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {4068#false} is VALID [2022-02-20 16:56:08,159 INFO L290 TraceCheckUtils]: 42: Hoare triple {4068#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {4068#false} is VALID [2022-02-20 16:56:08,159 INFO L290 TraceCheckUtils]: 41: Hoare triple {4068#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {4068#false} is VALID [2022-02-20 16:56:08,159 INFO L290 TraceCheckUtils]: 40: Hoare triple {4068#false} assume !(sll_circular_get_data_at_~index#1 > 0); {4068#false} is VALID [2022-02-20 16:56:08,159 INFO L290 TraceCheckUtils]: 39: Hoare triple {4068#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {4068#false} is VALID [2022-02-20 16:56:08,159 INFO L290 TraceCheckUtils]: 38: Hoare triple {4068#false} main_~i~0#1 := 0; {4068#false} is VALID [2022-02-20 16:56:08,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {4068#false} assume !(main_~i~0#1 < main_~len~0#1); {4068#false} is VALID [2022-02-20 16:56:08,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {4068#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {4068#false} is VALID [2022-02-20 16:56:08,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {4068#false} assume { :end_inline_sll_circular_update_at } true; {4068#false} is VALID [2022-02-20 16:56:08,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {4068#false} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {4068#false} is VALID [2022-02-20 16:56:08,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {4188#(<= 1 |ULTIMATE.start_sll_circular_update_at_~index#1|)} assume !(sll_circular_update_at_~index#1 > 0); {4068#false} is VALID [2022-02-20 16:56:08,160 INFO L290 TraceCheckUtils]: 32: Hoare triple {4184#(<= 2 |ULTIMATE.start_sll_circular_update_at_~index#1|)} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {4188#(<= 1 |ULTIMATE.start_sll_circular_update_at_~index#1|)} is VALID [2022-02-20 16:56:08,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {4180#(<= 2 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {4184#(<= 2 |ULTIMATE.start_sll_circular_update_at_~index#1|)} is VALID [2022-02-20 16:56:08,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {4180#(<= 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:08,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_sll_circular_update_at } true; {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:08,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:08,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(sll_circular_update_at_~index#1 > 0); {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:08,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:08,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:08,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {4161#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:08,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_sll_circular_update_at } true; {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:08,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:08,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(sll_circular_update_at_~index#1 > 0); {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:08,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:08,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {4067#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {4145#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:08,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {4067#true} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4067#true} is VALID [2022-02-20 16:56:08,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {4067#true} assume !(sll_circular_create_~len#1 > 1); {4067#true} is VALID [2022-02-20 16:56:08,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {4067#true} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {4067#true} is VALID [2022-02-20 16:56:08,165 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4067#true} {4067#true} #125#return; {4067#true} is VALID [2022-02-20 16:56:08,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {4067#true} assume true; {4067#true} is VALID [2022-02-20 16:56:08,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {4067#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4067#true} is VALID [2022-02-20 16:56:08,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {4067#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4067#true} is VALID [2022-02-20 16:56:08,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {4067#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {4067#true} is VALID [2022-02-20 16:56:08,166 INFO L272 TraceCheckUtils]: 10: Hoare triple {4067#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {4067#true} is VALID [2022-02-20 16:56:08,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {4067#true} assume !!(sll_circular_create_~len#1 > 1); {4067#true} is VALID [2022-02-20 16:56:08,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {4067#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4067#true} is VALID [2022-02-20 16:56:08,166 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4067#true} {4067#true} #123#return; {4067#true} is VALID [2022-02-20 16:56:08,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {4067#true} assume true; {4067#true} is VALID [2022-02-20 16:56:08,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {4067#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4067#true} is VALID [2022-02-20 16:56:08,167 INFO L290 TraceCheckUtils]: 4: Hoare triple {4067#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4067#true} is VALID [2022-02-20 16:56:08,167 INFO L290 TraceCheckUtils]: 3: Hoare triple {4067#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {4067#true} is VALID [2022-02-20 16:56:08,167 INFO L272 TraceCheckUtils]: 2: Hoare triple {4067#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {4067#true} is VALID [2022-02-20 16:56:08,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {4067#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {4067#true} is VALID [2022-02-20 16:56:08,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {4067#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(19, 2); {4067#true} is VALID [2022-02-20 16:56:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:56:08,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321065218] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:56:08,167 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:56:08,168 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-02-20 16:56:08,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989053613] [2022-02-20 16:56:08,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:56:08,168 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-02-20 16:56:08,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:08,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:56:08,218 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:56:08,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 16:56:08,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:56:08,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 16:56:08,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-20 16:56:08,219 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:56:08,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:08,675 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2022-02-20 16:56:08,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 16:56:08,675 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-02-20 16:56:08,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:08,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:56:08,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-02-20 16:56:08,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:56:08,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-02-20 16:56:08,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 69 transitions. [2022-02-20 16:56:08,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:08,726 INFO L225 Difference]: With dead ends: 87 [2022-02-20 16:56:08,726 INFO L226 Difference]: Without dead ends: 67 [2022-02-20 16:56:08,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-02-20 16:56:08,726 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 49 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:08,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 240 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:56:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-20 16:56:08,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-02-20 16:56:08,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:08,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 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:56:08,847 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 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:56:08,847 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 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:56:08,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:08,849 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-02-20 16:56:08,849 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-02-20 16:56:08,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:08,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:08,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 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 67 states. [2022-02-20 16:56:08,849 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 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 67 states. [2022-02-20 16:56:08,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:08,850 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-02-20 16:56:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-02-20 16:56:08,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:08,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:08,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:08,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 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:56:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-02-20 16:56:08,863 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 45 [2022-02-20 16:56:08,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:08,864 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-02-20 16:56:08,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:56:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-02-20 16:56:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 16:56:08,864 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:08,864 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:08,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 16:56:09,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:09,073 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:09,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:09,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2065256414, now seen corresponding path program 1 times [2022-02-20 16:56:09,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:56:09,074 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919621396] [2022-02-20 16:56:09,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:09,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:56:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:09,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:56:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:09,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {4755#(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(8);~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; {4756#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 16:56:09,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {4756#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4756#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 16:56:09,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {4756#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4757#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:56:09,687 INFO L290 TraceCheckUtils]: 3: Hoare triple {4757#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {4757#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:56:09,688 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4757#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#valid| |node_create_#res#1.base|) 1))} {4724#true} #123#return; {4731#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0))} is VALID [2022-02-20 16:56:09,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:56:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:09,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {4755#(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(8);~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; {4758#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:56:09,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {4758#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4758#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:56:09,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {4758#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.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~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4759#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} is VALID [2022-02-20 16:56:09,751 INFO L290 TraceCheckUtils]: 3: Hoare triple {4759#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} assume true; {4759#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} is VALID [2022-02-20 16:56:09,752 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4759#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} {4732#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #125#return; {4738#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 16:56:09,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {4724#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(19, 2); {4724#true} is VALID [2022-02-20 16:56:09,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {4724#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {4724#true} is VALID [2022-02-20 16:56:09,753 INFO L272 TraceCheckUtils]: 2: Hoare triple {4724#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {4755#(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:56:09,753 INFO L290 TraceCheckUtils]: 3: Hoare triple {4755#(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(8);~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; {4756#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 16:56:09,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {4756#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4756#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} is VALID [2022-02-20 16:56:09,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {4756#(and (= 1 (select |#valid| |node_create_~temp~0#1.base|)) (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4757#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:56:09,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {4757#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#valid| |node_create_#res#1.base|) 1))} assume true; {4757#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#valid| |node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:56:09,756 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4757#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |#valid| |node_create_#res#1.base|) 1))} {4724#true} #123#return; {4731#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0))} is VALID [2022-02-20 16:56:09,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {4731#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_#t~ret4#1.offset| 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4732#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 16:56:09,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {4732#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} assume !!(sll_circular_create_~len#1 > 1); {4732#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} is VALID [2022-02-20 16:56:09,757 INFO L272 TraceCheckUtils]: 10: Hoare triple {4732#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {4755#(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:56:09,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {4755#(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(8);~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; {4758#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:56:09,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {4758#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4758#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:56:09,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {4758#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.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~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4759#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} is VALID [2022-02-20 16:56:09,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {4759#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} assume true; {4759#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} is VALID [2022-02-20 16:56:09,760 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4759#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} {4732#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))} #125#return; {4738#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 16:56:09,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {4738#(and (= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {4739#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))} is VALID [2022-02-20 16:56:09,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {4739#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))} assume !(sll_circular_create_~len#1 > 1); {4739#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))} is VALID [2022-02-20 16:56:09,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {4739#(and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4740#(and (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)))} is VALID [2022-02-20 16:56:09,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {4740#(and (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)))} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {4741#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:09,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {4741#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {4742#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 16:56:09,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {4742#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} assume !(sll_circular_update_at_~index#1 > 0); {4742#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 16:56:09,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {4742#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.offset|)) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {4743#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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))} is VALID [2022-02-20 16:56:09,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {4743#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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))} assume { :end_inline_sll_circular_update_at } true; {4743#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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))} is VALID [2022-02-20 16:56:09,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {4743#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {4744#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 16:56:09,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {4744#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {4745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_sll_circular_update_at_~data#1|) (= (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|)))} is VALID [2022-02-20 16:56:09,767 INFO L290 TraceCheckUtils]: 26: Hoare triple {4745#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_sll_circular_update_at_~data#1|) (= (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1) (= (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|)))} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {4746#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_sll_circular_update_at_~data#1|) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 16:56:09,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {4746#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_sll_circular_update_at_~data#1|) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(sll_circular_update_at_~index#1 > 0); {4746#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_sll_circular_update_at_~data#1|) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 16:56:09,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {4746#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_sll_circular_update_at_~data#1|) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {4747#(and (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 16:56:09,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {4747#(and (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume { :end_inline_sll_circular_update_at } true; {4747#(and (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 16:56:09,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {4747#(and (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {4748#(and (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4) (+ |ULTIMATE.start_main_~len~0#1| 1)))} is VALID [2022-02-20 16:56:09,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {4748#(and (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4) (+ |ULTIMATE.start_main_~len~0#1| 1)))} assume !(main_~i~0#1 < main_~len~0#1); {4748#(and (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4) (+ |ULTIMATE.start_main_~len~0#1| 1)))} is VALID [2022-02-20 16:56:09,773 INFO L290 TraceCheckUtils]: 32: Hoare triple {4748#(and (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4) (+ |ULTIMATE.start_main_~len~0#1| 1)))} main_~i~0#1 := 0; {4749#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4) (+ |ULTIMATE.start_main_~len~0#1| 1)))} is VALID [2022-02-20 16:56:09,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {4749#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4) (+ |ULTIMATE.start_main_~len~0#1| 1)))} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {4749#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4) (+ |ULTIMATE.start_main_~len~0#1| 1)))} is VALID [2022-02-20 16:56:09,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {4749#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4) (+ |ULTIMATE.start_main_~len~0#1| 1)))} assume !(sll_circular_get_data_at_~index#1 > 0); {4749#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4) (+ |ULTIMATE.start_main_~len~0#1| 1)))} is VALID [2022-02-20 16:56:09,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {4749#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4) (+ |ULTIMATE.start_main_~len~0#1| 1)))} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {4749#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4) (+ |ULTIMATE.start_main_~len~0#1| 1)))} is VALID [2022-02-20 16:56:09,775 INFO L290 TraceCheckUtils]: 36: Hoare triple {4749#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4) (+ |ULTIMATE.start_main_~len~0#1| 1)))} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {4749#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4) (+ |ULTIMATE.start_main_~len~0#1| 1)))} is VALID [2022-02-20 16:56:09,776 INFO L290 TraceCheckUtils]: 37: Hoare triple {4749#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4) (+ |ULTIMATE.start_main_~len~0#1| 1)))} assume !(main_~expected~0#1 != main_#t~ret17#1);havoc main_#t~ret17#1; {4749#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4) (+ |ULTIMATE.start_main_~len~0#1| 1)))} is VALID [2022-02-20 16:56:09,776 INFO L290 TraceCheckUtils]: 38: Hoare triple {4749#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4) (+ |ULTIMATE.start_main_~len~0#1| 1)))} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {4750#(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|)) 4) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)))} is VALID [2022-02-20 16:56:09,777 INFO L290 TraceCheckUtils]: 39: Hoare triple {4750#(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|)) 4) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (<= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)))} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {4751#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) 0) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) 4) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) 4)))} is VALID [2022-02-20 16:56:09,777 INFO L290 TraceCheckUtils]: 40: Hoare triple {4751#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) 0) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) 4) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) 4)))} assume !!(sll_circular_get_data_at_~index#1 > 0);call sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;sll_circular_get_data_at_#t~post10#1 := sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#t~post10#1 - 1;havoc sll_circular_get_data_at_#t~post10#1; {4752#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:56:09,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {4752#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} assume !(sll_circular_get_data_at_~index#1 > 0); {4752#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:56:09,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {4752#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {4753#(and (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_sll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:56:09,779 INFO L290 TraceCheckUtils]: 43: Hoare triple {4753#(and (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_sll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|))} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {4754#(and (< |ULTIMATE.start_main_#t~ret17#1| (+ |ULTIMATE.start_main_~expected~0#1| 1)) (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|))} is VALID [2022-02-20 16:56:09,779 INFO L290 TraceCheckUtils]: 44: Hoare triple {4754#(and (< |ULTIMATE.start_main_#t~ret17#1| (+ |ULTIMATE.start_main_~expected~0#1| 1)) (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|))} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {4725#false} is VALID [2022-02-20 16:56:09,779 INFO L290 TraceCheckUtils]: 45: Hoare triple {4725#false} assume !false; {4725#false} is VALID [2022-02-20 16:56:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:56:09,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:56:09,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919621396] [2022-02-20 16:56:09,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919621396] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:56:09,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864358077] [2022-02-20 16:56:09,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:09,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:09,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:56:09,782 INFO L229 MonitoredProcess]: Starting monitored process 9 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:56:09,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 16:56:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:09,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 105 conjunts are in the unsatisfiable core [2022-02-20 16:56:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:09,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:09,934 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:56:10,124 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 16:56:10,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 16:56:10,185 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:56:10,245 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 16:56:10,245 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 19 treesize of output 22 [2022-02-20 16:56:10,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:56:10,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-02-20 16:56:10,812 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 16:56:10,812 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 56 treesize of output 53 [2022-02-20 16:56:10,816 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 27 treesize of output 19 [2022-02-20 16:56:10,821 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 30 treesize of output 32 [2022-02-20 16:56:11,273 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 33 treesize of output 21 [2022-02-20 16:56:11,318 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 21 treesize of output 13 [2022-02-20 16:56:11,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2022-02-20 16:56:11,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {4724#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(19, 2); {4724#true} is VALID [2022-02-20 16:56:11,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {4724#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {4724#true} is VALID [2022-02-20 16:56:11,549 INFO L272 TraceCheckUtils]: 2: Hoare triple {4724#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {4724#true} is VALID [2022-02-20 16:56:11,549 INFO L290 TraceCheckUtils]: 3: Hoare triple {4724#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {4772#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:56:11,550 INFO L290 TraceCheckUtils]: 4: Hoare triple {4772#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4772#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:56:11,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {4772#(= 1 (select |#valid| |node_create_~temp~0#1.base|))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4779#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:56:11,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {4779#(= (select |#valid| |node_create_#res#1.base|) 1)} assume true; {4779#(= (select |#valid| |node_create_#res#1.base|) 1)} is VALID [2022-02-20 16:56:11,551 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4779#(= (select |#valid| |node_create_#res#1.base|) 1)} {4724#true} #123#return; {4786#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} is VALID [2022-02-20 16:56:11,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {4786#(= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4790#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 16:56:11,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {4790#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} assume !!(sll_circular_create_~len#1 > 1); {4790#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} is VALID [2022-02-20 16:56:11,553 INFO L272 TraceCheckUtils]: 10: Hoare triple {4790#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {4797#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 16:56:11,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {4797#(= |old(#valid)| |#valid|)} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {4758#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:56:11,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {4758#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {4758#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.offset|) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:56:11,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {4758#(and (<= |node_create_~temp~0#1.offset| 0) (<= 0 |node_create_~temp~0#1.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~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {4759#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} is VALID [2022-02-20 16:56:11,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {4759#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} assume true; {4759#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} is VALID [2022-02-20 16:56:11,567 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4759#(and (<= 0 |node_create_#res#1.offset|) (<= |node_create_#res#1.offset| 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0))} {4790#(and (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))} #125#return; {4813#(and (<= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 16:56:11,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {4813#(and (<= |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {4817#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 16:56:11,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {4817#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} assume !(sll_circular_create_~len#1 > 1); {4817#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} is VALID [2022-02-20 16:56:11,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {4817#(and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {4824#(and (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|))} is VALID [2022-02-20 16:56:11,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {4824#(and (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|))} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {4828#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {4828#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {4832#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {4832#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(sll_circular_update_at_~index#1 > 0); {4832#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {4832#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {4828#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {4828#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume { :end_inline_sll_circular_update_at } true; {4828#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {4828#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {4845#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {4845#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {4849#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= (+ |ULTIMATE.start_main_~len~0#1| 1) |ULTIMATE.start_sll_circular_update_at_~data#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {4849#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= (+ |ULTIMATE.start_main_~len~0#1| 1) |ULTIMATE.start_sll_circular_update_at_~data#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {4853#(and (<= 0 |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_sll_circular_update_at_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (+ |ULTIMATE.start_main_~len~0#1| 1) |ULTIMATE.start_sll_circular_update_at_~data#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {4853#(and (<= 0 |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_sll_circular_update_at_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (+ |ULTIMATE.start_main_~len~0#1| 1) |ULTIMATE.start_sll_circular_update_at_~data#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(sll_circular_update_at_~index#1 > 0); {4853#(and (<= 0 |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_sll_circular_update_at_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (+ |ULTIMATE.start_main_~len~0#1| 1) |ULTIMATE.start_sll_circular_update_at_~data#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {4853#(and (<= 0 |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_sll_circular_update_at_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (= (+ |ULTIMATE.start_main_~len~0#1| 1) |ULTIMATE.start_sll_circular_update_at_~data#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {4860#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {4860#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume { :end_inline_sll_circular_update_at } true; {4860#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {4860#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {4860#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {4860#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_~i~0#1 < main_~len~0#1); {4860#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {4860#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_~i~0#1 := 0; {4873#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {4873#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {4873#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {4873#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(sll_circular_get_data_at_~index#1 > 0); {4873#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {4873#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {4873#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,580 INFO L290 TraceCheckUtils]: 36: Hoare triple {4873#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {4873#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {4873#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_~expected~0#1 != main_#t~ret17#1);havoc main_#t~ret17#1; {4873#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,581 INFO L290 TraceCheckUtils]: 38: Hoare triple {4873#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {4892#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 16:56:11,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {4892#(and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |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|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {4896#(and (<= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))) |ULTIMATE.start_main_~expected~0#1|) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))} is VALID [2022-02-20 16:56:11,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {4896#(and (<= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))) |ULTIMATE.start_main_~expected~0#1|) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))} assume !!(sll_circular_get_data_at_~index#1 > 0);call sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;sll_circular_get_data_at_#t~post10#1 := sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#t~post10#1 - 1;havoc sll_circular_get_data_at_#t~post10#1; {4752#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:56:11,586 INFO L290 TraceCheckUtils]: 41: Hoare triple {4752#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} assume !(sll_circular_get_data_at_~index#1 > 0); {4752#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:56:11,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {4752#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {4753#(and (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_sll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:56:11,587 INFO L290 TraceCheckUtils]: 43: Hoare triple {4753#(and (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_sll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|))} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {4754#(and (< |ULTIMATE.start_main_#t~ret17#1| (+ |ULTIMATE.start_main_~expected~0#1| 1)) (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|))} is VALID [2022-02-20 16:56:11,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {4754#(and (< |ULTIMATE.start_main_#t~ret17#1| (+ |ULTIMATE.start_main_~expected~0#1| 1)) (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|))} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {4725#false} is VALID [2022-02-20 16:56:11,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {4725#false} assume !false; {4725#false} is VALID [2022-02-20 16:56:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:56:11,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:56:12,015 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 84 treesize of output 64 [2022-02-20 16:56:12,037 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 84 treesize of output 64 [2022-02-20 16:56:12,056 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_sll_circular_update_at_~data#1|) (<= |c_ULTIMATE.start_sll_circular_update_at_~data#1| .cse0) (forall ((v_ArrVal_1087 (Array Int Int))) (= (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1087) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1088 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)))) is different from false [2022-02-20 16:56:12,097 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:56:12,098 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-02-20 16:56:12,102 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 17 treesize of output 15 [2022-02-20 16:56:14,525 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| Int)) (or (and (<= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1085 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| 4) v_ArrVal_1085) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-02-20 16:56:16,601 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1085 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| 4) v_ArrVal_1085) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) is different from false [2022-02-20 16:56:16,691 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1085 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| Int) (v_ArrVal_1083 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1083) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| 4) v_ArrVal_1085) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2022-02-20 16:56:16,815 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:56:16,815 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-02-20 16:56:16,833 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 43 treesize of output 39 [2022-02-20 16:56:16,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:56:16,847 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 27 treesize of output 25 [2022-02-20 16:56:16,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:56:16,862 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 27 treesize of output 23 [2022-02-20 16:56:17,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {4725#false} assume !false; {4725#false} is VALID [2022-02-20 16:56:17,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {4754#(and (< |ULTIMATE.start_main_#t~ret17#1| (+ |ULTIMATE.start_main_~expected~0#1| 1)) (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|))} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {4725#false} is VALID [2022-02-20 16:56:17,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {4753#(and (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_sll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|))} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {4754#(and (< |ULTIMATE.start_main_#t~ret17#1| (+ |ULTIMATE.start_main_~expected~0#1| 1)) (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_main_#t~ret17#1|))} is VALID [2022-02-20 16:56:17,272 INFO L290 TraceCheckUtils]: 42: Hoare triple {4752#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {4753#(and (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_sll_circular_get_data_at_#res#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:56:17,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {4752#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} assume !(sll_circular_get_data_at_~index#1 > 0); {4752#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:56:17,273 INFO L290 TraceCheckUtils]: 40: Hoare triple {4930#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))) |ULTIMATE.start_main_~expected~0#1|))} assume !!(sll_circular_get_data_at_~index#1 > 0);call sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;sll_circular_get_data_at_#t~post10#1 := sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#t~post10#1 - 1;havoc sll_circular_get_data_at_#t~post10#1; {4752#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (<= (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:56:17,273 INFO L290 TraceCheckUtils]: 39: Hoare triple {4934#(and (<= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {4930#(and (<= |ULTIMATE.start_main_~expected~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))) |ULTIMATE.start_main_~expected~0#1|))} is VALID [2022-02-20 16:56:17,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {4938#(and (<= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1)))} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {4934#(and (<= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-20 16:56:17,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {4938#(and (<= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1)))} assume !(main_~expected~0#1 != main_#t~ret17#1);havoc main_#t~ret17#1; {4938#(and (<= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 16:56:17,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {4938#(and (<= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1)))} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {4938#(and (<= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 16:56:17,275 INFO L290 TraceCheckUtils]: 35: Hoare triple {4938#(and (<= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1)))} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {4938#(and (<= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 16:56:17,275 INFO L290 TraceCheckUtils]: 34: Hoare triple {4938#(and (<= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1)))} assume !(sll_circular_get_data_at_~index#1 > 0); {4938#(and (<= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 16:56:17,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {4938#(and (<= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1)))} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {4938#(and (<= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 16:56:17,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {4957#(and (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)))} main_~i~0#1 := 0; {4938#(and (<= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 16:56:17,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {4957#(and (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)))} assume !(main_~i~0#1 < main_~len~0#1); {4957#(and (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)))} is VALID [2022-02-20 16:56:17,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {4957#(and (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {4957#(and (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)))} is VALID [2022-02-20 16:56:17,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {4957#(and (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)))} assume { :end_inline_sll_circular_update_at } true; {4957#(and (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)))} is VALID [2022-02-20 16:56:17,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {4970#(and (<= |ULTIMATE.start_sll_circular_update_at_~data#1| (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) |ULTIMATE.start_sll_circular_update_at_~data#1|) (forall ((v_ArrVal_1088 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1088) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (forall ((v_ArrVal_1087 (Array Int Int))) (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1087) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))))} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {4957#(and (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)))} is VALID [2022-02-20 16:56:17,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {4970#(and (<= |ULTIMATE.start_sll_circular_update_at_~data#1| (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) |ULTIMATE.start_sll_circular_update_at_~data#1|) (forall ((v_ArrVal_1088 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1088) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (forall ((v_ArrVal_1087 (Array Int Int))) (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1087) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))))} assume !(sll_circular_update_at_~index#1 > 0); {4970#(and (<= |ULTIMATE.start_sll_circular_update_at_~data#1| (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) |ULTIMATE.start_sll_circular_update_at_~data#1|) (forall ((v_ArrVal_1088 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1088) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (forall ((v_ArrVal_1087 (Array Int Int))) (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1087) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))))} is VALID [2022-02-20 16:56:17,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {4977#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_sll_circular_update_at_~data#1| (+ |ULTIMATE.start_main_~len~0#1| 1)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) |ULTIMATE.start_sll_circular_update_at_~data#1|))} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {4970#(and (<= |ULTIMATE.start_sll_circular_update_at_~data#1| (+ |ULTIMATE.start_main_~len~0#1| 1)) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) |ULTIMATE.start_sll_circular_update_at_~data#1|) (forall ((v_ArrVal_1088 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1088) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (forall ((v_ArrVal_1087 (Array Int Int))) (= (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1087) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 4))))} is VALID [2022-02-20 16:56:17,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {4981#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {4977#(and (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_sll_circular_update_at_~data#1| (+ |ULTIMATE.start_main_~len~0#1| 1)) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) |ULTIMATE.start_sll_circular_update_at_~data#1|))} is VALID [2022-02-20 16:56:17,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {4985#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~i~0#1|))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {4981#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 16:56:17,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {4985#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume { :end_inline_sll_circular_update_at } true; {4985#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 16:56:17,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {4992#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1085 Int)) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1085)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))))} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {4985#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 16:56:17,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {4992#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1085 Int)) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1085)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))))} assume !(sll_circular_update_at_~index#1 > 0); {4992#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1085 Int)) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1085)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))))} is VALID [2022-02-20 16:56:17,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {4999#(forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| Int)) (or (and (<= |ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1085 Int)) (not (= |ULTIMATE.start_main_~s~0#1.base| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| 4) v_ArrVal_1085) |ULTIMATE.start_main_~s~0#1.offset|)))) (<= 0 |ULTIMATE.start_main_~i~0#1|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| |ULTIMATE.start_main_~s~0#1.offset|)))} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {4992#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1085 Int)) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1085)) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_main_~s~0#1.base|))))} is VALID [2022-02-20 16:56:17,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {5003#(forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| |ULTIMATE.start_sll_circular_create_#res#1.offset|) (forall ((v_ArrVal_1085 Int)) (not (= (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| 4) v_ArrVal_1085) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)))))} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {4999#(forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| Int)) (or (and (<= |ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1085 Int)) (not (= |ULTIMATE.start_main_~s~0#1.base| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| 4) v_ArrVal_1085) |ULTIMATE.start_main_~s~0#1.offset|)))) (<= 0 |ULTIMATE.start_main_~i~0#1|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| |ULTIMATE.start_main_~s~0#1.offset|)))} is VALID [2022-02-20 16:56:17,308 WARN L290 TraceCheckUtils]: 18: Hoare triple {5007#(forall ((v_ArrVal_1085 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| Int) (v_ArrVal_1083 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1083) |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| 4) v_ArrVal_1085) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5003#(forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| |ULTIMATE.start_sll_circular_create_#res#1.offset|) (forall ((v_ArrVal_1085 Int)) (not (= (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| 4) v_ArrVal_1085) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)))))} is UNKNOWN [2022-02-20 16:56:17,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {5007#(forall ((v_ArrVal_1085 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| Int) (v_ArrVal_1083 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1083) |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| 4) v_ArrVal_1085) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))} assume !(sll_circular_create_~len#1 > 1); {5007#(forall ((v_ArrVal_1085 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| Int) (v_ArrVal_1083 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1083) |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| 4) v_ArrVal_1085) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))} is VALID [2022-02-20 16:56:17,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {5014#(and (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {5007#(forall ((v_ArrVal_1085 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| Int) (v_ArrVal_1083 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1083) |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| 4) v_ArrVal_1085) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))} is VALID [2022-02-20 16:56:17,310 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5022#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} {5018#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)))} #125#return; {5014#(and (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)))} is VALID [2022-02-20 16:56:17,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {5022#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} assume true; {5022#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} is VALID [2022-02-20 16:56:17,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {5029#(= 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~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5022#(= (select |old(#valid)| |node_create_#res#1.base|) 0)} is VALID [2022-02-20 16:56:17,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {5029#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5029#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:56:17,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {5036#(forall ((|v_node_create_~temp~0#1.base_46| Int)) (or (not (= (select |#valid| |v_node_create_~temp~0#1.base_46|) 0)) (= (select |old(#valid)| |v_node_create_~temp~0#1.base_46|) 0)))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {5029#(= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))} is VALID [2022-02-20 16:56:17,313 INFO L272 TraceCheckUtils]: 10: Hoare triple {5018#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)))} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {5036#(forall ((|v_node_create_~temp~0#1.base_46| Int)) (or (not (= (select |#valid| |v_node_create_~temp~0#1.base_46|) 0)) (= (select |old(#valid)| |v_node_create_~temp~0#1.base_46|) 0)))} is VALID [2022-02-20 16:56:17,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {5018#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)))} assume !!(sll_circular_create_~len#1 > 1); {5018#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)))} is VALID [2022-02-20 16:56:17,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {5043#(not (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0))} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5018#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0)) (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)))} is VALID [2022-02-20 16:56:17,314 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5050#(not (= (select |#valid| |node_create_#res#1.base|) 0))} {4724#true} #123#return; {5043#(not (= (select |#valid| |ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0))} is VALID [2022-02-20 16:56:17,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {5050#(not (= (select |#valid| |node_create_#res#1.base|) 0))} assume true; {5050#(not (= (select |#valid| |node_create_#res#1.base|) 0))} is VALID [2022-02-20 16:56:17,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {5057#(not (= 0 (select |#valid| |node_create_~temp~0#1.base|)))} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5050#(not (= (select |#valid| |node_create_#res#1.base|) 0))} is VALID [2022-02-20 16:56:17,315 INFO L290 TraceCheckUtils]: 4: Hoare triple {5057#(not (= 0 (select |#valid| |node_create_~temp~0#1.base|)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5057#(not (= 0 (select |#valid| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:56:17,316 INFO L290 TraceCheckUtils]: 3: Hoare triple {4724#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {5057#(not (= 0 (select |#valid| |node_create_~temp~0#1.base|)))} is VALID [2022-02-20 16:56:17,316 INFO L272 TraceCheckUtils]: 2: Hoare triple {4724#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {4724#true} is VALID [2022-02-20 16:56:17,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {4724#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {4724#true} is VALID [2022-02-20 16:56:17,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {4724#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(19, 2); {4724#true} is VALID [2022-02-20 16:56:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-02-20 16:56:17,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864358077] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:56:17,317 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:56:17,317 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 25] total 63 [2022-02-20 16:56:17,318 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868758563] [2022-02-20 16:56:17,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:56:17,320 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.7301587301587302) internal successors, (109), 54 states have internal predecessors, (109), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-02-20 16:56:17,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:17,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 63 states, 63 states have (on average 1.7301587301587302) internal successors, (109), 54 states have internal predecessors, (109), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 16:56:17,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 118 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:17,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-02-20 16:56:17,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:56:17,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-02-20 16:56:17,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=3249, Unknown=4, NotChecked=468, Total=3906 [2022-02-20 16:56:17,448 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 63 states, 63 states have (on average 1.7301587301587302) internal successors, (109), 54 states have internal predecessors, (109), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 16:56:18,391 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (<= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_1085 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| Int) (v_ArrVal_1083 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1083) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| 4) v_ArrVal_1085) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))) is different from false [2022-02-20 16:56:18,692 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| Int)) (or (forall ((v_ArrVal_1085 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| 4) v_ArrVal_1085) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) is different from false [2022-02-20 16:56:18,991 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| Int)) (or (and (<= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1085 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| 4) v_ArrVal_1085) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-02-20 16:56:20,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:20,925 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2022-02-20 16:56:20,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-20 16:56:20,925 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.7301587301587302) internal successors, (109), 54 states have internal predecessors, (109), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-02-20 16:56:20,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:20,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.7301587301587302) internal successors, (109), 54 states have internal predecessors, (109), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 16:56:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2022-02-20 16:56:20,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.7301587301587302) internal successors, (109), 54 states have internal predecessors, (109), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 16:56:20,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2022-02-20 16:56:20,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 74 transitions. [2022-02-20 16:56:20,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:20,994 INFO L225 Difference]: With dead ends: 80 [2022-02-20 16:56:20,994 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 16:56:20,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=346, Invalid=4787, Unknown=7, NotChecked=1022, Total=6162 [2022-02-20 16:56:20,995 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 127 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:20,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 633 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 715 Invalid, 0 Unknown, 211 Unchecked, 0.6s Time] [2022-02-20 16:56:20,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 16:56:21,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2022-02-20 16:56:21,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:21,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 68 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 63 states have internal predecessors, (67), 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:56:21,142 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 68 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 63 states have internal predecessors, (67), 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:56:21,142 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 68 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 63 states have internal predecessors, (67), 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:56:21,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:21,143 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-02-20 16:56:21,143 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-02-20 16:56:21,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:21,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:21,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 63 states have internal predecessors, (67), 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 75 states. [2022-02-20 16:56:21,144 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 63 states have internal predecessors, (67), 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 75 states. [2022-02-20 16:56:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:21,144 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-02-20 16:56:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-02-20 16:56:21,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:21,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:21,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:21,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 63 states have internal predecessors, (67), 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:56:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2022-02-20 16:56:21,147 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 46 [2022-02-20 16:56:21,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:21,147 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2022-02-20 16:56:21,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.7301587301587302) internal successors, (109), 54 states have internal predecessors, (109), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 16:56:21,147 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-02-20 16:56:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 16:56:21,148 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:21,148 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:21,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 16:56:21,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-20 16:56:21,367 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:21,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:21,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2101316258, now seen corresponding path program 4 times [2022-02-20 16:56:21,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:56:21,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026308799] [2022-02-20 16:56:21,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:21,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:56:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:21,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:56:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:21,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {5494#(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(8);~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; {5475#true} is VALID [2022-02-20 16:56:21,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {5475#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5475#true} is VALID [2022-02-20 16:56:21,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {5475#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5475#true} is VALID [2022-02-20 16:56:21,430 INFO L290 TraceCheckUtils]: 3: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-02-20 16:56:21,431 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5475#true} {5477#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} #123#return; {5477#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:56:21,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:56:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:21,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {5494#(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(8);~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; {5475#true} is VALID [2022-02-20 16:56:21,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {5475#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5475#true} is VALID [2022-02-20 16:56:21,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {5475#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5475#true} is VALID [2022-02-20 16:56:21,437 INFO L290 TraceCheckUtils]: 3: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-02-20 16:56:21,438 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5475#true} {5477#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} #125#return; {5477#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:56:21,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 16:56:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:21,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {5494#(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(8);~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; {5475#true} is VALID [2022-02-20 16:56:21,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {5475#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5475#true} is VALID [2022-02-20 16:56:21,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {5475#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5475#true} is VALID [2022-02-20 16:56:21,453 INFO L290 TraceCheckUtils]: 3: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-02-20 16:56:21,453 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5475#true} {5476#false} #125#return; {5476#false} is VALID [2022-02-20 16:56:21,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {5475#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(19, 2); {5475#true} is VALID [2022-02-20 16:56:21,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {5475#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {5477#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:56:21,454 INFO L272 TraceCheckUtils]: 2: Hoare triple {5477#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {5494#(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:56:21,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {5494#(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(8);~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; {5475#true} is VALID [2022-02-20 16:56:21,454 INFO L290 TraceCheckUtils]: 4: Hoare triple {5475#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5475#true} is VALID [2022-02-20 16:56:21,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {5475#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5475#true} is VALID [2022-02-20 16:56:21,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-02-20 16:56:21,455 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5475#true} {5477#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} #123#return; {5477#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:56:21,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {5477#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5477#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:56:21,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {5477#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} assume !!(sll_circular_create_~len#1 > 1); {5477#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:56:21,456 INFO L272 TraceCheckUtils]: 10: Hoare triple {5477#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {5494#(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:56:21,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {5494#(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(8);~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; {5475#true} is VALID [2022-02-20 16:56:21,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {5475#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5475#true} is VALID [2022-02-20 16:56:21,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {5475#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5475#true} is VALID [2022-02-20 16:56:21,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-02-20 16:56:21,457 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5475#true} {5477#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} #125#return; {5477#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} is VALID [2022-02-20 16:56:21,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {5477#(= (+ (- 2) |ULTIMATE.start_sll_circular_create_~len#1|) 0)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {5488#(<= |ULTIMATE.start_sll_circular_create_~len#1| 1)} is VALID [2022-02-20 16:56:21,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {5488#(<= |ULTIMATE.start_sll_circular_create_~len#1| 1)} assume !!(sll_circular_create_~len#1 > 1); {5476#false} is VALID [2022-02-20 16:56:21,458 INFO L272 TraceCheckUtils]: 18: Hoare triple {5476#false} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {5494#(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:56:21,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {5494#(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(8);~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; {5475#true} is VALID [2022-02-20 16:56:21,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {5475#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5475#true} is VALID [2022-02-20 16:56:21,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {5475#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5475#true} is VALID [2022-02-20 16:56:21,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-02-20 16:56:21,459 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5475#true} {5476#false} #125#return; {5476#false} is VALID [2022-02-20 16:56:21,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {5476#false} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {5476#false} is VALID [2022-02-20 16:56:21,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {5476#false} assume !(sll_circular_create_~len#1 > 1); {5476#false} is VALID [2022-02-20 16:56:21,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {5476#false} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5476#false} is VALID [2022-02-20 16:56:21,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {5476#false} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {5476#false} is VALID [2022-02-20 16:56:21,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {5476#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {5476#false} is VALID [2022-02-20 16:56:21,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {5476#false} assume !(sll_circular_update_at_~index#1 > 0); {5476#false} is VALID [2022-02-20 16:56:21,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {5476#false} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {5476#false} is VALID [2022-02-20 16:56:21,459 INFO L290 TraceCheckUtils]: 31: Hoare triple {5476#false} assume { :end_inline_sll_circular_update_at } true; {5476#false} is VALID [2022-02-20 16:56:21,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {5476#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5476#false} is VALID [2022-02-20 16:56:21,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {5476#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {5476#false} is VALID [2022-02-20 16:56:21,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {5476#false} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {5476#false} is VALID [2022-02-20 16:56:21,460 INFO L290 TraceCheckUtils]: 35: Hoare triple {5476#false} assume !(sll_circular_update_at_~index#1 > 0); {5476#false} is VALID [2022-02-20 16:56:21,460 INFO L290 TraceCheckUtils]: 36: Hoare triple {5476#false} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {5476#false} is VALID [2022-02-20 16:56:21,460 INFO L290 TraceCheckUtils]: 37: Hoare triple {5476#false} assume { :end_inline_sll_circular_update_at } true; {5476#false} is VALID [2022-02-20 16:56:21,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {5476#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5476#false} is VALID [2022-02-20 16:56:21,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {5476#false} assume !(main_~i~0#1 < main_~len~0#1); {5476#false} is VALID [2022-02-20 16:56:21,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {5476#false} main_~i~0#1 := 0; {5476#false} is VALID [2022-02-20 16:56:21,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {5476#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {5476#false} is VALID [2022-02-20 16:56:21,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {5476#false} assume !(sll_circular_get_data_at_~index#1 > 0); {5476#false} is VALID [2022-02-20 16:56:21,461 INFO L290 TraceCheckUtils]: 43: Hoare triple {5476#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {5476#false} is VALID [2022-02-20 16:56:21,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {5476#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {5476#false} is VALID [2022-02-20 16:56:21,461 INFO L290 TraceCheckUtils]: 45: Hoare triple {5476#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {5476#false} is VALID [2022-02-20 16:56:21,461 INFO L290 TraceCheckUtils]: 46: Hoare triple {5476#false} assume !false; {5476#false} is VALID [2022-02-20 16:56:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 16:56:21,461 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:56:21,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026308799] [2022-02-20 16:56:21,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026308799] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:56:21,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524413358] [2022-02-20 16:56:21,462 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 16:56:21,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:21,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:56:21,488 INFO L229 MonitoredProcess]: Starting monitored process 10 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:56:21,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 16:56:21,625 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 16:56:21,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:56:21,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:56:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:21,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:21,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {5475#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(19, 2); {5475#true} is VALID [2022-02-20 16:56:21,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {5475#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {5501#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} is VALID [2022-02-20 16:56:21,758 INFO L272 TraceCheckUtils]: 2: Hoare triple {5501#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {5475#true} is VALID [2022-02-20 16:56:21,758 INFO L290 TraceCheckUtils]: 3: Hoare triple {5475#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {5475#true} is VALID [2022-02-20 16:56:21,758 INFO L290 TraceCheckUtils]: 4: Hoare triple {5475#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5475#true} is VALID [2022-02-20 16:56:21,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {5475#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5475#true} is VALID [2022-02-20 16:56:21,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-02-20 16:56:21,759 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5475#true} {5501#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} #123#return; {5501#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} is VALID [2022-02-20 16:56:21,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {5501#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5501#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} is VALID [2022-02-20 16:56:21,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {5501#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} assume !!(sll_circular_create_~len#1 > 1); {5501#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} is VALID [2022-02-20 16:56:21,760 INFO L272 TraceCheckUtils]: 10: Hoare triple {5501#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {5475#true} is VALID [2022-02-20 16:56:21,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {5475#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {5475#true} is VALID [2022-02-20 16:56:21,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {5475#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5475#true} is VALID [2022-02-20 16:56:21,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {5475#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5475#true} is VALID [2022-02-20 16:56:21,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {5475#true} assume true; {5475#true} is VALID [2022-02-20 16:56:21,761 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5475#true} {5501#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} #125#return; {5501#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} is VALID [2022-02-20 16:56:21,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {5501#(<= |ULTIMATE.start_sll_circular_create_~len#1| 2)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {5488#(<= |ULTIMATE.start_sll_circular_create_~len#1| 1)} is VALID [2022-02-20 16:56:21,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {5488#(<= |ULTIMATE.start_sll_circular_create_~len#1| 1)} assume !!(sll_circular_create_~len#1 > 1); {5476#false} is VALID [2022-02-20 16:56:21,762 INFO L272 TraceCheckUtils]: 18: Hoare triple {5476#false} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {5476#false} is VALID [2022-02-20 16:56:21,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {5476#false} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {5476#false} is VALID [2022-02-20 16:56:21,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {5476#false} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5476#false} is VALID [2022-02-20 16:56:21,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {5476#false} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5476#false} is VALID [2022-02-20 16:56:21,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {5476#false} assume true; {5476#false} is VALID [2022-02-20 16:56:21,762 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5476#false} {5476#false} #125#return; {5476#false} is VALID [2022-02-20 16:56:21,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {5476#false} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {5476#false} is VALID [2022-02-20 16:56:21,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {5476#false} assume !(sll_circular_create_~len#1 > 1); {5476#false} is VALID [2022-02-20 16:56:21,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {5476#false} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5476#false} is VALID [2022-02-20 16:56:21,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {5476#false} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {5476#false} is VALID [2022-02-20 16:56:21,763 INFO L290 TraceCheckUtils]: 28: Hoare triple {5476#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {5476#false} is VALID [2022-02-20 16:56:21,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {5476#false} assume !(sll_circular_update_at_~index#1 > 0); {5476#false} is VALID [2022-02-20 16:56:21,763 INFO L290 TraceCheckUtils]: 30: Hoare triple {5476#false} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {5476#false} is VALID [2022-02-20 16:56:21,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {5476#false} assume { :end_inline_sll_circular_update_at } true; {5476#false} is VALID [2022-02-20 16:56:21,763 INFO L290 TraceCheckUtils]: 32: Hoare triple {5476#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5476#false} is VALID [2022-02-20 16:56:21,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {5476#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {5476#false} is VALID [2022-02-20 16:56:21,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {5476#false} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {5476#false} is VALID [2022-02-20 16:56:21,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {5476#false} assume !(sll_circular_update_at_~index#1 > 0); {5476#false} is VALID [2022-02-20 16:56:21,764 INFO L290 TraceCheckUtils]: 36: Hoare triple {5476#false} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {5476#false} is VALID [2022-02-20 16:56:21,764 INFO L290 TraceCheckUtils]: 37: Hoare triple {5476#false} assume { :end_inline_sll_circular_update_at } true; {5476#false} is VALID [2022-02-20 16:56:21,764 INFO L290 TraceCheckUtils]: 38: Hoare triple {5476#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5476#false} is VALID [2022-02-20 16:56:21,764 INFO L290 TraceCheckUtils]: 39: Hoare triple {5476#false} assume !(main_~i~0#1 < main_~len~0#1); {5476#false} is VALID [2022-02-20 16:56:21,764 INFO L290 TraceCheckUtils]: 40: Hoare triple {5476#false} main_~i~0#1 := 0; {5476#false} is VALID [2022-02-20 16:56:21,764 INFO L290 TraceCheckUtils]: 41: Hoare triple {5476#false} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {5476#false} is VALID [2022-02-20 16:56:21,764 INFO L290 TraceCheckUtils]: 42: Hoare triple {5476#false} assume !(sll_circular_get_data_at_~index#1 > 0); {5476#false} is VALID [2022-02-20 16:56:21,765 INFO L290 TraceCheckUtils]: 43: Hoare triple {5476#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {5476#false} is VALID [2022-02-20 16:56:21,765 INFO L290 TraceCheckUtils]: 44: Hoare triple {5476#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {5476#false} is VALID [2022-02-20 16:56:21,765 INFO L290 TraceCheckUtils]: 45: Hoare triple {5476#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {5476#false} is VALID [2022-02-20 16:56:21,765 INFO L290 TraceCheckUtils]: 46: Hoare triple {5476#false} assume !false; {5476#false} is VALID [2022-02-20 16:56:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 16:56:21,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:56:21,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524413358] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:56:21,765 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 16:56:21,765 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-02-20 16:56:21,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583054592] [2022-02-20 16:56:21,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:56:21,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2022-02-20 16:56:21,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:21,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:56:21,795 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:56:21,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:56:21,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:56:21,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:56:21,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:56:21,796 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:56:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:21,919 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-02-20 16:56:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:56:21,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2022-02-20 16:56:21,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:21,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:56:21,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-02-20 16:56:21,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:56:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-02-20 16:56:21,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2022-02-20 16:56:21,975 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:56:21,976 INFO L225 Difference]: With dead ends: 80 [2022-02-20 16:56:21,976 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 16:56:21,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 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:56:21,977 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 40 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:21,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 38 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:21,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 16:56:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-20 16:56:22,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:22,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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:56:22,088 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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:56:22,088 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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:56:22,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:22,089 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-02-20 16:56:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-02-20 16:56:22,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:22,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:22,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 43 states. [2022-02-20 16:56:22,090 INFO L87 Difference]: Start difference. First operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 43 states. [2022-02-20 16:56:22,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:22,091 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-02-20 16:56:22,091 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-02-20 16:56:22,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:22,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:22,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:22,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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:56:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-02-20 16:56:22,098 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 47 [2022-02-20 16:56:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:22,099 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-02-20 16:56:22,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:56:22,099 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-02-20 16:56:22,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 16:56:22,100 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:22,100 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:22,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-20 16:56:22,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:22,308 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:22,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:22,308 INFO L85 PathProgramCache]: Analyzing trace with hash -349906719, now seen corresponding path program 2 times [2022-02-20 16:56:22,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:56:22,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633966256] [2022-02-20 16:56:22,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:22,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:56:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:22,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:56:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:22,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {5921#(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(8);~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; {5905#true} is VALID [2022-02-20 16:56:22,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {5905#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5905#true} is VALID [2022-02-20 16:56:22,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {5905#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5905#true} is VALID [2022-02-20 16:56:22,392 INFO L290 TraceCheckUtils]: 3: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-02-20 16:56:22,392 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5905#true} {5905#true} #123#return; {5905#true} is VALID [2022-02-20 16:56:22,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 16:56:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:22,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {5921#(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(8);~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; {5905#true} is VALID [2022-02-20 16:56:22,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {5905#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5905#true} is VALID [2022-02-20 16:56:22,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {5905#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5905#true} is VALID [2022-02-20 16:56:22,397 INFO L290 TraceCheckUtils]: 3: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-02-20 16:56:22,397 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5905#true} {5905#true} #125#return; {5905#true} is VALID [2022-02-20 16:56:22,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {5905#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(19, 2); {5905#true} is VALID [2022-02-20 16:56:22,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {5905#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {5905#true} is VALID [2022-02-20 16:56:22,398 INFO L272 TraceCheckUtils]: 2: Hoare triple {5905#true} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {5921#(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:56:22,398 INFO L290 TraceCheckUtils]: 3: Hoare triple {5921#(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(8);~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; {5905#true} is VALID [2022-02-20 16:56:22,398 INFO L290 TraceCheckUtils]: 4: Hoare triple {5905#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5905#true} is VALID [2022-02-20 16:56:22,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {5905#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5905#true} is VALID [2022-02-20 16:56:22,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-02-20 16:56:22,398 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5905#true} {5905#true} #123#return; {5905#true} is VALID [2022-02-20 16:56:22,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {5905#true} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5905#true} is VALID [2022-02-20 16:56:22,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {5905#true} assume !!(sll_circular_create_~len#1 > 1); {5905#true} is VALID [2022-02-20 16:56:22,399 INFO L272 TraceCheckUtils]: 10: Hoare triple {5905#true} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {5921#(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:56:22,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {5921#(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(8);~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; {5905#true} is VALID [2022-02-20 16:56:22,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {5905#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5905#true} is VALID [2022-02-20 16:56:22,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {5905#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5905#true} is VALID [2022-02-20 16:56:22,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-02-20 16:56:22,399 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5905#true} {5905#true} #125#return; {5905#true} is VALID [2022-02-20 16:56:22,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {5905#true} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {5905#true} is VALID [2022-02-20 16:56:22,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {5905#true} assume !(sll_circular_create_~len#1 > 1); {5905#true} is VALID [2022-02-20 16:56:22,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {5905#true} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5905#true} is VALID [2022-02-20 16:56:22,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {5905#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {5905#true} is VALID [2022-02-20 16:56:22,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {5905#true} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {5905#true} is VALID [2022-02-20 16:56:22,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {5905#true} assume !(sll_circular_update_at_~index#1 > 0); {5905#true} is VALID [2022-02-20 16:56:22,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {5905#true} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {5905#true} is VALID [2022-02-20 16:56:22,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {5905#true} assume { :end_inline_sll_circular_update_at } true; {5905#true} is VALID [2022-02-20 16:56:22,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {5905#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5905#true} is VALID [2022-02-20 16:56:22,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {5905#true} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {5905#true} is VALID [2022-02-20 16:56:22,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {5905#true} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {5905#true} is VALID [2022-02-20 16:56:22,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {5905#true} assume !(sll_circular_update_at_~index#1 > 0); {5905#true} is VALID [2022-02-20 16:56:22,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {5905#true} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {5905#true} is VALID [2022-02-20 16:56:22,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {5905#true} assume { :end_inline_sll_circular_update_at } true; {5905#true} is VALID [2022-02-20 16:56:22,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {5905#true} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5905#true} is VALID [2022-02-20 16:56:22,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {5905#true} assume !(main_~i~0#1 < main_~len~0#1); {5905#true} is VALID [2022-02-20 16:56:22,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {5905#true} main_~i~0#1 := 0; {5917#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:22,401 INFO L290 TraceCheckUtils]: 33: Hoare triple {5917#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {5917#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:22,401 INFO L290 TraceCheckUtils]: 34: Hoare triple {5917#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(sll_circular_get_data_at_~index#1 > 0); {5917#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:22,401 INFO L290 TraceCheckUtils]: 35: Hoare triple {5917#(= |ULTIMATE.start_main_~i~0#1| 0)} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {5917#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:22,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {5917#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {5917#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:22,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {5917#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~expected~0#1 != main_#t~ret17#1);havoc main_#t~ret17#1; {5917#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 16:56:22,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {5917#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {5918#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 16:56:22,403 INFO L290 TraceCheckUtils]: 39: Hoare triple {5918#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {5919#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1)} is VALID [2022-02-20 16:56:22,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {5919#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1)} assume !!(sll_circular_get_data_at_~index#1 > 0);call sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;sll_circular_get_data_at_#t~post10#1 := sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#t~post10#1 - 1;havoc sll_circular_get_data_at_#t~post10#1; {5920#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)} is VALID [2022-02-20 16:56:22,404 INFO L290 TraceCheckUtils]: 41: Hoare triple {5920#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)} assume !!(sll_circular_get_data_at_~index#1 > 0);call sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;sll_circular_get_data_at_#t~post10#1 := sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#t~post10#1 - 1;havoc sll_circular_get_data_at_#t~post10#1; {5906#false} is VALID [2022-02-20 16:56:22,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {5906#false} assume !(sll_circular_get_data_at_~index#1 > 0); {5906#false} is VALID [2022-02-20 16:56:22,404 INFO L290 TraceCheckUtils]: 43: Hoare triple {5906#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {5906#false} is VALID [2022-02-20 16:56:22,404 INFO L290 TraceCheckUtils]: 44: Hoare triple {5906#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {5906#false} is VALID [2022-02-20 16:56:22,404 INFO L290 TraceCheckUtils]: 45: Hoare triple {5906#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {5906#false} is VALID [2022-02-20 16:56:22,404 INFO L290 TraceCheckUtils]: 46: Hoare triple {5906#false} assume !false; {5906#false} is VALID [2022-02-20 16:56:22,404 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 16:56:22,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:56:22,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633966256] [2022-02-20 16:56:22,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633966256] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:56:22,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923832216] [2022-02-20 16:56:22,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:56:22,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:22,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:56:22,428 INFO L229 MonitoredProcess]: Starting monitored process 11 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:56:22,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-20 16:56:22,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:56:22,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:56:22,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 16:56:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:22,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:22,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {5905#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(19, 2); {5905#true} is VALID [2022-02-20 16:56:22,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {5905#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,758 INFO L272 TraceCheckUtils]: 2: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {5905#true} is VALID [2022-02-20 16:56:22,758 INFO L290 TraceCheckUtils]: 3: Hoare triple {5905#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {5905#true} is VALID [2022-02-20 16:56:22,758 INFO L290 TraceCheckUtils]: 4: Hoare triple {5905#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5905#true} is VALID [2022-02-20 16:56:22,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {5905#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5905#true} is VALID [2022-02-20 16:56:22,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-02-20 16:56:22,758 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5905#true} {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} #123#return; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(sll_circular_create_~len#1 > 1); {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,759 INFO L272 TraceCheckUtils]: 10: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {5905#true} is VALID [2022-02-20 16:56:22,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {5905#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {5905#true} is VALID [2022-02-20 16:56:22,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {5905#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5905#true} is VALID [2022-02-20 16:56:22,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {5905#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5905#true} is VALID [2022-02-20 16:56:22,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-02-20 16:56:22,760 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5905#true} {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} #125#return; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_create_~len#1 > 1); {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_update_at_~index#1 > 0); {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume { :end_inline_sll_circular_update_at } true; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_update_at_~index#1 > 0); {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume { :end_inline_sll_circular_update_at } true; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(main_~i~0#1 < main_~len~0#1); {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_~i~0#1 := 0; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_get_data_at_~index#1 > 0); {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,766 INFO L290 TraceCheckUtils]: 37: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(main_~expected~0#1 != main_#t~ret17#1);havoc main_#t~ret17#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,767 INFO L290 TraceCheckUtils]: 39: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {5919#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1)} is VALID [2022-02-20 16:56:22,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {5919#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1)} assume !!(sll_circular_get_data_at_~index#1 > 0);call sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;sll_circular_get_data_at_#t~post10#1 := sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#t~post10#1 - 1;havoc sll_circular_get_data_at_#t~post10#1; {5920#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)} is VALID [2022-02-20 16:56:22,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {5920#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)} assume !!(sll_circular_get_data_at_~index#1 > 0);call sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;sll_circular_get_data_at_#t~post10#1 := sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#t~post10#1 - 1;havoc sll_circular_get_data_at_#t~post10#1; {5906#false} is VALID [2022-02-20 16:56:22,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {5906#false} assume !(sll_circular_get_data_at_~index#1 > 0); {5906#false} is VALID [2022-02-20 16:56:22,768 INFO L290 TraceCheckUtils]: 43: Hoare triple {5906#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {5906#false} is VALID [2022-02-20 16:56:22,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {5906#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {5906#false} is VALID [2022-02-20 16:56:22,769 INFO L290 TraceCheckUtils]: 45: Hoare triple {5906#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {5906#false} is VALID [2022-02-20 16:56:22,769 INFO L290 TraceCheckUtils]: 46: Hoare triple {5906#false} assume !false; {5906#false} is VALID [2022-02-20 16:56:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 16:56:22,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:56:22,941 INFO L290 TraceCheckUtils]: 46: Hoare triple {5906#false} assume !false; {5906#false} is VALID [2022-02-20 16:56:22,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {5906#false} assume main_~expected~0#1 != main_#t~ret17#1;havoc main_#t~ret17#1; {5906#false} is VALID [2022-02-20 16:56:22,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {5906#false} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {5906#false} is VALID [2022-02-20 16:56:22,941 INFO L290 TraceCheckUtils]: 43: Hoare triple {5906#false} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {5906#false} is VALID [2022-02-20 16:56:22,941 INFO L290 TraceCheckUtils]: 42: Hoare triple {5906#false} assume !(sll_circular_get_data_at_~index#1 > 0); {5906#false} is VALID [2022-02-20 16:56:22,942 INFO L290 TraceCheckUtils]: 41: Hoare triple {5920#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)} assume !!(sll_circular_get_data_at_~index#1 > 0);call sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;sll_circular_get_data_at_#t~post10#1 := sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#t~post10#1 - 1;havoc sll_circular_get_data_at_#t~post10#1; {5906#false} is VALID [2022-02-20 16:56:22,943 INFO L290 TraceCheckUtils]: 40: Hoare triple {5919#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1)} assume !!(sll_circular_get_data_at_~index#1 > 0);call sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset := read~$Pointer$(sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset;sll_circular_get_data_at_#t~post10#1 := sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#t~post10#1 - 1;havoc sll_circular_get_data_at_#t~post10#1; {5920#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)} is VALID [2022-02-20 16:56:22,943 INFO L290 TraceCheckUtils]: 39: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {5919#(<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1)} is VALID [2022-02-20 16:56:22,944 INFO L290 TraceCheckUtils]: 38: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,944 INFO L290 TraceCheckUtils]: 37: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(main_~expected~0#1 != main_#t~ret17#1);havoc main_#t~ret17#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~ret17#1 := sll_circular_get_data_at_#res#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,945 INFO L290 TraceCheckUtils]: 35: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} call sll_circular_get_data_at_#t~mem11#1 := read~int(sll_circular_get_data_at_~head#1.base, 4 + sll_circular_get_data_at_~head#1.offset, 4);sll_circular_get_data_at_#res#1 := sll_circular_get_data_at_#t~mem11#1;havoc sll_circular_get_data_at_#t~mem11#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,945 INFO L290 TraceCheckUtils]: 34: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_get_data_at_~index#1 > 0); {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,945 INFO L290 TraceCheckUtils]: 33: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(main_~i~0#1 < main_~len~0#1);main_~expected~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_get_data_at } true;sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;havoc sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset := sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset;sll_circular_get_data_at_~index#1 := sll_circular_get_data_at_#in~index#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_~i~0#1 := 0; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(main_~i~0#1 < main_~len~0#1); {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume { :end_inline_sll_circular_update_at } true; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_update_at_~index#1 > 0); {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(sll_circular_update_at_~index#1 > 0);call sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset := read~$Pointer$(sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, 4);sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset;sll_circular_update_at_#t~post13#1 := sll_circular_update_at_~index#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#t~post13#1 - 1;havoc sll_circular_update_at_#t~post13#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume { :end_inline_sll_circular_update_at } true; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} call write~int(sll_circular_update_at_~data#1, sll_circular_update_at_~head#1.base, 4 + sll_circular_update_at_~head#1.offset, 4); {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_update_at_~index#1 > 0); {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(main_~i~0#1 < main_~len~0#1);main_~new_data~0#1 := main_~i~0#1 + main_~len~0#1;assume { :begin_inline_sll_circular_update_at } true;sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset, sll_circular_update_at_#in~data#1, sll_circular_update_at_#in~index#1 := main_~s~0#1.base, main_~s~0#1.offset, main_~new_data~0#1, main_~i~0#1;havoc sll_circular_update_at_#t~mem12#1.base, sll_circular_update_at_#t~mem12#1.offset, sll_circular_update_at_#t~post13#1, sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset, sll_circular_update_at_~data#1, sll_circular_update_at_~index#1;sll_circular_update_at_~head#1.base, sll_circular_update_at_~head#1.offset := sll_circular_update_at_#in~head#1.base, sll_circular_update_at_#in~head#1.offset;sll_circular_update_at_~data#1 := sll_circular_update_at_#in~data#1;sll_circular_update_at_~index#1 := sll_circular_update_at_#in~index#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} main_#t~ret14#1.base, main_#t~ret14#1.offset := sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;assume { :end_inline_sll_circular_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret14#1.base, main_#t~ret14#1.offset;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~i~0#1 := 0;main_~i~0#1 := 0; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset, 4);sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !(sll_circular_create_~len#1 > 1); {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset := sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;havoc sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset;call write~$Pointer$(sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, 4);sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset;sll_circular_create_#t~post6#1 := sll_circular_create_~len#1;sll_circular_create_~len#1 := sll_circular_create_#t~post6#1 - 1;havoc sll_circular_create_#t~post6#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,951 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5905#true} {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} #125#return; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-02-20 16:56:22,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {5905#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5905#true} is VALID [2022-02-20 16:56:22,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {5905#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5905#true} is VALID [2022-02-20 16:56:22,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {5905#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {5905#true} is VALID [2022-02-20 16:56:22,952 INFO L272 TraceCheckUtils]: 10: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} call sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset := node_create(sll_circular_create_~data#1); {5905#true} is VALID [2022-02-20 16:56:22,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} assume !!(sll_circular_create_~len#1 > 1); {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset := sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset;sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset := sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,953 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5905#true} {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} #123#return; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-02-20 16:56:22,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {5905#true} call write~$Pointer$(0, 0, ~temp~0#1.base, ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {5905#true} is VALID [2022-02-20 16:56:22,954 INFO L290 TraceCheckUtils]: 4: Hoare triple {5905#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {5905#true} is VALID [2022-02-20 16:56:22,954 INFO L290 TraceCheckUtils]: 3: Hoare triple {5905#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~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; {5905#true} is VALID [2022-02-20 16:56:22,954 INFO L272 TraceCheckUtils]: 2: Hoare triple {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} call sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset := node_create(sll_circular_create_~data#1); {5905#true} is VALID [2022-02-20 16:56:22,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {5905#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~post15#1, main_~new_data~0#1, main_#t~ret17#1, main_#t~post16#1, main_~expected~0#1, main_~len~0#1, main_~data~0#1, main_~s~0#1.base, main_~s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;assume { :begin_inline_sll_circular_create } true;sll_circular_create_#in~len#1, sll_circular_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_circular_create_#res#1.base, sll_circular_create_#res#1.offset;havoc sll_circular_create_#t~ret4#1.base, sll_circular_create_#t~ret4#1.offset, sll_circular_create_#t~ret5#1.base, sll_circular_create_#t~ret5#1.offset, sll_circular_create_#t~post6#1, sll_circular_create_~new_head~0#1.base, sll_circular_create_~new_head~0#1.offset, sll_circular_create_~len#1, sll_circular_create_~data#1, sll_circular_create_~head~0#1.base, sll_circular_create_~head~0#1.offset, sll_circular_create_~last~0#1.base, sll_circular_create_~last~0#1.offset;sll_circular_create_~len#1 := sll_circular_create_#in~len#1;sll_circular_create_~data#1 := sll_circular_create_#in~data#1; {5928#(<= |ULTIMATE.start_main_~len~0#1| 2)} is VALID [2022-02-20 16:56:22,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {5905#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(19, 2); {5905#true} is VALID [2022-02-20 16:56:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 16:56:22,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923832216] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:56:22,956 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:56:22,956 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2022-02-20 16:56:22,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30709772] [2022-02-20 16:56:22,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:56:22,957 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-02-20 16:56:22,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:22,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:56:23,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:23,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:56:23,003 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:56:23,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:56:23,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:56:23,004 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:56:23,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:23,229 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-02-20 16:56:23,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 16:56:23,229 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-02-20 16:56:23,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:56:23,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-02-20 16:56:23,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:56:23,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-02-20 16:56:23,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-02-20 16:56:23,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:23,263 INFO L225 Difference]: With dead ends: 43 [2022-02-20 16:56:23,263 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:56:23,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-02-20 16:56:23,263 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 26 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:23,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 80 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:23,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:56:23,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:56:23,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:23,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:56:23,264 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:56:23,264 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:56:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:23,264 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:56:23,264 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:56:23,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:23,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:23,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:56:23,265 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:56:23,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:23,265 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:56:23,265 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:56:23,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:23,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:23,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:23,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:56:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:56:23,265 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2022-02-20 16:56:23,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:23,266 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:56:23,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:56:23,266 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:56:23,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:23,268 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:56:23,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-20 16:56:23,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-20 16:56:23,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:56:32,827 WARN L228 SmtUtils]: Spent 8.33s on a formula simplification. DAG size of input: 42 DAG size of output: 30 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-02-20 16:57:02,118 WARN L228 SmtUtils]: Spent 25.44s on a formula simplification. DAG size of input: 85 DAG size of output: 80 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-02-20 16:57:02,154 INFO L861 garLoopResultBuilder]: At program point L638(lines 620 639) the Hoare annotation is: true [2022-02-20 16:57:02,155 INFO L854 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse1 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse14 (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse10 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse12 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse5 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse3 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse6 (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse8 (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) (.cse9 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (.cse13 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_update_at_~index#1|)) (.cse11 (<= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 .cse1 (forall ((v_ArrVal_1087 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1087) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) .cse3 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) .cse4 (<= .cse5 |ULTIMATE.start_sll_circular_update_at_~data#1|) (forall ((v_ArrVal_1088 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1088) |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) .cse6 .cse7 .cse8 .cse9 (not .cse10) .cse11) (and .cse0 .cse10 (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) .cse2 (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) .cse12 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)) .cse3 .cse4 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse6 .cse7 .cse9 (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) .cse13 (= (select .cse14 |ULTIMATE.start_main_~s~0#1.offset|) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (and .cse0 .cse1 (= (select .cse14 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 0) .cse10 (forall ((v_ArrVal_514 (Array Int Int))) (<= |ULTIMATE.start_main_~len~0#1| (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_514) |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) .cse2 .cse12 (= .cse5 |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11))) [2022-02-20 16:57:02,155 INFO L858 garLoopResultBuilder]: For program point L614-3(lines 614 617) no Hoare annotation was computed. [2022-02-20 16:57:02,155 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:57:02,155 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:57:02,155 INFO L858 garLoopResultBuilder]: For program point L631(lines 631 633) no Hoare annotation was computed. [2022-02-20 16:57:02,155 INFO L861 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2022-02-20 16:57:02,155 INFO L858 garLoopResultBuilder]: For program point L598-3(lines 598 602) no Hoare annotation was computed. [2022-02-20 16:57:02,155 INFO L854 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse17 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse18 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse0 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse5 (not (= .cse18 |ULTIMATE.start_main_~s~0#1.base|))) (.cse7 (<= |ULTIMATE.start_main_~len~0#1| 2)) (.cse12 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse13 (<= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0)) (.cse1 (<= 2 |ULTIMATE.start_main_~len~0#1|)) (.cse4 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)) (.cse6 (= (select (select |#memory_int| .cse18) (+ .cse17 4)) (+ |ULTIMATE.start_main_~len~0#1| 1))) (.cse15 (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) (.cse8 (= .cse17 0)) (.cse9 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse10 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse11 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse3 (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) .cse2 (<= |ULTIMATE.start_main_~expected~0#1| .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse3 |ULTIMATE.start_main_~expected~0#1|) .cse12) (let ((.cse14 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|))) (let ((.cse16 (select (select |#memory_int| .cse14) 4))) (and .cse0 .cse13 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) 0) (not (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| .cse14)) .cse2 .cse4 .cse5 .cse6 .cse15 .cse7 (<= 1 |ULTIMATE.start_sll_circular_get_data_at_~index#1|) .cse8 .cse9 .cse10 .cse11 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) .cse12 (<= .cse16 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~expected~0#1| .cse16)))) (and .cse13 .cse1 .cse4 .cse6 .cse15 .cse8 (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse9 .cse10 .cse11 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= .cse3 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))))) [2022-02-20 16:57:02,155 INFO L858 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2022-02-20 16:57:02,155 INFO L854 garLoopResultBuilder]: At program point L632(lines 620 639) the Hoare annotation is: false [2022-02-20 16:57:02,155 INFO L858 garLoopResultBuilder]: For program point L625-2(lines 625 628) no Hoare annotation was computed. [2022-02-20 16:57:02,155 INFO L854 garLoopResultBuilder]: At program point L625-3(lines 625 628) the Hoare annotation is: (let ((.cse9 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse7 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse12 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse2 (= .cse9 0)) (.cse10 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse3 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse5 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse11 (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) (.cse6 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (.cse13 (<= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| Int)) (or (and (<= |ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1085 Int)) (not (= |ULTIMATE.start_main_~s~0#1.base| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| 4) v_ArrVal_1085) |ULTIMATE.start_main_~s~0#1.offset|)))) (<= 0 |ULTIMATE.start_main_~i~0#1|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25| |ULTIMATE.start_main_~s~0#1.offset|))) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) .cse1 .cse2 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)) .cse3 .cse4 .cse5 .cse6 (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (and .cse7 (= (select (select |#memory_int| .cse8) (+ .cse9 4)) (+ |ULTIMATE.start_main_~len~0#1| 1)) .cse2 .cse10 .cse3 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse5 .cse11 (not .cse12) .cse13) (and .cse0 .cse7 .cse12 (not (= .cse8 |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~i~0#1| 1) .cse1 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) .cse2 .cse10 .cse3 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_update_at_~data#1|) .cse4 .cse5 .cse11 .cse6 .cse13)))) [2022-02-20 16:57:02,155 INFO L858 garLoopResultBuilder]: For program point L625-4(lines 625 628) no Hoare annotation was computed. [2022-02-20 16:57:02,155 INFO L854 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (and (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_~len#1|)) [2022-02-20 16:57:02,155 INFO L858 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2022-02-20 16:57:02,155 INFO L854 garLoopResultBuilder]: At program point L593(lines 583 594) the Hoare annotation is: (and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_create_#res#1.offset|) |ULTIMATE.start_sll_circular_create_#res#1.base|)) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) [2022-02-20 16:57:02,155 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:57:02,156 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 637) no Hoare annotation was computed. [2022-02-20 16:57:02,156 INFO L854 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) .cse1 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) .cse2 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))) (and .cse1 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) .cse2 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_~len#1|)))) [2022-02-20 16:57:02,156 INFO L858 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed. [2022-02-20 16:57:02,156 INFO L854 garLoopResultBuilder]: At program point L611(lines 606 612) the Hoare annotation is: (let ((.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse0 (<= 2 |ULTIMATE.start_main_~len~0#1|)) (.cse2 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)) (.cse4 (= (select (select |#memory_int| .cse3) (+ .cse8 4)) (+ |ULTIMATE.start_main_~len~0#1| 1))) (.cse5 (= .cse8 0)) (.cse6 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse7 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)))) (or (and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) .cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~expected~0#1| .cse1) .cse2 (not (= .cse3 |ULTIMATE.start_main_~s~0#1.base|)) .cse4 (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~expected~0#1| |ULTIMATE.start_sll_circular_get_data_at_#res#1|) .cse5 (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|) .cse6 .cse7 (<= .cse1 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (and (<= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0) .cse0 .cse2 .cse4 (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) .cse5 (= 2 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|) .cse6 .cse7 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= .cse1 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))))) [2022-02-20 16:57:02,156 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:57:02,156 INFO L858 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2022-02-20 16:57:02,156 INFO L854 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_~len#1|)) [2022-02-20 16:57:02,156 INFO L858 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2022-02-20 16:57:02,156 INFO L858 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2022-02-20 16:57:02,156 INFO L858 garLoopResultBuilder]: For program point L629-2(lines 629 634) no Hoare annotation was computed. [2022-02-20 16:57:02,156 INFO L854 garLoopResultBuilder]: At program point L629-3(lines 629 634) the Hoare annotation is: (let ((.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse7 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse1 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse4 (= (select (select |#memory_int| .cse3) (+ .cse7 4)) (+ |ULTIMATE.start_main_~len~0#1| 1))) (.cse5 (= .cse7 0)) (.cse0 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse6 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and .cse0 .cse1 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse2) (and (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (not (= .cse3 |ULTIMATE.start_main_~s~0#1.base|)) .cse4 .cse5 .cse0 .cse1 .cse6 .cse2 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse4 .cse5 .cse0 .cse6 .cse2 (= |ULTIMATE.start_main_~len~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))))) [2022-02-20 16:57:02,156 INFO L858 garLoopResultBuilder]: For program point L629-4(lines 629 634) no Hoare annotation was computed. [2022-02-20 16:57:02,156 INFO L858 garLoopResultBuilder]: For program point L613(lines 613 619) no Hoare annotation was computed. [2022-02-20 16:57:02,156 INFO L858 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2022-02-20 16:57:02,156 INFO L858 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2022-02-20 16:57:02,156 INFO L861 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-02-20 16:57:02,156 INFO L854 garLoopResultBuilder]: At program point node_createENTRY(lines 574 582) the Hoare annotation is: (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|)) [2022-02-20 16:57:02,156 INFO L858 garLoopResultBuilder]: For program point node_createFINAL(lines 574 582) no Hoare annotation was computed. [2022-02-20 16:57:02,156 INFO L858 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2022-02-20 16:57:02,158 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1] [2022-02-20 16:57:02,159 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:57:02,161 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:57:02,161 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2022-02-20 16:57:02,161 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:57:02,161 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2022-02-20 16:57:02,161 WARN L170 areAnnotationChecker]: L576 has no Hoare annotation [2022-02-20 16:57:02,161 WARN L170 areAnnotationChecker]: L584-1 has no Hoare annotation [2022-02-20 16:57:02,176 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2022-02-20 16:57:02,176 WARN L170 areAnnotationChecker]: L584-1 has no Hoare annotation [2022-02-20 16:57:02,176 WARN L170 areAnnotationChecker]: node_createFINAL has no Hoare annotation [2022-02-20 16:57:02,176 WARN L170 areAnnotationChecker]: L586-3 has no Hoare annotation [2022-02-20 16:57:02,176 WARN L170 areAnnotationChecker]: L586-3 has no Hoare annotation [2022-02-20 16:57:02,177 WARN L170 areAnnotationChecker]: node_createEXIT has no Hoare annotation [2022-02-20 16:57:02,177 WARN L170 areAnnotationChecker]: node_createEXIT has no Hoare annotation [2022-02-20 16:57:02,177 WARN L170 areAnnotationChecker]: L586-3 has no Hoare annotation [2022-02-20 16:57:02,177 WARN L170 areAnnotationChecker]: L587-1 has no Hoare annotation [2022-02-20 16:57:02,178 WARN L170 areAnnotationChecker]: L587-1 has no Hoare annotation [2022-02-20 16:57:02,180 WARN L170 areAnnotationChecker]: L625-4 has no Hoare annotation [2022-02-20 16:57:02,180 WARN L170 areAnnotationChecker]: L625-4 has no Hoare annotation [2022-02-20 16:57:02,186 WARN L170 areAnnotationChecker]: L625-4 has no Hoare annotation [2022-02-20 16:57:02,186 WARN L170 areAnnotationChecker]: L614-3 has no Hoare annotation [2022-02-20 16:57:02,186 WARN L170 areAnnotationChecker]: L614-3 has no Hoare annotation [2022-02-20 16:57:02,192 WARN L170 areAnnotationChecker]: L629-4 has no Hoare annotation [2022-02-20 16:57:02,192 WARN L170 areAnnotationChecker]: L629-4 has no Hoare annotation [2022-02-20 16:57:02,195 WARN L170 areAnnotationChecker]: L614-3 has no Hoare annotation [2022-02-20 16:57:02,195 WARN L170 areAnnotationChecker]: L629-4 has no Hoare annotation [2022-02-20 16:57:02,195 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2022-02-20 16:57:02,195 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2022-02-20 16:57:02,200 WARN L170 areAnnotationChecker]: L613 has no Hoare annotation [2022-02-20 16:57:02,200 WARN L170 areAnnotationChecker]: L596 has no Hoare annotation [2022-02-20 16:57:02,200 WARN L170 areAnnotationChecker]: L596 has no Hoare annotation [2022-02-20 16:57:02,201 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2022-02-20 16:57:02,201 WARN L170 areAnnotationChecker]: L625-2 has no Hoare annotation [2022-02-20 16:57:02,201 WARN L170 areAnnotationChecker]: L598-3 has no Hoare annotation [2022-02-20 16:57:02,201 WARN L170 areAnnotationChecker]: L598-3 has no Hoare annotation [2022-02-20 16:57:02,201 WARN L170 areAnnotationChecker]: L595 has no Hoare annotation [2022-02-20 16:57:02,201 WARN L170 areAnnotationChecker]: L631 has no Hoare annotation [2022-02-20 16:57:02,201 WARN L170 areAnnotationChecker]: L598-3 has no Hoare annotation [2022-02-20 16:57:02,201 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:57:02,201 WARN L170 areAnnotationChecker]: L631 has no Hoare annotation [2022-02-20 16:57:02,201 WARN L170 areAnnotationChecker]: L631 has no Hoare annotation [2022-02-20 16:57:02,201 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:57:02,201 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-02-20 16:57:02,201 WARN L170 areAnnotationChecker]: L629-2 has no Hoare annotation [2022-02-20 16:57:02,201 INFO L163 areAnnotationChecker]: CFG has 11 edges. 10 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:57:02,206 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,207 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,207 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,207 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,207 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,208 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,210 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,211 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,211 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,211 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,211 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,211 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,212 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,213 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,213 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,214 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,214 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,215 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,215 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,215 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,216 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,217 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,220 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,220 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,221 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1087,QUANTIFIED] [2022-02-20 16:57:02,221 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,221 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,221 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] [2022-02-20 16:57:02,221 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_514,QUANTIFIED] [2022-02-20 16:57:02,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1087,QUANTIFIED] [2022-02-20 16:57:02,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] [2022-02-20 16:57:02,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,227 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_514,QUANTIFIED] [2022-02-20 16:57:02,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,229 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1085,QUANTIFIED] [2022-02-20 16:57:02,229 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25,QUANTIFIED] [2022-02-20 16:57:02,230 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25,QUANTIFIED] [2022-02-20 16:57:02,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,232 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1085,QUANTIFIED] [2022-02-20 16:57:02,233 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25,QUANTIFIED] [2022-02-20 16:57:02,233 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25,QUANTIFIED] [2022-02-20 16:57:02,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,234 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,234 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,234 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,234 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,235 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,235 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,237 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,237 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,237 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,237 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,237 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,238 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,238 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,238 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,238 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,238 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,238 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,239 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,239 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,239 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,239 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,240 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,240 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,241 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,241 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,241 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,241 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,241 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,241 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:57:02 BoogieIcfgContainer [2022-02-20 16:57:02,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:57:02,244 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:57:02,245 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:57:02,245 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:57:02,245 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:55:54" (3/4) ... [2022-02-20 16:57:02,253 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:57:02,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-02-20 16:57:02,259 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-02-20 16:57:02,261 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-02-20 16:57:02,261 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:57:02,261 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:57:02,276 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((last == #memory_$Pointer$[head][head] && \result == 0) && 0 <= head) && #memory_$Pointer$[\result][\result] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && len <= 1) && head <= 0) && len == 2) && !(head == last) [2022-02-20 16:57:02,277 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((last == #memory_$Pointer$[head][head] && (forall v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25 : int :: ((i <= 0 && (forall v_ArrVal_1085 : int :: !(s == #memory_$Pointer$[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25 + 4 := v_ArrVal_1085][s]))) && 0 <= i) || v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25 < s)) && \result <= 0) && 0 <= head) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && len <= 1) && head <= 0) && len == 2) && !(head == last)) && 0 <= \result) && s == 0) || (((((((((0 <= s && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && #memory_$Pointer$[s][s] == 0) && index <= 0) && len <= 1) && 2 <= i) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == s)) && s <= 0)) || (((((((((((((((last == #memory_$Pointer$[head][head] && 0 <= s) && head == s) && !(#memory_$Pointer$[s][s] == s)) && i == 1) && 0 <= head) && s == head) && #memory_$Pointer$[s][s] == 0) && index <= 0) && len <= 1) && len == data) && head <= 0) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == last)) && s <= 0) [2022-02-20 16:57:02,278 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((last == #memory_$Pointer$[head][head] && 0 <= s) && (forall v_ArrVal_1087 : [int]int :: #memory_$Pointer$[head := v_ArrVal_1087][s][s] == head)) && i + 1 <= len) && 0 <= head) && #memory_$Pointer$[s][s] == 0) && len + i == data) && index <= 0) && len <= 1) && len + 1 <= data) && (forall v_ArrVal_1088 : [int]int :: #memory_$Pointer$[head := v_ArrVal_1088][s][s] == head)) && head <= 0) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == last)) && !(head == s)) && s <= 0) || ((((((((((((((((last == #memory_$Pointer$[head][head] && head == s) && \result <= 0) && 0 <= head) && !(head == #memory_$Pointer$[head][s])) && s == head) && !(#memory_$Pointer$[\result][\result] == \result)) && len + i == data) && len <= 1) && len == data) && head <= 0) && len == 2) && !(head == last)) && 0 <= \result) && i == index) && #memory_$Pointer$[head][s] == 0) && s == 0)) || (((((((((((((((last == #memory_$Pointer$[head][head] && 0 <= s) && #memory_$Pointer$[head][head] == 0) && head == s) && (forall v_ArrVal_514 : [int]int :: len <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head] := v_ArrVal_514][s][s + 4])) && 0 <= head) && s == head) && len + 1 == data) && len + i == data) && len <= 1) && head <= 0) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == last)) && i == index) && s <= 0) [2022-02-20 16:57:02,278 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((0 <= s && 2 <= len) && 1 <= i) && expected <= unknown-#memory_int-unknown[head][head + 4]) && i + 1 <= len) && !(#memory_$Pointer$[s][s] == s)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && len <= 2) && expected <= \result) && #memory_$Pointer$[s][s] == 0) && \result <= expected) && index <= 0) && 0 <= i) && unknown-#memory_int-unknown[head][head + 4] <= expected) && s <= 0) || ((((((((((((((((head <= 0 && 2 <= len) && i + 1 <= len) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && 0 <= head) && #memory_$Pointer$[s][s] == 0) && 2 == expected) && \result == expected) && index <= 0) && 0 <= i) && len <= 1) && index == 0) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == s)) && unknown-#memory_int-unknown[head][head + 4] == expected) && s == 0) [2022-02-20 16:57:02,295 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:57:02,296 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:57:02,296 INFO L158 Benchmark]: Toolchain (without parser) took 68492.47ms. Allocated memory was 100.7MB in the beginning and 232.8MB in the end (delta: 132.1MB). Free memory was 67.0MB in the beginning and 132.6MB in the end (delta: -65.6MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2022-02-20 16:57:02,297 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory was 53.9MB in the beginning and 53.9MB in the end (delta: 18.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:57:02,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.59ms. Allocated memory is still 100.7MB. Free memory was 67.0MB in the beginning and 66.8MB in the end (delta: 189.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:57:02,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.18ms. Allocated memory is still 100.7MB. Free memory was 66.8MB in the beginning and 64.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:57:02,298 INFO L158 Benchmark]: Boogie Preprocessor took 17.83ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 62.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:57:02,298 INFO L158 Benchmark]: RCFGBuilder took 337.93ms. Allocated memory is still 100.7MB. Free memory was 62.6MB in the beginning and 45.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 16:57:02,298 INFO L158 Benchmark]: TraceAbstraction took 67674.01ms. Allocated memory was 100.7MB in the beginning and 232.8MB in the end (delta: 132.1MB). Free memory was 45.3MB in the beginning and 135.8MB in the end (delta: -90.5MB). Peak memory consumption was 112.8MB. Max. memory is 16.1GB. [2022-02-20 16:57:02,298 INFO L158 Benchmark]: Witness Printer took 51.30ms. Allocated memory is still 232.8MB. Free memory was 135.8MB in the beginning and 132.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:57:02,300 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.13ms. Allocated memory is still 83.9MB. Free memory was 53.9MB in the beginning and 53.9MB in the end (delta: 18.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.59ms. Allocated memory is still 100.7MB. Free memory was 67.0MB in the beginning and 66.8MB in the end (delta: 189.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.18ms. Allocated memory is still 100.7MB. Free memory was 66.8MB in the beginning and 64.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.83ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 62.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 337.93ms. Allocated memory is still 100.7MB. Free memory was 62.6MB in the beginning and 45.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 67674.01ms. Allocated memory was 100.7MB in the beginning and 232.8MB in the end (delta: 132.1MB). Free memory was 45.3MB in the beginning and 135.8MB in the end (delta: -90.5MB). Peak memory consumption was 112.8MB. Max. memory is 16.1GB. * Witness Printer took 51.30ms. Allocated memory is still 232.8MB. Free memory was 135.8MB in the beginning and 132.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1087,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_514,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1087,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_514,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1085,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1085,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 637]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.5s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 38.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 736 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 731 mSDsluCounter, 2394 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 545 IncrementalHoareTripleChecker+Unchecked, 2012 mSDsCounter, 186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1949 IncrementalHoareTripleChecker+Invalid, 2680 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 186 mSolverCounterUnsat, 382 mSDtfsCounter, 1949 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 927 GetRequests, 681 SyntacticMatches, 18 SemanticMatches, 228 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=11, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 115 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 18 PreInvPairs, 38 NumberOfFragments, 1170 HoareAnnotationTreeSize, 18 FomulaSimplifications, 7765 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 14 FomulaSimplificationsInter, 6411 FormulaSimplificationTreeSizeReductionInter, 38.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 896 NumberOfCodeBlocks, 893 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1198 ConstructedInterpolants, 22 QuantifiedInterpolants, 6581 SizeOfPredicates, 90 NumberOfNonLiveVariables, 3101 ConjunctsInSsa, 246 ConjunctsInUnsatCore, 31 InterpolantComputations, 5 PerfectInterpolantSequences, 377/539 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant [2022-02-20 16:57:02,324 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,325 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,327 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,327 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,327 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,327 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,327 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,328 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,328 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,329 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,329 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,329 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,330 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,330 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((0 <= s && 2 <= len) && 1 <= i) && expected <= unknown-#memory_int-unknown[head][head + 4]) && i + 1 <= len) && !(#memory_$Pointer$[s][s] == s)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && len <= 2) && expected <= \result) && #memory_$Pointer$[s][s] == 0) && \result <= expected) && index <= 0) && 0 <= i) && unknown-#memory_int-unknown[head][head + 4] <= expected) && s <= 0) || ((((((((((((((((head <= 0 && 2 <= len) && i + 1 <= len) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && 0 <= head) && #memory_$Pointer$[s][s] == 0) && 2 == expected) && \result == expected) && index <= 0) && 0 <= i) && len <= 1) && index == 0) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == s)) && unknown-#memory_int-unknown[head][head + 4] == expected) && s == 0) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant [2022-02-20 16:57:02,332 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,332 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,332 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,332 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,332 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,333 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((last == #memory_$Pointer$[head][head] && head == 0) && len <= 1) && len == 2) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][head] == 0) || ((((head == 0 && head == last) && len == 2) && \valid[last] == 1) && len == len) - InvariantResult [Line: 629]: Loop Invariant [2022-02-20 16:57:02,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,335 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,335 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((index <= 0 && 0 <= i) && 2 <= i) && len == 2) || ((((((((((0 <= s && index <= 0) && 1 <= i) && !(#memory_$Pointer$[s][s] == s)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && #memory_$Pointer$[s][s] == 0) && index <= 0) && 0 <= i) && len <= 1) && len == 2) && s <= 0)) || ((((((((i == 0 && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && #memory_$Pointer$[s][s] == 0) && index <= 0) && len <= 1) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == s)) && s == 0) - InvariantResult [Line: 614]: Loop Invariant [2022-02-20 16:57:02,338 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,338 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1087,QUANTIFIED] [2022-02-20 16:57:02,339 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,339 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,339 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] [2022-02-20 16:57:02,339 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,339 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,339 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,339 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,340 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,340 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,341 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_514,QUANTIFIED] [2022-02-20 16:57:02,341 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,342 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,342 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,342 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1087,QUANTIFIED] [2022-02-20 16:57:02,342 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,342 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,342 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1088,QUANTIFIED] [2022-02-20 16:57:02,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,344 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_514,QUANTIFIED] [2022-02-20 16:57:02,344 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((last == #memory_$Pointer$[head][head] && 0 <= s) && (forall v_ArrVal_1087 : [int]int :: #memory_$Pointer$[head := v_ArrVal_1087][s][s] == head)) && i + 1 <= len) && 0 <= head) && #memory_$Pointer$[s][s] == 0) && len + i == data) && index <= 0) && len <= 1) && len + 1 <= data) && (forall v_ArrVal_1088 : [int]int :: #memory_$Pointer$[head := v_ArrVal_1088][s][s] == head)) && head <= 0) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == last)) && !(head == s)) && s <= 0) || ((((((((((((((((last == #memory_$Pointer$[head][head] && head == s) && \result <= 0) && 0 <= head) && !(head == #memory_$Pointer$[head][s])) && s == head) && !(#memory_$Pointer$[\result][\result] == \result)) && len + i == data) && len <= 1) && len == data) && head <= 0) && len == 2) && !(head == last)) && 0 <= \result) && i == index) && #memory_$Pointer$[head][s] == 0) && s == 0)) || (((((((((((((((last == #memory_$Pointer$[head][head] && 0 <= s) && #memory_$Pointer$[head][head] == 0) && head == s) && (forall v_ArrVal_514 : [int]int :: len <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head] := v_ArrVal_514][s][s + 4])) && 0 <= head) && s == head) && len + 1 == data) && len + i == data) && len <= 1) && head <= 0) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == last)) && i == index) && s <= 0) - InvariantResult [Line: 625]: Loop Invariant [2022-02-20 16:57:02,346 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,346 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,346 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1085,QUANTIFIED] [2022-02-20 16:57:02,346 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25,QUANTIFIED] [2022-02-20 16:57:02,346 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25,QUANTIFIED] [2022-02-20 16:57:02,346 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,347 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,347 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,347 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,347 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,347 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,347 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,348 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,349 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,349 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,349 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_1085,QUANTIFIED] [2022-02-20 16:57:02,349 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25,QUANTIFIED] [2022-02-20 16:57:02,349 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25,QUANTIFIED] [2022-02-20 16:57:02,349 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,349 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,350 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,350 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,350 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,350 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,350 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,350 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((last == #memory_$Pointer$[head][head] && (forall v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25 : int :: ((i <= 0 && (forall v_ArrVal_1085 : int :: !(s == #memory_$Pointer$[s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25 + 4 := v_ArrVal_1085][s]))) && 0 <= i) || v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_25 < s)) && \result <= 0) && 0 <= head) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && len <= 1) && head <= 0) && len == 2) && !(head == last)) && 0 <= \result) && s == 0) || (((((((((0 <= s && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && #memory_$Pointer$[s][s] == 0) && index <= 0) && len <= 1) && 2 <= i) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == s)) && s <= 0)) || (((((((((((((((last == #memory_$Pointer$[head][head] && 0 <= s) && head == s) && !(#memory_$Pointer$[s][s] == s)) && i == 1) && 0 <= head) && s == head) && #memory_$Pointer$[s][s] == 0) && index <= 0) && len <= 1) && len == data) && head <= 0) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == last)) && s <= 0) - InvariantResult [Line: 583]: Loop Invariant [2022-02-20 16:57:02,351 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,351 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,352 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,352 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,352 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,352 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((last == #memory_$Pointer$[head][head] && \result == 0) && 0 <= head) && #memory_$Pointer$[\result][\result] == 0) && !(#memory_$Pointer$[\result][\result] == \result)) && len <= 1) && head <= 0) && len == 2) && !(head == last) - InvariantResult [Line: 607]: Loop Invariant [2022-02-20 16:57:02,353 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,353 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,353 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,353 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,353 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,353 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,354 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,354 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,354 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,354 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,354 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,354 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,354 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,354 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,355 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,356 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,356 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,356 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,356 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,356 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,357 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,357 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-02-20 16:57:02,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-02-20 16:57:02,359 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((0 <= s && 2 <= len) && index <= 0) && 1 <= i) && expected <= unknown-#memory_int-unknown[head][head + 4]) && i + 1 <= len) && !(#memory_$Pointer$[s][s] == s)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && len <= 2) && #memory_$Pointer$[s][s] == 0) && index <= 0) && 0 <= i) && len <= 1) && unknown-#memory_int-unknown[head][head + 4] <= expected) && s <= 0) || (((((((((((((((((((0 <= s && head <= 0) && 2 <= len) && #memory_$Pointer$[head][head] == 0) && !(head == #memory_$Pointer$[head][head])) && 1 <= i) && i + 1 <= len) && !(#memory_$Pointer$[s][s] == s)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && 0 <= head) && len <= 2) && 1 <= index) && #memory_$Pointer$[s][s] == 0) && index <= 0) && 0 <= i) && len <= 1) && index <= 1) && s <= 0) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][4] <= expected) && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][4])) || (((((((((((((((head <= 0 && 2 <= len) && i + 1 <= len) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == len + 1) && 0 <= head) && #memory_$Pointer$[s][s] == 0) && 2 == expected) && index <= 0) && 0 <= i) && len <= 1) && index == 0) && len == 2) && len == unknown-#memory_int-unknown[s][s + 4]) && !(head == s)) && unknown-#memory_int-unknown[head][head + 4] == expected) && s == 0) RESULT: Ultimate proved your program to be correct! [2022-02-20 16:57:02,372 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: TRUE