./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3d7899c651fa61cfb9cf623e0f4ceb470fe32eb0d0272d2277c965ed07c2f88 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:59:49,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:59:49,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:59:49,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:59:49,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:59:49,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:59:49,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:59:49,777 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:59:49,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:59:49,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:59:49,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:59:49,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:59:49,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:59:49,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:59:49,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:59:49,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:59:49,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:59:49,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:59:49,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:59:49,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:59:49,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:59:49,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:59:49,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:59:49,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:59:49,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:59:49,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:59:49,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:59:49,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:59:49,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:59:49,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:59:49,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:59:49,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:59:49,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:59:49,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:59:49,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:59:49,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:59:49,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:59:49,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:59:49,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:59:49,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:59:49,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:59:49,820 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:59:49,846 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:59:49,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:59:49,853 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:59:49,853 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:59:49,854 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:59:49,854 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:59:49,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:59:49,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:59:49,855 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:59:49,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:59:49,856 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:59:49,856 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:59:49,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:59:49,856 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:59:49,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:59:49,857 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:59:49,857 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:59:49,857 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:59:49,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:59:49,857 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:59:49,857 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:59:49,858 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:59:49,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:59:49,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:59:49,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:59:49,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:59:49,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:59:49,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:59:49,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:59:49,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:59:49,860 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3d7899c651fa61cfb9cf623e0f4ceb470fe32eb0d0272d2277c965ed07c2f88 [2022-02-20 23:59:50,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:59:50,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:59:50,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:59:50,095 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:59:50,096 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:59:50,097 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i [2022-02-20 23:59:50,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3793ea53/d3de5875917e49aba48445044c902671/FLAG9e6cdcbfd [2022-02-20 23:59:50,545 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:59:50,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_remove_all_reverse.i [2022-02-20 23:59:50,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3793ea53/d3de5875917e49aba48445044c902671/FLAG9e6cdcbfd [2022-02-20 23:59:50,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3793ea53/d3de5875917e49aba48445044c902671 [2022-02-20 23:59:50,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:59:50,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:59:50,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:59:50,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:59:50,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:59:50,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:59:50" (1/1) ... [2022-02-20 23:59:50,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fcf3985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:50, skipping insertion in model container [2022-02-20 23:59:50,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:59:50" (1/1) ... [2022-02-20 23:59:50,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:59:50,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:59:51,251 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/sll2n_remove_all_reverse.i[24038,24051] [2022-02-20 23:59:51,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:59:51,264 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:59:51,305 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/sll2n_remove_all_reverse.i[24038,24051] [2022-02-20 23:59:51,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:59:51,328 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:59:51,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:51 WrapperNode [2022-02-20 23:59:51,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:59:51,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:59:51,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:59:51,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:59:51,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:51" (1/1) ... [2022-02-20 23:59:51,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:51" (1/1) ... [2022-02-20 23:59:51,382 INFO L137 Inliner]: procedures = 126, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 108 [2022-02-20 23:59:51,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:59:51,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:59:51,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:59:51,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:59:51,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:51" (1/1) ... [2022-02-20 23:59:51,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:51" (1/1) ... [2022-02-20 23:59:51,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:51" (1/1) ... [2022-02-20 23:59:51,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:51" (1/1) ... [2022-02-20 23:59:51,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:51" (1/1) ... [2022-02-20 23:59:51,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:51" (1/1) ... [2022-02-20 23:59:51,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:51" (1/1) ... [2022-02-20 23:59:51,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:59:51,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:59:51,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:59:51,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:59:51,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:51" (1/1) ... [2022-02-20 23:59:51,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:59:51,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:51,438 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:59:51,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:59:51,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:59:51,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:59:51,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:59:51,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:59:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:59:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:59:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:59:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:59:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:59:51,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:59:51,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:59:51,560 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:59:51,562 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:59:51,989 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:59:51,996 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:59:51,997 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 23:59:51,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:59:51 BoogieIcfgContainer [2022-02-20 23:59:51,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:59:52,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:59:52,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:59:52,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:59:52,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:59:50" (1/3) ... [2022-02-20 23:59:52,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ade031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:59:52, skipping insertion in model container [2022-02-20 23:59:52,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:51" (2/3) ... [2022-02-20 23:59:52,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ade031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:59:52, skipping insertion in model container [2022-02-20 23:59:52,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:59:51" (3/3) ... [2022-02-20 23:59:52,006 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_reverse.i [2022-02-20 23:59:52,013 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:59:52,013 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-02-20 23:59:52,064 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:59:52,071 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:59:52,072 INFO L340 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2022-02-20 23:59:52,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 40 states have (on average 2.025) internal successors, (81), 72 states have internal predecessors, (81), 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 23:59:52,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:59:52,106 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:52,107 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:59:52,107 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:59:52,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:52,112 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2022-02-20 23:59:52,122 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:52,123 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563391259] [2022-02-20 23:59:52,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:52,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:52,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {76#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(27, 2); {76#true} is VALID [2022-02-20 23:59:52,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {76#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {76#true} is VALID [2022-02-20 23:59:52,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {76#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {78#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} is VALID [2022-02-20 23:59:52,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {78#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {78#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} is VALID [2022-02-20 23:59:52,330 INFO L290 TraceCheckUtils]: 4: Hoare triple {78#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} assume !(1 == #valid[node_create_~temp~0#1.base]); {77#false} is VALID [2022-02-20 23:59:52,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 23:59:52,332 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:52,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563391259] [2022-02-20 23:59:52,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563391259] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:52,333 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:52,333 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:59:52,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80102820] [2022-02-20 23:59:52,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:52,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2022-02-20 23:59:52,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:52,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 23:59:52,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:52,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:59:52,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:52,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:59:52,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:52,393 INFO L87 Difference]: Start difference. First operand has 73 states, 40 states have (on average 2.025) internal successors, (81), 72 states have internal predecessors, (81), 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 has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 23:59:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:52,697 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2022-02-20 23:59:52,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:59:52,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2022-02-20 23:59:52,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:52,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 23:59:52,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2022-02-20 23:59:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 23:59:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2022-02-20 23:59:52,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 136 transitions. [2022-02-20 23:59:52,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:52,870 INFO L225 Difference]: With dead ends: 118 [2022-02-20 23:59:52,871 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 23:59:52,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:52,875 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 60 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:52,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 128 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:59:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 23:59:52,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 68. [2022-02-20 23:59:52,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:52,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 68 states, 38 states have (on average 1.868421052631579) internal successors, (71), 67 states have internal predecessors, (71), 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 23:59:52,905 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 68 states, 38 states have (on average 1.868421052631579) internal successors, (71), 67 states have internal predecessors, (71), 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 23:59:52,906 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 68 states, 38 states have (on average 1.868421052631579) internal successors, (71), 67 states have internal predecessors, (71), 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 23:59:52,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:52,912 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2022-02-20 23:59:52,912 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2022-02-20 23:59:52,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:52,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:52,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 38 states have (on average 1.868421052631579) internal successors, (71), 67 states have internal predecessors, (71), 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 115 states. [2022-02-20 23:59:52,914 INFO L87 Difference]: Start difference. First operand has 68 states, 38 states have (on average 1.868421052631579) internal successors, (71), 67 states have internal predecessors, (71), 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 115 states. [2022-02-20 23:59:52,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:52,924 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2022-02-20 23:59:52,924 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2022-02-20 23:59:52,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:52,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:52,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:52,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:52,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 38 states have (on average 1.868421052631579) internal successors, (71), 67 states have internal predecessors, (71), 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 23:59:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-02-20 23:59:52,932 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 5 [2022-02-20 23:59:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:52,933 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-02-20 23:59:52,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 23:59:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-02-20 23:59:52,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:59:52,934 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:52,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:59:52,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:59:52,934 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:59:52,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:52,935 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2022-02-20 23:59:52,935 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:52,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902036130] [2022-02-20 23:59:52,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:52,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:52,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {497#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(27, 2); {497#true} is VALID [2022-02-20 23:59:52,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {497#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {497#true} is VALID [2022-02-20 23:59:52,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {499#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:59:52,997 INFO L290 TraceCheckUtils]: 3: Hoare triple {499#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (- 8)) 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {499#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:59:52,997 INFO L290 TraceCheckUtils]: 4: Hoare triple {499#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (- 8)) 0))} assume !(4 + (4 + node_create_~temp~0#1.offset) <= #length[node_create_~temp~0#1.base] && 0 <= 4 + node_create_~temp~0#1.offset); {498#false} is VALID [2022-02-20 23:59:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:52,998 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:52,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902036130] [2022-02-20 23:59:52,999 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902036130] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:52,999 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:52,999 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:59:52,999 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103674180] [2022-02-20 23:59:52,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:53,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2022-02-20 23:59:53,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:53,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 23:59:53,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:53,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:59:53,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:53,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:59:53,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:53,008 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 23:59:53,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:53,218 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2022-02-20 23:59:53,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:59:53,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2022-02-20 23:59:53,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:53,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 23:59:53,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2022-02-20 23:59:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 23:59:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2022-02-20 23:59:53,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 128 transitions. [2022-02-20 23:59:53,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:53,347 INFO L225 Difference]: With dead ends: 120 [2022-02-20 23:59:53,347 INFO L226 Difference]: Without dead ends: 120 [2022-02-20 23:59:53,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:53,349 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 65 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:53,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 139 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:59:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-20 23:59:53,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 66. [2022-02-20 23:59:53,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:53,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 66 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 65 states have internal predecessors, (69), 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 23:59:53,354 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 66 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 65 states have internal predecessors, (69), 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 23:59:53,355 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 66 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 65 states have internal predecessors, (69), 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 23:59:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:53,358 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2022-02-20 23:59:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2022-02-20 23:59:53,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:53,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:53,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 65 states have internal predecessors, (69), 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 120 states. [2022-02-20 23:59:53,360 INFO L87 Difference]: Start difference. First operand has 66 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 65 states have internal predecessors, (69), 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 120 states. [2022-02-20 23:59:53,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:53,364 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2022-02-20 23:59:53,364 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2022-02-20 23:59:53,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:53,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:53,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:53,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 65 states have internal predecessors, (69), 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 23:59:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-02-20 23:59:53,367 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 5 [2022-02-20 23:59:53,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:53,368 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-02-20 23:59:53,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 23:59:53,368 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-02-20 23:59:53,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:59:53,369 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:53,369 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:53,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:59:53,369 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:59:53,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:53,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1808567273, now seen corresponding path program 1 times [2022-02-20 23:59:53,370 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:53,370 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642337176] [2022-02-20 23:59:53,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:53,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:53,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {928#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2); {928#true} is VALID [2022-02-20 23:59:53,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {928#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {930#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:53,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {930#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} assume !(sll_create_~len#1 > 0); {929#false} is VALID [2022-02-20 23:59:53,399 INFO L290 TraceCheckUtils]: 3: Hoare triple {929#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {929#false} is VALID [2022-02-20 23:59:53,399 INFO L290 TraceCheckUtils]: 4: Hoare triple {929#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {929#false} is VALID [2022-02-20 23:59:53,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {929#false} assume !(main_~i~0#1 >= 0); {929#false} is VALID [2022-02-20 23:59:53,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {929#false} assume !(1 == #valid[main_~#s~0#1.base]); {929#false} is VALID [2022-02-20 23:59:53,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:53,400 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:53,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642337176] [2022-02-20 23:59:53,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642337176] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:53,401 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:53,401 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:59:53,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159587153] [2022-02-20 23:59:53,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:53,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2022-02-20 23:59:53,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:53,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 23:59:53,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:53,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:59:53,408 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:53,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:59:53,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:53,409 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 23:59:53,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:53,483 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-02-20 23:59:53,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:59:53,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2022-02-20 23:59:53,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 23:59:53,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-20 23:59:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 23:59:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-20 23:59:53,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2022-02-20 23:59:53,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:53,556 INFO L225 Difference]: With dead ends: 77 [2022-02-20 23:59:53,556 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 23:59:53,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:59:53,564 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 10 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:53,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 132 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:53,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 23:59:53,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2022-02-20 23:59:53,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:53,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 67 states, 39 states have (on average 1.794871794871795) internal successors, (70), 66 states have internal predecessors, (70), 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 23:59:53,576 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 67 states, 39 states have (on average 1.794871794871795) internal successors, (70), 66 states have internal predecessors, (70), 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 23:59:53,576 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 67 states, 39 states have (on average 1.794871794871795) internal successors, (70), 66 states have internal predecessors, (70), 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 23:59:53,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:53,579 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-02-20 23:59:53,579 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2022-02-20 23:59:53,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:53,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:53,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 39 states have (on average 1.794871794871795) internal successors, (70), 66 states have internal predecessors, (70), 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 77 states. [2022-02-20 23:59:53,584 INFO L87 Difference]: Start difference. First operand has 67 states, 39 states have (on average 1.794871794871795) internal successors, (70), 66 states have internal predecessors, (70), 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 77 states. [2022-02-20 23:59:53,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:53,586 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-02-20 23:59:53,586 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2022-02-20 23:59:53,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:53,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:53,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:53,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.794871794871795) internal successors, (70), 66 states have internal predecessors, (70), 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 23:59:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2022-02-20 23:59:53,593 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 7 [2022-02-20 23:59:53,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:53,593 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2022-02-20 23:59:53,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 23:59:53,594 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-02-20 23:59:53,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:59:53,594 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:53,594 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:53,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:59:53,595 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:59:53,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:53,596 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2022-02-20 23:59:53,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:53,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033119496] [2022-02-20 23:59:53,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:53,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:53,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {1231#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(27, 2); {1231#true} is VALID [2022-02-20 23:59:53,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {1231#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1231#true} is VALID [2022-02-20 23:59:53,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {1231#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {1231#true} is VALID [2022-02-20 23:59:53,665 INFO L290 TraceCheckUtils]: 3: Hoare triple {1231#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {1231#true} is VALID [2022-02-20 23:59:53,666 INFO L290 TraceCheckUtils]: 4: Hoare triple {1231#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {1233#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} is VALID [2022-02-20 23:59:53,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {1233#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {1233#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} is VALID [2022-02-20 23:59:53,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {1233#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {1234#(= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1)} is VALID [2022-02-20 23:59:53,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {1234#(= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {1235#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-20 23:59:53,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {1235#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)} assume !(1 == #valid[sll_create_~new_head~0#1.base]); {1232#false} is VALID [2022-02-20 23:59:53,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:53,668 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:53,668 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033119496] [2022-02-20 23:59:53,668 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033119496] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:53,669 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:53,669 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:59:53,669 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190094102] [2022-02-20 23:59:53,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:53,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) Word has length 9 [2022-02-20 23:59:53,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:53,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 23:59:53,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:53,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:59:53,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:53,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:59:53,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:59:53,679 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 23:59:53,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:53,993 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-02-20 23:59:53,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:59:53,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) Word has length 9 [2022-02-20 23:59:53,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:53,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 23:59:53,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2022-02-20 23:59:53,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 23:59:53,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2022-02-20 23:59:53,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 122 transitions. [2022-02-20 23:59:54,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:54,104 INFO L225 Difference]: With dead ends: 115 [2022-02-20 23:59:54,104 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 23:59:54,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:59:54,105 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 161 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:54,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 126 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:59:54,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 23:59:54,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 66. [2022-02-20 23:59:54,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:54,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 66 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 65 states have internal predecessors, (69), 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 23:59:54,109 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 66 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 65 states have internal predecessors, (69), 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 23:59:54,110 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 66 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 65 states have internal predecessors, (69), 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 23:59:54,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:54,112 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-02-20 23:59:54,113 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2022-02-20 23:59:54,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:54,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:54,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 65 states have internal predecessors, (69), 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 115 states. [2022-02-20 23:59:54,114 INFO L87 Difference]: Start difference. First operand has 66 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 65 states have internal predecessors, (69), 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 115 states. [2022-02-20 23:59:54,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:54,116 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-02-20 23:59:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2022-02-20 23:59:54,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:54,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:54,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:54,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:54,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 65 states have internal predecessors, (69), 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 23:59:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-02-20 23:59:54,119 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 9 [2022-02-20 23:59:54,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:54,119 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-02-20 23:59:54,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 23:59:54,120 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-02-20 23:59:54,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:59:54,120 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:54,120 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:54,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:59:54,121 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:59:54,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:54,121 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2022-02-20 23:59:54,121 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:54,122 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857799669] [2022-02-20 23:59:54,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:54,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:54,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {1656#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(27, 2); {1656#true} is VALID [2022-02-20 23:59:54,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {1656#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1656#true} is VALID [2022-02-20 23:59:54,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {1656#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {1658#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-20 23:59:54,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {1658#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {1658#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-20 23:59:54,202 INFO L290 TraceCheckUtils]: 4: Hoare triple {1658#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {1658#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-20 23:59:54,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {1658#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {1658#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-20 23:59:54,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {1658#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {1659#(and (= 8 (select |#length| |ULTIMATE.start_node_create_#res#1.base|)) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} is VALID [2022-02-20 23:59:54,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {1659#(and (= 8 (select |#length| |ULTIMATE.start_node_create_#res#1.base|)) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {1660#(and (= (+ (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 23:59:54,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {1660#(and (= (+ (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} assume !(4 + (4 + sll_create_~new_head~0#1.offset) <= #length[sll_create_~new_head~0#1.base] && 0 <= 4 + sll_create_~new_head~0#1.offset); {1657#false} is VALID [2022-02-20 23:59:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:54,205 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:54,205 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857799669] [2022-02-20 23:59:54,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857799669] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:54,205 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:59:54,205 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:59:54,206 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423138304] [2022-02-20 23:59:54,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:54,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) Word has length 9 [2022-02-20 23:59:54,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:54,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 23:59:54,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:54,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:59:54,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:54,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:59:54,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:59:54,218 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 23:59:54,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:54,463 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-02-20 23:59:54,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:59:54,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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) Word has length 9 [2022-02-20 23:59:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 23:59:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-02-20 23:59:54,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 23:59:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-02-20 23:59:54,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-02-20 23:59:54,538 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 23:59:54,539 INFO L225 Difference]: With dead ends: 70 [2022-02-20 23:59:54,539 INFO L226 Difference]: Without dead ends: 70 [2022-02-20 23:59:54,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:59:54,541 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 184 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:54,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 42 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:54,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-20 23:59:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-02-20 23:59:54,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:54,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 65 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 64 states have internal predecessors, (68), 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 23:59:54,547 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 65 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 64 states have internal predecessors, (68), 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 23:59:54,548 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 65 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 64 states have internal predecessors, (68), 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 23:59:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:54,549 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-02-20 23:59:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-02-20 23:59:54,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:54,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:54,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 64 states have internal predecessors, (68), 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 70 states. [2022-02-20 23:59:54,550 INFO L87 Difference]: Start difference. First operand has 65 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 64 states have internal predecessors, (68), 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 70 states. [2022-02-20 23:59:54,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:54,552 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-02-20 23:59:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-02-20 23:59:54,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:54,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:54,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:54,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 64 states have internal predecessors, (68), 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 23:59:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2022-02-20 23:59:54,554 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 9 [2022-02-20 23:59:54,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:54,554 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2022-02-20 23:59:54,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 23:59:54,554 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-02-20 23:59:54,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:59:54,555 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:54,555 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:54,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:59:54,555 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:59:54,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:54,556 INFO L85 PathProgramCache]: Analyzing trace with hash -718760675, now seen corresponding path program 1 times [2022-02-20 23:59:54,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:54,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097177049] [2022-02-20 23:59:54,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:54,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:54,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {1944#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(27, 2); {1944#true} is VALID [2022-02-20 23:59:54,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {1944#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1946#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:54,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {1946#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {1946#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:54,656 INFO L290 TraceCheckUtils]: 3: Hoare triple {1946#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {1946#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:54,657 INFO L290 TraceCheckUtils]: 4: Hoare triple {1946#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {1946#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:54,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {1946#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {1946#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:54,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {1946#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {1946#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:54,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {1946#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {1946#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:54,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {1946#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {1946#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:54,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {1946#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {1946#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 23:59:54,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {1946#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {1947#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:54,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {1947#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {1945#false} is VALID [2022-02-20 23:59:54,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {1945#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1945#false} is VALID [2022-02-20 23:59:54,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {1945#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {1945#false} is VALID [2022-02-20 23:59:54,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {1945#false} assume !(main_~i~0#1 >= 0); {1945#false} is VALID [2022-02-20 23:59:54,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {1945#false} assume !(1 == #valid[main_~#s~0#1.base]); {1945#false} is VALID [2022-02-20 23:59:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:54,661 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:54,661 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097177049] [2022-02-20 23:59:54,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097177049] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:54,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358122773] [2022-02-20 23:59:54,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:54,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:54,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:54,667 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:59:54,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:59:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:54,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:59:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:54,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:54,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {1944#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(27, 2); {1944#true} is VALID [2022-02-20 23:59:54,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {1944#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:54,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:54,896 INFO L290 TraceCheckUtils]: 3: Hoare triple {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:54,897 INFO L290 TraceCheckUtils]: 4: Hoare triple {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:54,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:54,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:54,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:54,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:54,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:54,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {1947#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:54,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {1947#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {1945#false} is VALID [2022-02-20 23:59:54,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {1945#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1945#false} is VALID [2022-02-20 23:59:54,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {1945#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {1945#false} is VALID [2022-02-20 23:59:54,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {1945#false} assume !(main_~i~0#1 >= 0); {1945#false} is VALID [2022-02-20 23:59:54,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {1945#false} assume !(1 == #valid[main_~#s~0#1.base]); {1945#false} is VALID [2022-02-20 23:59:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:54,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:55,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {1945#false} assume !(1 == #valid[main_~#s~0#1.base]); {1945#false} is VALID [2022-02-20 23:59:55,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {1945#false} assume !(main_~i~0#1 >= 0); {1945#false} is VALID [2022-02-20 23:59:55,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {1945#false} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {1945#false} is VALID [2022-02-20 23:59:55,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {1945#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1945#false} is VALID [2022-02-20 23:59:55,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {1947#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {1945#false} is VALID [2022-02-20 23:59:55,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {1947#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:55,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:55,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:55,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:55,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:55,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:55,062 INFO L290 TraceCheckUtils]: 4: Hoare triple {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:55,062 INFO L290 TraceCheckUtils]: 3: Hoare triple {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:55,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:55,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {1944#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1954#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 23:59:55,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {1944#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(27, 2); {1944#true} is VALID [2022-02-20 23:59:55,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:55,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358122773] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:59:55,064 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:59:55,064 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-02-20 23:59:55,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647491908] [2022-02-20 23:59:55,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:55,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) Word has length 16 [2022-02-20 23:59:55,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:55,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 23:59:55,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:55,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:59:55,086 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:55,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:59:55,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:59:55,087 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 23:59:55,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:55,194 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-02-20 23:59:55,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:59:55,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) Word has length 16 [2022-02-20 23:59:55,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 23:59:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-02-20 23:59:55,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 23:59:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-02-20 23:59:55,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-02-20 23:59:55,255 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 23:59:55,256 INFO L225 Difference]: With dead ends: 74 [2022-02-20 23:59:55,256 INFO L226 Difference]: Without dead ends: 74 [2022-02-20 23:59:55,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:59:55,257 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 16 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:55,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 184 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:55,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-02-20 23:59:55,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-02-20 23:59:55,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:55,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 73 states have internal predecessors, (77), 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 23:59:55,260 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 73 states have internal predecessors, (77), 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 23:59:55,260 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 73 states have internal predecessors, (77), 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 23:59:55,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:55,262 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-02-20 23:59:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-02-20 23:59:55,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:55,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:55,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 73 states have internal predecessors, (77), 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 74 states. [2022-02-20 23:59:55,263 INFO L87 Difference]: Start difference. First operand has 74 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 73 states have internal predecessors, (77), 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 74 states. [2022-02-20 23:59:55,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:55,264 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-02-20 23:59:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-02-20 23:59:55,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:55,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:55,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:55,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 73 states have internal predecessors, (77), 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 23:59:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-02-20 23:59:55,267 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2022-02-20 23:59:55,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:55,267 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-02-20 23:59:55,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 23:59:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-02-20 23:59:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:59:55,268 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:55,268 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:55,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:55,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-20 23:59:55,492 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:59:55,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:55,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1731307113, now seen corresponding path program 2 times [2022-02-20 23:59:55,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:55,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063706332] [2022-02-20 23:59:55,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:55,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:55,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {2337#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(27, 2); {2337#true} is VALID [2022-02-20 23:59:55,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {2337#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2339#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} is VALID [2022-02-20 23:59:55,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {2339#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {2339#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} is VALID [2022-02-20 23:59:55,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {2339#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {2339#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} is VALID [2022-02-20 23:59:55,600 INFO L290 TraceCheckUtils]: 4: Hoare triple {2339#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {2339#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} is VALID [2022-02-20 23:59:55,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {2339#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {2339#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} is VALID [2022-02-20 23:59:55,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {2339#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {2339#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} is VALID [2022-02-20 23:59:55,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {2339#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2339#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} is VALID [2022-02-20 23:59:55,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {2339#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {2339#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} is VALID [2022-02-20 23:59:55,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {2339#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2339#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} is VALID [2022-02-20 23:59:55,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {2339#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_create_~len#1 > 0); {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {2341#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:55,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {2341#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {2338#false} is VALID [2022-02-20 23:59:55,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {2338#false} assume !(1 == #valid[main_~#s~0#1.base]); {2338#false} is VALID [2022-02-20 23:59:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:59:55,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:55,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063706332] [2022-02-20 23:59:55,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063706332] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:55,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828045639] [2022-02-20 23:59:55,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:59:55,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:55,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:55,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:59:55,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:59:55,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 23:59:55,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:59:55,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:59:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:55,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:55,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {2337#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(27, 2); {2337#true} is VALID [2022-02-20 23:59:55,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {2337#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,833 INFO L290 TraceCheckUtils]: 3: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,833 INFO L290 TraceCheckUtils]: 4: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_create_~len#1 > 0); {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 23:59:55,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {2340#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {2341#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 23:59:55,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {2341#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {2338#false} is VALID [2022-02-20 23:59:55,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {2338#false} assume !(1 == #valid[main_~#s~0#1.base]); {2338#false} is VALID [2022-02-20 23:59:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 23:59:55,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:59:55,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828045639] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:59:55,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:59:55,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-20 23:59:55,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619969393] [2022-02-20 23:59:55,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:59:55,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) Word has length 25 [2022-02-20 23:59:55,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:55,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 23:59:55,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:55,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:59:55,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:55,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:59:55,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:59:55,879 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 23:59:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:55,995 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2022-02-20 23:59:55,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:59:55,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) Word has length 25 [2022-02-20 23:59:55,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 23:59:55,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-02-20 23:59:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 23:59:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-02-20 23:59:55,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 113 transitions. [2022-02-20 23:59:56,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:56,094 INFO L225 Difference]: With dead ends: 117 [2022-02-20 23:59:56,094 INFO L226 Difference]: Without dead ends: 117 [2022-02-20 23:59:56,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:59:56,095 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 142 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 127 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 23:59:56,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 127 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:59:56,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-02-20 23:59:56,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 75. [2022-02-20 23:59:56,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:56,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 75 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 74 states have internal predecessors, (78), 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 23:59:56,098 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 75 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 74 states have internal predecessors, (78), 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 23:59:56,098 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 75 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 74 states have internal predecessors, (78), 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 23:59:56,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:56,101 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2022-02-20 23:59:56,101 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2022-02-20 23:59:56,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:56,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:56,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 74 states have internal predecessors, (78), 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 117 states. [2022-02-20 23:59:56,102 INFO L87 Difference]: Start difference. First operand has 75 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 74 states have internal predecessors, (78), 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 117 states. [2022-02-20 23:59:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:56,105 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2022-02-20 23:59:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2022-02-20 23:59:56,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:56,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:56,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:56,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:56,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 74 states have internal predecessors, (78), 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 23:59:56,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-02-20 23:59:56,107 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 25 [2022-02-20 23:59:56,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:56,107 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-02-20 23:59:56,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 23:59:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-02-20 23:59:56,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:59:56,108 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:56,108 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:56,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:59:56,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-02-20 23:59:56,332 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:59:56,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:56,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1731307113, now seen corresponding path program 1 times [2022-02-20 23:59:56,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:56,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717117691] [2022-02-20 23:59:56,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:56,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:56,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {2844#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(27, 2); {2844#true} is VALID [2022-02-20 23:59:56,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {2844#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {2847#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:56,442 INFO L290 TraceCheckUtils]: 3: Hoare triple {2847#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {2847#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:56,443 INFO L290 TraceCheckUtils]: 4: Hoare triple {2847#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {2847#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:56,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {2847#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {2847#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 23:59:56,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {2847#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {2848#(or (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:56,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {2848#(or (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {2848#(or (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 23:59:56,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {2848#(or (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(sll_create_~len#1 > 0); {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {2849#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1)} is VALID [2022-02-20 23:59:56,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {2849#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1)} assume !(1 == #valid[sll_remove_last_~head#1.base]); {2845#false} is VALID [2022-02-20 23:59:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 23:59:56,452 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:56,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717117691] [2022-02-20 23:59:56,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717117691] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:56,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206227243] [2022-02-20 23:59:56,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:56,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:56,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:56,455 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:59:56,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 23:59:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:56,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:59:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:56,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:56,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:59:56,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:56,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:59:56,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:56,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:59:56,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {2844#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(27, 2); {2844#true} is VALID [2022-02-20 23:59:56,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {2844#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} is VALID [2022-02-20 23:59:56,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} is VALID [2022-02-20 23:59:56,890 INFO L290 TraceCheckUtils]: 3: Hoare triple {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} is VALID [2022-02-20 23:59:56,891 INFO L290 TraceCheckUtils]: 4: Hoare triple {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} is VALID [2022-02-20 23:59:56,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} is VALID [2022-02-20 23:59:56,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} is VALID [2022-02-20 23:59:56,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} is VALID [2022-02-20 23:59:56,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} is VALID [2022-02-20 23:59:56,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} is VALID [2022-02-20 23:59:56,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} is VALID [2022-02-20 23:59:56,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {2856#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(sll_create_~len#1 > 0); {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:56,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {2849#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1)} is VALID [2022-02-20 23:59:56,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {2849#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1)} assume !(1 == #valid[sll_remove_last_~head#1.base]); {2845#false} is VALID [2022-02-20 23:59:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:59:56,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:59:57,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {2849#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1)} assume !(1 == #valid[sll_remove_last_~head#1.base]); {2845#false} is VALID [2022-02-20 23:59:57,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {2849#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1)} is VALID [2022-02-20 23:59:57,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:57,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:57,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(sll_create_~len#1 > 0); {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:57,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:57,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:57,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:57,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:57,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:57,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:57,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:57,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:58,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {2846#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-20 23:59:58,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} is VALID [2022-02-20 23:59:58,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} is VALID [2022-02-20 23:59:58,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} is VALID [2022-02-20 23:59:58,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} is VALID [2022-02-20 23:59:58,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} is VALID [2022-02-20 23:59:58,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} is VALID [2022-02-20 23:59:58,010 INFO L290 TraceCheckUtils]: 4: Hoare triple {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} is VALID [2022-02-20 23:59:58,011 INFO L290 TraceCheckUtils]: 3: Hoare triple {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} is VALID [2022-02-20 23:59:58,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} is VALID [2022-02-20 23:59:58,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {2844#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2965#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_13| Int) (v_ArrVal_257 Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_13| |#StackHeapBarrier|)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_13| v_ArrVal_257) |ULTIMATE.start_main_~#s~0#1.base|) 1)))} is VALID [2022-02-20 23:59:58,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {2844#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(27, 2); {2844#true} is VALID [2022-02-20 23:59:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:59:58,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206227243] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:59:58,016 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:59:58,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-02-20 23:59:58,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067269171] [2022-02-20 23:59:58,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:59:58,017 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 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) Word has length 25 [2022-02-20 23:59:58,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:59:58,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 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 23:59:58,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:58,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:59:58,062 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:59:58,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:59:58,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:59:58,063 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 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 23:59:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:58,382 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2022-02-20 23:59:58,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:59:58,382 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 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) Word has length 25 [2022-02-20 23:59:58,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:59:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 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 23:59:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2022-02-20 23:59:58,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 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 23:59:58,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2022-02-20 23:59:58,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 118 transitions. [2022-02-20 23:59:58,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:59:58,473 INFO L225 Difference]: With dead ends: 116 [2022-02-20 23:59:58,473 INFO L226 Difference]: Without dead ends: 116 [2022-02-20 23:59:58,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:59:58,473 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 199 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:59:58,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 113 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 110 Invalid, 0 Unknown, 32 Unchecked, 0.1s Time] [2022-02-20 23:59:58,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-02-20 23:59:58,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 74. [2022-02-20 23:59:58,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:59:58,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 74 states, 50 states have (on average 1.56) internal successors, (78), 73 states have internal predecessors, (78), 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 23:59:58,476 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 74 states, 50 states have (on average 1.56) internal successors, (78), 73 states have internal predecessors, (78), 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 23:59:58,477 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 74 states, 50 states have (on average 1.56) internal successors, (78), 73 states have internal predecessors, (78), 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 23:59:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:58,479 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2022-02-20 23:59:58,479 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2022-02-20 23:59:58,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:58,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:58,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 50 states have (on average 1.56) internal successors, (78), 73 states have internal predecessors, (78), 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 116 states. [2022-02-20 23:59:58,479 INFO L87 Difference]: Start difference. First operand has 74 states, 50 states have (on average 1.56) internal successors, (78), 73 states have internal predecessors, (78), 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 116 states. [2022-02-20 23:59:58,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:59:58,482 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2022-02-20 23:59:58,482 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2022-02-20 23:59:58,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:59:58,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:59:58,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:59:58,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:59:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.56) internal successors, (78), 73 states have internal predecessors, (78), 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 23:59:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-02-20 23:59:58,484 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 25 [2022-02-20 23:59:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:59:58,485 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-02-20 23:59:58,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 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 23:59:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-02-20 23:59:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:59:58,485 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:59:58,486 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:59:58,508 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 23:59:58,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:58,703 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-20 23:59:58,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:59:58,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1731307114, now seen corresponding path program 1 times [2022-02-20 23:59:58,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:59:58,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848526358] [2022-02-20 23:59:58,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:58,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:59:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:58,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {3426#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(27, 2); {3426#true} is VALID [2022-02-20 23:59:58,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {3426#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {3428#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {3428#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {3429#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {3429#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {3429#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {3429#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {3429#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {3429#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {3429#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {3429#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {3431#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {3431#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {3431#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {3431#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {3431#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {3431#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {3431#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {3431#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(sll_create_~len#1 > 0); {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:58,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {3433#(and (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_sll_remove_last_~head#1.base|)))} is VALID [2022-02-20 23:59:58,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {3433#(and (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_sll_remove_last_~head#1.base|)))} assume !(4 + sll_remove_last_~head#1.offset <= #length[sll_remove_last_~head#1.base] && 0 <= sll_remove_last_~head#1.offset); {3427#false} is VALID [2022-02-20 23:59:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:59:58,900 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:59:58,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848526358] [2022-02-20 23:59:58,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848526358] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:59:58,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956666135] [2022-02-20 23:59:58,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:59:58,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:59:58,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:59:58,904 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:59:58,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 23:59:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:59,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:59:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:59:59,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:59:59,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:59:59,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:59,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:59:59,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:59:59,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:59:59,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {3426#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(27, 2); {3426#true} is VALID [2022-02-20 23:59:59,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {3426#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,419 INFO L290 TraceCheckUtils]: 4: Hoare triple {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {3430#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(sll_create_~len#1 > 0); {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 23:59:59,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {3432#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {3433#(and (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_sll_remove_last_~head#1.base|)))} is VALID [2022-02-20 23:59:59,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {3433#(and (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_sll_remove_last_~head#1.base|)))} assume !(4 + sll_remove_last_~head#1.offset <= #length[sll_remove_last_~head#1.base] && 0 <= sll_remove_last_~head#1.offset); {3427#false} is VALID [2022-02-20 23:59:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:59:59,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:00:01,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {3509#(and (<= (+ |ULTIMATE.start_sll_remove_last_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_remove_last_~head#1.base|)) (<= 0 |ULTIMATE.start_sll_remove_last_~head#1.offset|))} assume !(4 + sll_remove_last_~head#1.offset <= #length[sll_remove_last_~head#1.base] && 0 <= sll_remove_last_~head#1.offset); {3427#false} is VALID [2022-02-21 00:00:01,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {3509#(and (<= (+ |ULTIMATE.start_sll_remove_last_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_remove_last_~head#1.base|)) (<= 0 |ULTIMATE.start_sll_remove_last_~head#1.offset|))} is VALID [2022-02-21 00:00:01,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-21 00:00:01,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-21 00:00:01,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} assume !(sll_create_~len#1 > 0); {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-21 00:00:01,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-21 00:00:01,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-21 00:00:01,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-21 00:00:01,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-21 00:00:01,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-21 00:00:01,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-21 00:00:01,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-21 00:00:01,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-21 00:00:01,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {3513#(and (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-21 00:00:01,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} is VALID [2022-02-21 00:00:01,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} is VALID [2022-02-21 00:00:01,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} is VALID [2022-02-21 00:00:01,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} is VALID [2022-02-21 00:00:01,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} is VALID [2022-02-21 00:00:01,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} is VALID [2022-02-21 00:00:01,227 INFO L290 TraceCheckUtils]: 4: Hoare triple {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} is VALID [2022-02-21 00:00:01,228 INFO L290 TraceCheckUtils]: 3: Hoare triple {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} is VALID [2022-02-21 00:00:01,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} is VALID [2022-02-21 00:00:01,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {3426#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {3550#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_15| Int)) (or (not (< |v_ULTIMATE.start_node_create_~temp~0#1.base_15| |#StackHeapBarrier|)) (and (forall ((v_ArrVal_344 Int)) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_15| v_ArrVal_344) |ULTIMATE.start_main_~#s~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))))} is VALID [2022-02-21 00:00:01,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {3426#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(27, 2); {3426#true} is VALID [2022-02-21 00:00:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 00:00:01,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956666135] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:00:01,235 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:00:01,235 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2022-02-21 00:00:01,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671608874] [2022-02-21 00:00:01,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:00:01,236 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 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) Word has length 25 [2022-02-21 00:00:01,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:01,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 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-21 00:00:01,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:01,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-21 00:00:01,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:00:01,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-21 00:00:01,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-21 00:00:01,327 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 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-21 00:00:01,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:01,738 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-02-21 00:00:01,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 00:00:01,738 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 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) Word has length 25 [2022-02-21 00:00:01,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:01,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 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-21 00:00:01,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-02-21 00:00:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 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-21 00:00:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-02-21 00:00:01,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 103 transitions. [2022-02-21 00:00:01,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:01,846 INFO L225 Difference]: With dead ends: 99 [2022-02-21 00:00:01,846 INFO L226 Difference]: Without dead ends: 99 [2022-02-21 00:00:01,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2022-02-21 00:00:01,847 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 364 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:01,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 49 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 00:00:01,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-21 00:00:01,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 69. [2022-02-21 00:00:01,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:01,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 69 states, 50 states have (on average 1.44) internal successors, (72), 68 states have internal predecessors, (72), 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-21 00:00:01,850 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 69 states, 50 states have (on average 1.44) internal successors, (72), 68 states have internal predecessors, (72), 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-21 00:00:01,850 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 69 states, 50 states have (on average 1.44) internal successors, (72), 68 states have internal predecessors, (72), 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-21 00:00:01,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:01,852 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-02-21 00:00:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-02-21 00:00:01,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:01,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:01,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 50 states have (on average 1.44) internal successors, (72), 68 states have internal predecessors, (72), 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 99 states. [2022-02-21 00:00:01,853 INFO L87 Difference]: Start difference. First operand has 69 states, 50 states have (on average 1.44) internal successors, (72), 68 states have internal predecessors, (72), 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 99 states. [2022-02-21 00:00:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:01,855 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-02-21 00:00:01,855 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-02-21 00:00:01,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:01,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:01,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:01,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:01,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.44) internal successors, (72), 68 states have internal predecessors, (72), 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-21 00:00:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2022-02-21 00:00:01,857 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 25 [2022-02-21 00:00:01,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:01,857 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2022-02-21 00:00:01,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 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-21 00:00:01,858 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-02-21 00:00:01,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 00:00:01,858 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:01,858 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:00:01,887 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-21 00:00:02,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:00:02,082 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-21 00:00:02,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:02,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2130912971, now seen corresponding path program 1 times [2022-02-21 00:00:02,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:02,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631286305] [2022-02-21 00:00:02,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:02,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:02,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {3955#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(27, 2); {3955#true} is VALID [2022-02-21 00:00:02,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {3955#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {3955#true} is VALID [2022-02-21 00:00:02,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {3955#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {3955#true} is VALID [2022-02-21 00:00:02,206 INFO L290 TraceCheckUtils]: 3: Hoare triple {3955#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {3955#true} is VALID [2022-02-21 00:00:02,206 INFO L290 TraceCheckUtils]: 4: Hoare triple {3955#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {3955#true} is VALID [2022-02-21 00:00:02,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {3955#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {3955#true} is VALID [2022-02-21 00:00:02,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {3955#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {3955#true} is VALID [2022-02-21 00:00:02,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {3955#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {3955#true} is VALID [2022-02-21 00:00:02,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {3955#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {3955#true} is VALID [2022-02-21 00:00:02,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {3955#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {3955#true} is VALID [2022-02-21 00:00:02,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {3955#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {3955#true} is VALID [2022-02-21 00:00:02,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {3955#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {3955#true} is VALID [2022-02-21 00:00:02,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {3955#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {3955#true} is VALID [2022-02-21 00:00:02,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {3955#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {3957#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} is VALID [2022-02-21 00:00:02,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {3957#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {3957#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} is VALID [2022-02-21 00:00:02,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {3957#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {3958#(= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1)} is VALID [2022-02-21 00:00:02,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {3958#(= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {3959#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-21 00:00:02,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {3959#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {3959#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-21 00:00:02,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {3959#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {3960#(= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)} is VALID [2022-02-21 00:00:02,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {3960#(= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {3960#(= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)} is VALID [2022-02-21 00:00:02,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {3960#(= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)} assume !(sll_create_~len#1 > 0); {3960#(= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)} is VALID [2022-02-21 00:00:02,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {3960#(= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {3961#(= (select |#valid| |ULTIMATE.start_sll_create_#res#1.base|) 1)} is VALID [2022-02-21 00:00:02,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {3961#(= (select |#valid| |ULTIMATE.start_sll_create_#res#1.base|) 1)} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {3962#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 1)} is VALID [2022-02-21 00:00:02,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {3962#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 1)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {3963#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-21 00:00:02,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {3963#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 1)} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {3964#(= (select |#valid| |ULTIMATE.start_sll_remove_last_#t~mem6#1.base|) 1)} is VALID [2022-02-21 00:00:02,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {3964#(= (select |#valid| |ULTIMATE.start_sll_remove_last_#t~mem6#1.base|) 1)} assume !(1 == #valid[sll_remove_last_#t~mem6#1.base]); {3956#false} is VALID [2022-02-21 00:00:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 00:00:02,215 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:00:02,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631286305] [2022-02-21 00:00:02,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631286305] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:00:02,215 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:00:02,215 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-21 00:00:02,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797924208] [2022-02-21 00:00:02,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:00:02,216 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 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) Word has length 26 [2022-02-21 00:00:02,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:02,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 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-21 00:00:02,234 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-21 00:00:02,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-21 00:00:02,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:00:02,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 00:00:02,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-21 00:00:02,236 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 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-21 00:00:02,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:02,900 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-02-21 00:00:02,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 00:00:02,900 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 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) Word has length 26 [2022-02-21 00:00:02,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:02,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 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-21 00:00:02,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 102 transitions. [2022-02-21 00:00:02,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 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-21 00:00:02,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 102 transitions. [2022-02-21 00:00:02,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 102 transitions. [2022-02-21 00:00:02,983 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-21 00:00:02,984 INFO L225 Difference]: With dead ends: 98 [2022-02-21 00:00:02,984 INFO L226 Difference]: Without dead ends: 98 [2022-02-21 00:00:02,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-02-21 00:00:02,985 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 234 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:02,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 229 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 00:00:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-02-21 00:00:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 70. [2022-02-21 00:00:02,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:02,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 70 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 69 states have internal predecessors, (74), 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-21 00:00:02,988 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 70 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 69 states have internal predecessors, (74), 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-21 00:00:02,988 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 70 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 69 states have internal predecessors, (74), 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-21 00:00:02,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:02,990 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-02-21 00:00:02,990 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2022-02-21 00:00:02,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:02,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:02,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 69 states have internal predecessors, (74), 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 98 states. [2022-02-21 00:00:02,991 INFO L87 Difference]: Start difference. First operand has 70 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 69 states have internal predecessors, (74), 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 98 states. [2022-02-21 00:00:02,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:02,992 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2022-02-21 00:00:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2022-02-21 00:00:02,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:02,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:02,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:02,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 69 states have internal predecessors, (74), 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-21 00:00:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-02-21 00:00:02,994 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 26 [2022-02-21 00:00:02,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:02,995 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-02-21 00:00:02,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 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-21 00:00:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-02-21 00:00:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 00:00:02,996 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:02,996 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:00:02,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-21 00:00:02,996 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-21 00:00:02,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:02,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2130912972, now seen corresponding path program 1 times [2022-02-21 00:00:02,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:02,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281732917] [2022-02-21 00:00:02,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:02,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:03,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {4348#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(27, 2); {4348#true} is VALID [2022-02-21 00:00:03,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {4348#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {4348#true} is VALID [2022-02-21 00:00:03,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {4348#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {4348#true} is VALID [2022-02-21 00:00:03,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {4348#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {4348#true} is VALID [2022-02-21 00:00:03,152 INFO L290 TraceCheckUtils]: 4: Hoare triple {4348#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {4348#true} is VALID [2022-02-21 00:00:03,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {4348#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {4348#true} is VALID [2022-02-21 00:00:03,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {4348#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {4348#true} is VALID [2022-02-21 00:00:03,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {4348#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {4348#true} is VALID [2022-02-21 00:00:03,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {4348#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {4348#true} is VALID [2022-02-21 00:00:03,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {4348#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {4348#true} is VALID [2022-02-21 00:00:03,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {4348#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {4348#true} is VALID [2022-02-21 00:00:03,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {4348#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {4350#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:03,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {4350#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {4350#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:03,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {4350#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {4350#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:03,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {4350#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {4350#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:03,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {4350#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {4351#(and (= 8 (select |#length| |ULTIMATE.start_node_create_#res#1.base|)) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} is VALID [2022-02-21 00:00:03,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {4351#(and (= 8 (select |#length| |ULTIMATE.start_node_create_#res#1.base|)) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {4352#(and (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-21 00:00:03,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {4352#(and (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {4352#(and (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-21 00:00:03,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {4352#(and (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {4353#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:03,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {4353#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {4353#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:03,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {4353#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} assume !(sll_create_~len#1 > 0); {4353#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:03,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {4353#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {4354#(and (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_create_#res#1.base|) 8))} is VALID [2022-02-21 00:00:03,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {4354#(and (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_create_#res#1.base|) 8))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {4355#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8))} is VALID [2022-02-21 00:00:03,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {4355#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {4356#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 8))} is VALID [2022-02-21 00:00:03,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {4356#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 8))} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {4357#(and (= (+ (select |#length| |ULTIMATE.start_sll_remove_last_#t~mem6#1.base|) (- 8)) 0) (= |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| 0))} is VALID [2022-02-21 00:00:03,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {4357#(and (= (+ (select |#length| |ULTIMATE.start_sll_remove_last_#t~mem6#1.base|) (- 8)) 0) (= |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| 0))} assume !(4 + (4 + sll_remove_last_#t~mem6#1.offset) <= #length[sll_remove_last_#t~mem6#1.base] && 0 <= 4 + sll_remove_last_#t~mem6#1.offset); {4349#false} is VALID [2022-02-21 00:00:03,161 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 00:00:03,161 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:00:03,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281732917] [2022-02-21 00:00:03,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281732917] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:00:03,161 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:00:03,161 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-21 00:00:03,161 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886213851] [2022-02-21 00:00:03,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:00:03,162 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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) Word has length 26 [2022-02-21 00:00:03,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:03,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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-21 00:00:03,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:03,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-21 00:00:03,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:00:03,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 00:00:03,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-21 00:00:03,182 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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-21 00:00:04,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:04,047 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-02-21 00:00:04,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 00:00:04,047 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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) Word has length 26 [2022-02-21 00:00:04,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:04,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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-21 00:00:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2022-02-21 00:00:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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-21 00:00:04,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 97 transitions. [2022-02-21 00:00:04,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 97 transitions. [2022-02-21 00:00:04,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:04,159 INFO L225 Difference]: With dead ends: 93 [2022-02-21 00:00:04,159 INFO L226 Difference]: Without dead ends: 93 [2022-02-21 00:00:04,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-02-21 00:00:04,160 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 444 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:04,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [444 Valid, 132 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 00:00:04,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-21 00:00:04,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 70. [2022-02-21 00:00:04,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:04,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 70 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 69 states have internal predecessors, (73), 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-21 00:00:04,163 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 70 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 69 states have internal predecessors, (73), 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-21 00:00:04,163 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 70 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 69 states have internal predecessors, (73), 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-21 00:00:04,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:04,164 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-02-21 00:00:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-02-21 00:00:04,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:04,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:04,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 69 states have internal predecessors, (73), 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 93 states. [2022-02-21 00:00:04,165 INFO L87 Difference]: Start difference. First operand has 70 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 69 states have internal predecessors, (73), 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 93 states. [2022-02-21 00:00:04,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:04,166 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-02-21 00:00:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-02-21 00:00:04,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:04,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:04,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:04,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:04,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 69 states have internal predecessors, (73), 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-21 00:00:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-02-21 00:00:04,168 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 26 [2022-02-21 00:00:04,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:04,168 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-02-21 00:00:04,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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-21 00:00:04,178 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-02-21 00:00:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-21 00:00:04,180 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:04,180 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] [2022-02-21 00:00:04,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-21 00:00:04,181 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-21 00:00:04,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:04,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1883258256, now seen corresponding path program 1 times [2022-02-21 00:00:04,181 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:04,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310220837] [2022-02-21 00:00:04,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:04,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:04,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {4726#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(27, 2); {4726#true} is VALID [2022-02-21 00:00:04,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {4726#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {4726#true} is VALID [2022-02-21 00:00:04,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {4726#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {4726#true} is VALID [2022-02-21 00:00:04,289 INFO L290 TraceCheckUtils]: 3: Hoare triple {4726#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {4726#true} is VALID [2022-02-21 00:00:04,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {4726#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {4726#true} is VALID [2022-02-21 00:00:04,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {4726#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {4726#true} is VALID [2022-02-21 00:00:04,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {4726#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {4726#true} is VALID [2022-02-21 00:00:04,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {4726#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {4726#true} is VALID [2022-02-21 00:00:04,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {4726#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {4726#true} is VALID [2022-02-21 00:00:04,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {4726#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {4726#true} is VALID [2022-02-21 00:00:04,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {4726#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {4726#true} is VALID [2022-02-21 00:00:04,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {4726#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {4728#(= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)} is VALID [2022-02-21 00:00:04,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {4728#(= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {4728#(= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)} is VALID [2022-02-21 00:00:04,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {4728#(= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {4728#(= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)} is VALID [2022-02-21 00:00:04,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {4728#(= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {4728#(= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)} is VALID [2022-02-21 00:00:04,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {4728#(= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {4729#(= |ULTIMATE.start_node_create_#res#1.offset| 0)} is VALID [2022-02-21 00:00:04,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {4729#(= |ULTIMATE.start_node_create_#res#1.offset| 0)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {4730#(= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-21 00:00:04,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {4730#(= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {4730#(= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0)} is VALID [2022-02-21 00:00:04,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {4730#(= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {4731#(= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)} is VALID [2022-02-21 00:00:04,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {4731#(= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {4731#(= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)} is VALID [2022-02-21 00:00:04,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {4731#(= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)} assume !(sll_create_~len#1 > 0); {4731#(= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)} is VALID [2022-02-21 00:00:04,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {4731#(= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {4732#(= |ULTIMATE.start_sll_create_#res#1.offset| 0)} is VALID [2022-02-21 00:00:04,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {4732#(= |ULTIMATE.start_sll_create_#res#1.offset| 0)} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {4733#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)} is VALID [2022-02-21 00:00:04,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {4733#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {4734#(= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))} is VALID [2022-02-21 00:00:04,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {4734#(= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {4734#(= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))} is VALID [2022-02-21 00:00:04,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {4734#(= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {4734#(= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))} is VALID [2022-02-21 00:00:04,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {4734#(= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))} assume 0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset; {4734#(= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))} is VALID [2022-02-21 00:00:04,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {4734#(= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))} SUMMARY for call sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L594 {4735#(= |ULTIMATE.start_sll_remove_last_#t~mem8#1.offset| 0)} is VALID [2022-02-21 00:00:04,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {4735#(= |ULTIMATE.start_sll_remove_last_#t~mem8#1.offset| 0)} assume !(0 == sll_remove_last_#t~mem8#1.offset); {4727#false} is VALID [2022-02-21 00:00:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 00:00:04,297 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:00:04,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310220837] [2022-02-21 00:00:04,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310220837] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:00:04,298 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:00:04,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-21 00:00:04,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282035849] [2022-02-21 00:00:04,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:00:04,301 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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) Word has length 29 [2022-02-21 00:00:04,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:04,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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-21 00:00:04,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:04,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-21 00:00:04,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:00:04,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 00:00:04,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-21 00:00:04,324 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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-21 00:00:04,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:04,734 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-02-21 00:00:04,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 00:00:04,734 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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) Word has length 29 [2022-02-21 00:00:04,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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-21 00:00:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2022-02-21 00:00:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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-21 00:00:04,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2022-02-21 00:00:04,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 67 transitions. [2022-02-21 00:00:04,793 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-21 00:00:04,793 INFO L225 Difference]: With dead ends: 69 [2022-02-21 00:00:04,794 INFO L226 Difference]: Without dead ends: 69 [2022-02-21 00:00:04,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-02-21 00:00:04,795 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 325 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:04,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 92 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 00:00:04,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-21 00:00:04,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-02-21 00:00:04,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:04,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 51 states have (on average 1.411764705882353) internal successors, (72), 68 states have internal predecessors, (72), 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-21 00:00:04,797 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 51 states have (on average 1.411764705882353) internal successors, (72), 68 states have internal predecessors, (72), 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-21 00:00:04,797 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 51 states have (on average 1.411764705882353) internal successors, (72), 68 states have internal predecessors, (72), 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-21 00:00:04,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:04,799 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-02-21 00:00:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-02-21 00:00:04,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:04,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:04,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 51 states have (on average 1.411764705882353) internal successors, (72), 68 states have internal predecessors, (72), 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 69 states. [2022-02-21 00:00:04,800 INFO L87 Difference]: Start difference. First operand has 69 states, 51 states have (on average 1.411764705882353) internal successors, (72), 68 states have internal predecessors, (72), 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 69 states. [2022-02-21 00:00:04,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:04,801 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-02-21 00:00:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-02-21 00:00:04,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:04,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:04,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:04,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.411764705882353) internal successors, (72), 68 states have internal predecessors, (72), 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-21 00:00:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2022-02-21 00:00:04,803 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 29 [2022-02-21 00:00:04,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:04,803 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2022-02-21 00:00:04,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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-21 00:00:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-02-21 00:00:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-21 00:00:04,804 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:04,804 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] [2022-02-21 00:00:04,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-21 00:00:04,804 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-21 00:00:04,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:04,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1748967250, now seen corresponding path program 1 times [2022-02-21 00:00:04,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:04,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377080257] [2022-02-21 00:00:04,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:04,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:05,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {5033#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(27, 2); {5033#true} is VALID [2022-02-21 00:00:05,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {5033#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {5033#true} is VALID [2022-02-21 00:00:05,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {5033#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {5033#true} is VALID [2022-02-21 00:00:05,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {5033#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {5033#true} is VALID [2022-02-21 00:00:05,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {5033#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {5033#true} is VALID [2022-02-21 00:00:05,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {5033#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {5033#true} is VALID [2022-02-21 00:00:05,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {5033#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {5033#true} is VALID [2022-02-21 00:00:05,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {5033#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {5033#true} is VALID [2022-02-21 00:00:05,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {5033#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {5033#true} is VALID [2022-02-21 00:00:05,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {5033#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {5033#true} is VALID [2022-02-21 00:00:05,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {5033#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {5033#true} is VALID [2022-02-21 00:00:05,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {5033#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {5035#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:05,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {5035#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {5035#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:05,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {5035#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {5035#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:05,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {5035#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {5035#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:05,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {5035#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {5036#(and (= 8 (select |#length| |ULTIMATE.start_node_create_#res#1.base|)) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} is VALID [2022-02-21 00:00:05,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {5036#(and (= 8 (select |#length| |ULTIMATE.start_node_create_#res#1.base|)) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {5037#(and (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-21 00:00:05,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {5037#(and (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {5037#(and (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-21 00:00:05,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {5037#(and (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {5038#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:05,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {5038#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {5038#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:05,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {5038#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} assume !(sll_create_~len#1 > 0); {5038#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:05,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {5038#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {5039#(and (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_create_#res#1.base|) 8))} is VALID [2022-02-21 00:00:05,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {5039#(and (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_create_#res#1.base|) 8))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {5040#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8))} is VALID [2022-02-21 00:00:05,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {5040#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {5041#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 8))} is VALID [2022-02-21 00:00:05,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {5041#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 8))} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {5042#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 8) (= |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| 0))} is VALID [2022-02-21 00:00:05,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {5042#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 8) (= |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| 0))} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {5041#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 8))} is VALID [2022-02-21 00:00:05,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {5041#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 8))} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {5041#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 8))} is VALID [2022-02-21 00:00:05,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {5041#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 8))} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {5043#(and (= (select |#length| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 8) (<= 0 |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset|) (<= |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 0))} is VALID [2022-02-21 00:00:05,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {5043#(and (= (select |#length| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 8) (<= 0 |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset|) (<= |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 0))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {5044#(and (= (+ (select |#length| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (- 8)) 0) (<= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_remove_last_~last~0#1.offset|))} is VALID [2022-02-21 00:00:05,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {5044#(and (= (+ (select |#length| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (- 8)) 0) (<= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_remove_last_~last~0#1.offset|))} assume !(4 + (4 + sll_remove_last_~last~0#1.offset) <= #length[sll_remove_last_~last~0#1.base] && 0 <= 4 + sll_remove_last_~last~0#1.offset); {5034#false} is VALID [2022-02-21 00:00:05,031 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 00:00:05,031 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:00:05,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377080257] [2022-02-21 00:00:05,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377080257] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:00:05,031 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:00:05,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-21 00:00:05,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550060429] [2022-02-21 00:00:05,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:00:05,032 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 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) Word has length 30 [2022-02-21 00:00:05,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:05,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 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-21 00:00:05,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:05,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 00:00:05,062 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:00:05,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 00:00:05,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-02-21 00:00:05,063 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 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-21 00:00:06,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:06,219 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-02-21 00:00:06,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-21 00:00:06,219 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 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) Word has length 30 [2022-02-21 00:00:06,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 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-21 00:00:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 122 transitions. [2022-02-21 00:00:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 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-21 00:00:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 122 transitions. [2022-02-21 00:00:06,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 122 transitions. [2022-02-21 00:00:06,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:06,349 INFO L225 Difference]: With dead ends: 115 [2022-02-21 00:00:06,349 INFO L226 Difference]: Without dead ends: 115 [2022-02-21 00:00:06,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2022-02-21 00:00:06,350 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 533 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:06,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [533 Valid, 163 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 00:00:06,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-21 00:00:06,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 77. [2022-02-21 00:00:06,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:06,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 77 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 76 states have internal predecessors, (86), 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-21 00:00:06,353 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 77 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 76 states have internal predecessors, (86), 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-21 00:00:06,353 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 77 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 76 states have internal predecessors, (86), 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-21 00:00:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:06,355 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-02-21 00:00:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2022-02-21 00:00:06,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:06,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:06,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 76 states have internal predecessors, (86), 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 115 states. [2022-02-21 00:00:06,356 INFO L87 Difference]: Start difference. First operand has 77 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 76 states have internal predecessors, (86), 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 115 states. [2022-02-21 00:00:06,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:06,358 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-02-21 00:00:06,358 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2022-02-21 00:00:06,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:06,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:06,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:06,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 76 states have internal predecessors, (86), 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-21 00:00:06,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-02-21 00:00:06,360 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 30 [2022-02-21 00:00:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:06,360 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-02-21 00:00:06,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 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-21 00:00:06,360 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-02-21 00:00:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-21 00:00:06,361 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:06,361 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] [2022-02-21 00:00:06,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-21 00:00:06,361 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-21 00:00:06,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:06,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1748967249, now seen corresponding path program 1 times [2022-02-21 00:00:06,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:06,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677403798] [2022-02-21 00:00:06,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:06,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:06,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {5492#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(27, 2); {5492#true} is VALID [2022-02-21 00:00:06,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {5492#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {5492#true} is VALID [2022-02-21 00:00:06,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {5492#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {5492#true} is VALID [2022-02-21 00:00:06,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {5492#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {5492#true} is VALID [2022-02-21 00:00:06,446 INFO L290 TraceCheckUtils]: 4: Hoare triple {5492#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {5492#true} is VALID [2022-02-21 00:00:06,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {5492#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {5492#true} is VALID [2022-02-21 00:00:06,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {5492#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {5492#true} is VALID [2022-02-21 00:00:06,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {5492#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {5492#true} is VALID [2022-02-21 00:00:06,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {5492#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {5492#true} is VALID [2022-02-21 00:00:06,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {5492#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {5492#true} is VALID [2022-02-21 00:00:06,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {5492#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {5492#true} is VALID [2022-02-21 00:00:06,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {5492#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {5492#true} is VALID [2022-02-21 00:00:06,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {5492#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {5492#true} is VALID [2022-02-21 00:00:06,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {5492#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {5492#true} is VALID [2022-02-21 00:00:06,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {5492#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {5492#true} is VALID [2022-02-21 00:00:06,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {5492#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {5492#true} is VALID [2022-02-21 00:00:06,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {5492#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {5492#true} is VALID [2022-02-21 00:00:06,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {5492#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {5492#true} is VALID [2022-02-21 00:00:06,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {5492#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {5492#true} is VALID [2022-02-21 00:00:06,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {5492#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {5492#true} is VALID [2022-02-21 00:00:06,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {5492#true} assume !(sll_create_~len#1 > 0); {5492#true} is VALID [2022-02-21 00:00:06,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {5492#true} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {5492#true} is VALID [2022-02-21 00:00:06,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {5492#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {5492#true} is VALID [2022-02-21 00:00:06,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {5492#true} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {5492#true} is VALID [2022-02-21 00:00:06,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {5492#true} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {5494#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) |ULTIMATE.start_sll_remove_last_#t~mem6#1.base|)} is VALID [2022-02-21 00:00:06,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {5494#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) |ULTIMATE.start_sll_remove_last_#t~mem6#1.base|)} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {5495#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-21 00:00:06,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {5495#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 1)} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {5495#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-21 00:00:06,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {5495#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 1)} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {5496#(= (select |#valid| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 1)} is VALID [2022-02-21 00:00:06,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {5496#(= (select |#valid| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 1)} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {5497#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 1)} is VALID [2022-02-21 00:00:06,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {5497#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 1)} assume !(1 == #valid[sll_remove_last_~last~0#1.base]); {5493#false} is VALID [2022-02-21 00:00:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 00:00:06,453 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:00:06,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677403798] [2022-02-21 00:00:06,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677403798] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:00:06,453 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:00:06,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 00:00:06,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416343407] [2022-02-21 00:00:06,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:00:06,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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) Word has length 30 [2022-02-21 00:00:06,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:06,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-21 00:00:06,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:06,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 00:00:06,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:00:06,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 00:00:06,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 00:00:06,470 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-21 00:00:06,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:06,690 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-02-21 00:00:06,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 00:00:06,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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) Word has length 30 [2022-02-21 00:00:06,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-21 00:00:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-02-21 00:00:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-21 00:00:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-02-21 00:00:06,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-02-21 00:00:06,746 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-21 00:00:06,747 INFO L225 Difference]: With dead ends: 77 [2022-02-21 00:00:06,747 INFO L226 Difference]: Without dead ends: 77 [2022-02-21 00:00:06,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-21 00:00:06,748 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 33 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:06,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 122 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 00:00:06,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-21 00:00:06,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2022-02-21 00:00:06,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:06,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 76 states, 60 states have (on average 1.4) internal successors, (84), 75 states have internal predecessors, (84), 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-21 00:00:06,750 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 76 states, 60 states have (on average 1.4) internal successors, (84), 75 states have internal predecessors, (84), 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-21 00:00:06,751 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 76 states, 60 states have (on average 1.4) internal successors, (84), 75 states have internal predecessors, (84), 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-21 00:00:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:06,752 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-02-21 00:00:06,752 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-02-21 00:00:06,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:06,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:06,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 60 states have (on average 1.4) internal successors, (84), 75 states have internal predecessors, (84), 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 77 states. [2022-02-21 00:00:06,753 INFO L87 Difference]: Start difference. First operand has 76 states, 60 states have (on average 1.4) internal successors, (84), 75 states have internal predecessors, (84), 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 77 states. [2022-02-21 00:00:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:06,754 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-02-21 00:00:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-02-21 00:00:06,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:06,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:06,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:06,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:06,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.4) internal successors, (84), 75 states have internal predecessors, (84), 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-21 00:00:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2022-02-21 00:00:06,756 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 30 [2022-02-21 00:00:06,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:06,756 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2022-02-21 00:00:06,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-21 00:00:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-02-21 00:00:06,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-21 00:00:06,757 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:06,757 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] [2022-02-21 00:00:06,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-21 00:00:06,757 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-21 00:00:06,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:06,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1748536300, now seen corresponding path program 1 times [2022-02-21 00:00:06,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:06,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243888806] [2022-02-21 00:00:06,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:06,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:06,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {5813#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(27, 2); {5813#true} is VALID [2022-02-21 00:00:06,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {5813#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {5813#true} is VALID [2022-02-21 00:00:06,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {5813#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {5813#true} is VALID [2022-02-21 00:00:06,878 INFO L290 TraceCheckUtils]: 3: Hoare triple {5813#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {5813#true} is VALID [2022-02-21 00:00:06,878 INFO L290 TraceCheckUtils]: 4: Hoare triple {5813#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {5813#true} is VALID [2022-02-21 00:00:06,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {5813#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {5813#true} is VALID [2022-02-21 00:00:06,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {5813#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {5813#true} is VALID [2022-02-21 00:00:06,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {5813#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {5813#true} is VALID [2022-02-21 00:00:06,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {5813#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {5813#true} is VALID [2022-02-21 00:00:06,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {5813#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {5813#true} is VALID [2022-02-21 00:00:06,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {5813#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {5813#true} is VALID [2022-02-21 00:00:06,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {5813#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {5815#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:06,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {5815#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {5815#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:06,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {5815#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {5815#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:06,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {5815#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {5815#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:06,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {5815#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {5816#(<= (+ |ULTIMATE.start_node_create_#res#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:06,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {5816#(<= (+ |ULTIMATE.start_node_create_#res#1.base| 1) |#StackHeapBarrier|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {5817#(<= (+ |ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:06,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {5817#(<= (+ |ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {5817#(<= (+ |ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:06,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {5817#(<= (+ |ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {5818#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:06,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {5818#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {5818#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:06,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {5818#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} assume !(sll_create_~len#1 > 0); {5818#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:06,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {5818#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {5819#(<= (+ 1 |ULTIMATE.start_sll_create_#res#1.base|) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:06,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {5819#(<= (+ 1 |ULTIMATE.start_sll_create_#res#1.base|) |#StackHeapBarrier|)} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {5820#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:06,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {5820#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |#StackHeapBarrier|)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {5821#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:06,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {5821#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {5821#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:06,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {5821#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {5821#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:06,887 INFO L290 TraceCheckUtils]: 26: Hoare triple {5821#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) 1) |#StackHeapBarrier|)} assume 0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset; {5821#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:06,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {5821#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L594 {5822#(<= (+ |ULTIMATE.start_sll_remove_last_#t~mem8#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:06,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {5822#(<= (+ |ULTIMATE.start_sll_remove_last_#t~mem8#1.base| 1) |#StackHeapBarrier|)} assume 0 == sll_remove_last_#t~mem8#1.offset; {5822#(<= (+ |ULTIMATE.start_sll_remove_last_#t~mem8#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:06,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {5822#(<= (+ |ULTIMATE.start_sll_remove_last_#t~mem8#1.base| 1) |#StackHeapBarrier|)} assume !(sll_remove_last_#t~mem8#1.base < #StackHeapBarrier); {5814#false} is VALID [2022-02-21 00:00:06,889 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 00:00:06,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:00:06,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243888806] [2022-02-21 00:00:06,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243888806] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:00:06,890 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:00:06,890 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-21 00:00:06,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136252198] [2022-02-21 00:00:06,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:00:06,890 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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) Word has length 30 [2022-02-21 00:00:06,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:06,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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-21 00:00:06,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:06,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-21 00:00:06,919 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:00:06,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 00:00:06,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-21 00:00:06,920 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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-21 00:00:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:07,531 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-02-21 00:00:07,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 00:00:07,531 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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) Word has length 30 [2022-02-21 00:00:07,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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-21 00:00:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 91 transitions. [2022-02-21 00:00:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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-21 00:00:07,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 91 transitions. [2022-02-21 00:00:07,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 91 transitions. [2022-02-21 00:00:07,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:07,636 INFO L225 Difference]: With dead ends: 93 [2022-02-21 00:00:07,636 INFO L226 Difference]: Without dead ends: 93 [2022-02-21 00:00:07,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2022-02-21 00:00:07,636 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 395 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:07,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 117 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 00:00:07,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-21 00:00:07,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2022-02-21 00:00:07,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:07,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 79 states, 63 states have (on average 1.380952380952381) internal successors, (87), 78 states have internal predecessors, (87), 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-21 00:00:07,638 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 79 states, 63 states have (on average 1.380952380952381) internal successors, (87), 78 states have internal predecessors, (87), 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-21 00:00:07,638 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 79 states, 63 states have (on average 1.380952380952381) internal successors, (87), 78 states have internal predecessors, (87), 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-21 00:00:07,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:07,639 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-02-21 00:00:07,640 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2022-02-21 00:00:07,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:07,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:07,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 63 states have (on average 1.380952380952381) internal successors, (87), 78 states have internal predecessors, (87), 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 93 states. [2022-02-21 00:00:07,640 INFO L87 Difference]: Start difference. First operand has 79 states, 63 states have (on average 1.380952380952381) internal successors, (87), 78 states have internal predecessors, (87), 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 93 states. [2022-02-21 00:00:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:07,642 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-02-21 00:00:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2022-02-21 00:00:07,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:07,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:07,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:07,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:07,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.380952380952381) internal successors, (87), 78 states have internal predecessors, (87), 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-21 00:00:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2022-02-21 00:00:07,644 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 30 [2022-02-21 00:00:07,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:07,644 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2022-02-21 00:00:07,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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-21 00:00:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-02-21 00:00:07,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-21 00:00:07,645 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:07,645 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] [2022-02-21 00:00:07,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-21 00:00:07,645 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-21 00:00:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:07,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1629949454, now seen corresponding path program 1 times [2022-02-21 00:00:07,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:07,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918707232] [2022-02-21 00:00:07,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:07,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:07,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {6202#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(27, 2); {6202#true} is VALID [2022-02-21 00:00:07,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {6202#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {6202#true} is VALID [2022-02-21 00:00:07,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {6202#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {6202#true} is VALID [2022-02-21 00:00:07,718 INFO L290 TraceCheckUtils]: 3: Hoare triple {6202#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {6202#true} is VALID [2022-02-21 00:00:07,718 INFO L290 TraceCheckUtils]: 4: Hoare triple {6202#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {6202#true} is VALID [2022-02-21 00:00:07,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {6202#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {6202#true} is VALID [2022-02-21 00:00:07,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {6202#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {6202#true} is VALID [2022-02-21 00:00:07,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {6202#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {6202#true} is VALID [2022-02-21 00:00:07,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {6202#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {6202#true} is VALID [2022-02-21 00:00:07,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {6202#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {6202#true} is VALID [2022-02-21 00:00:07,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {6202#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {6202#true} is VALID [2022-02-21 00:00:07,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {6202#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {6202#true} is VALID [2022-02-21 00:00:07,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {6202#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {6202#true} is VALID [2022-02-21 00:00:07,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {6202#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {6202#true} is VALID [2022-02-21 00:00:07,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {6202#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {6202#true} is VALID [2022-02-21 00:00:07,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {6202#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {6202#true} is VALID [2022-02-21 00:00:07,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {6202#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {6202#true} is VALID [2022-02-21 00:00:07,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {6202#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {6202#true} is VALID [2022-02-21 00:00:07,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {6202#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {6202#true} is VALID [2022-02-21 00:00:07,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {6202#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {6202#true} is VALID [2022-02-21 00:00:07,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {6202#true} assume !(sll_create_~len#1 > 0); {6202#true} is VALID [2022-02-21 00:00:07,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {6202#true} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {6202#true} is VALID [2022-02-21 00:00:07,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {6202#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {6202#true} is VALID [2022-02-21 00:00:07,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {6202#true} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {6202#true} is VALID [2022-02-21 00:00:07,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {6202#true} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {6204#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) |ULTIMATE.start_sll_remove_last_#t~mem6#1.base|)} is VALID [2022-02-21 00:00:07,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {6204#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) |ULTIMATE.start_sll_remove_last_#t~mem6#1.base|)} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {6205#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-21 00:00:07,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {6205#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 1)} assume 0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset; {6205#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-21 00:00:07,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {6205#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 1)} SUMMARY for call sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L594 {6206#(= (select |#valid| |ULTIMATE.start_sll_remove_last_#t~mem8#1.base|) 1)} is VALID [2022-02-21 00:00:07,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {6206#(= (select |#valid| |ULTIMATE.start_sll_remove_last_#t~mem8#1.base|) 1)} assume 0 == sll_remove_last_#t~mem8#1.offset; {6206#(= (select |#valid| |ULTIMATE.start_sll_remove_last_#t~mem8#1.base|) 1)} is VALID [2022-02-21 00:00:07,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {6206#(= (select |#valid| |ULTIMATE.start_sll_remove_last_#t~mem8#1.base|) 1)} assume sll_remove_last_#t~mem8#1.base < #StackHeapBarrier; {6206#(= (select |#valid| |ULTIMATE.start_sll_remove_last_#t~mem8#1.base|) 1)} is VALID [2022-02-21 00:00:07,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {6206#(= (select |#valid| |ULTIMATE.start_sll_remove_last_#t~mem8#1.base|) 1)} assume !(0 == sll_remove_last_#t~mem8#1.base || 1 == #valid[sll_remove_last_#t~mem8#1.base]); {6203#false} is VALID [2022-02-21 00:00:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 00:00:07,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:00:07,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918707232] [2022-02-21 00:00:07,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918707232] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:00:07,724 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:00:07,724 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 00:00:07,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272725647] [2022-02-21 00:00:07,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:00:07,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) Word has length 31 [2022-02-21 00:00:07,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:07,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-21 00:00:07,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:07,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 00:00:07,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:00:07,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 00:00:07,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 00:00:07,743 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-21 00:00:07,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:07,895 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2022-02-21 00:00:07,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 00:00:07,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) Word has length 31 [2022-02-21 00:00:07,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-21 00:00:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-02-21 00:00:07,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-21 00:00:07,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-02-21 00:00:07,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-02-21 00:00:07,944 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-21 00:00:07,945 INFO L225 Difference]: With dead ends: 78 [2022-02-21 00:00:07,945 INFO L226 Difference]: Without dead ends: 78 [2022-02-21 00:00:07,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-21 00:00:07,946 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 21 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:07,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 116 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 00:00:07,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-21 00:00:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-02-21 00:00:07,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:07,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 77 states have internal predecessors, (86), 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-21 00:00:07,949 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 77 states have internal predecessors, (86), 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-21 00:00:07,949 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 77 states have internal predecessors, (86), 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-21 00:00:07,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:07,950 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2022-02-21 00:00:07,950 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2022-02-21 00:00:07,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:07,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:07,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 77 states have internal predecessors, (86), 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 78 states. [2022-02-21 00:00:07,951 INFO L87 Difference]: Start difference. First operand has 78 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 77 states have internal predecessors, (86), 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 78 states. [2022-02-21 00:00:07,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:07,952 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2022-02-21 00:00:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2022-02-21 00:00:07,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:07,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:07,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:07,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:07,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 77 states have internal predecessors, (86), 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-21 00:00:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2022-02-21 00:00:07,955 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 31 [2022-02-21 00:00:07,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:07,955 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2022-02-21 00:00:07,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-21 00:00:07,955 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2022-02-21 00:00:07,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-21 00:00:07,956 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:07,956 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] [2022-02-21 00:00:07,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-21 00:00:07,956 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-21 00:00:07,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:07,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1425315259, now seen corresponding path program 1 times [2022-02-21 00:00:07,957 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:07,957 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079342868] [2022-02-21 00:00:07,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:07,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:08,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {6525#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(27, 2); {6525#true} is VALID [2022-02-21 00:00:08,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {6525#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {6525#true} is VALID [2022-02-21 00:00:08,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {6525#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {6527#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} is VALID [2022-02-21 00:00:08,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {6527#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {6527#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} is VALID [2022-02-21 00:00:08,197 INFO L290 TraceCheckUtils]: 4: Hoare triple {6527#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {6527#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} is VALID [2022-02-21 00:00:08,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {6527#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {6527#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} is VALID [2022-02-21 00:00:08,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {6527#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {6528#(not (= |ULTIMATE.start_node_create_#res#1.base| 0))} is VALID [2022-02-21 00:00:08,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {6528#(not (= |ULTIMATE.start_node_create_#res#1.base| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {6529#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-21 00:00:08,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {6529#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {6529#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-21 00:00:08,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {6529#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {6530#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-21 00:00:08,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {6530#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {6530#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-21 00:00:08,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {6530#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {6531#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:08,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {6531#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {6531#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:08,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {6531#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {6531#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:08,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {6531#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {6531#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:08,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {6531#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {6532#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} is VALID [2022-02-21 00:00:08,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {6532#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {6533#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-21 00:00:08,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {6533#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {6534#(and (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 0)))} is VALID [2022-02-21 00:00:08,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {6534#(and (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 0)))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {6535#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:08,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {6535#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {6535#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:08,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {6535#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} assume !(sll_create_~len#1 > 0); {6535#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:08,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {6535#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {6536#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0)) (= |ULTIMATE.start_sll_create_#res#1.offset| 0))} is VALID [2022-02-21 00:00:08,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {6536#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0)) (= |ULTIMATE.start_sll_create_#res#1.offset| 0))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {6537#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0)))} is VALID [2022-02-21 00:00:08,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {6537#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0)))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {6538#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0)))} is VALID [2022-02-21 00:00:08,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {6538#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0)))} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {6538#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0)))} is VALID [2022-02-21 00:00:08,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {6538#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0)))} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {6538#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0)))} is VALID [2022-02-21 00:00:08,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {6538#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0)))} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {6538#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0)))} is VALID [2022-02-21 00:00:08,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {6538#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0)))} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {6539#(and (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 4) 0)))} is VALID [2022-02-21 00:00:08,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {6539#(and (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 4) 0)))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {6540#(and (= (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4) 4) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 0)))} is VALID [2022-02-21 00:00:08,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {6540#(and (= (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4) 4) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 0)))} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {6541#(not (= |ULTIMATE.start_sll_remove_last_#t~mem11#1.base| 0))} is VALID [2022-02-21 00:00:08,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {6541#(not (= |ULTIMATE.start_sll_remove_last_#t~mem11#1.base| 0))} assume !(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset; {6526#false} is VALID [2022-02-21 00:00:08,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {6526#false} assume !(1 == #valid[sll_remove_last_~snd_to_last~0#1.base]); {6526#false} is VALID [2022-02-21 00:00:08,212 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:00:08,212 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:00:08,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079342868] [2022-02-21 00:00:08,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079342868] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:00:08,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292239524] [2022-02-21 00:00:08,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:08,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:00:08,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:00:08,216 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-21 00:00:08,241 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-21 00:00:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:08,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-21 00:00:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:08,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:08,746 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 00:00:08,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 57 [2022-02-21 00:00:08,760 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 00:00:08,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2022-02-21 00:00:08,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {6525#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(27, 2); {6525#true} is VALID [2022-02-21 00:00:08,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {6525#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {6525#true} is VALID [2022-02-21 00:00:08,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {6525#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {6525#true} is VALID [2022-02-21 00:00:08,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {6525#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {6525#true} is VALID [2022-02-21 00:00:08,844 INFO L290 TraceCheckUtils]: 4: Hoare triple {6525#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {6525#true} is VALID [2022-02-21 00:00:08,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {6525#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {6525#true} is VALID [2022-02-21 00:00:08,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {6525#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {6525#true} is VALID [2022-02-21 00:00:08,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {6525#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {6525#true} is VALID [2022-02-21 00:00:08,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {6525#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {6525#true} is VALID [2022-02-21 00:00:08,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {6525#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {6525#true} is VALID [2022-02-21 00:00:08,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {6525#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {6525#true} is VALID [2022-02-21 00:00:08,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {6525#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {6525#true} is VALID [2022-02-21 00:00:08,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {6525#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {6525#true} is VALID [2022-02-21 00:00:08,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {6525#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {6525#true} is VALID [2022-02-21 00:00:08,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {6525#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {6525#true} is VALID [2022-02-21 00:00:08,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {6525#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {6525#true} is VALID [2022-02-21 00:00:08,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {6525#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {6525#true} is VALID [2022-02-21 00:00:08,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {6525#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {6525#true} is VALID [2022-02-21 00:00:08,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {6525#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {6525#true} is VALID [2022-02-21 00:00:08,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {6525#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {6525#true} is VALID [2022-02-21 00:00:08,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {6525#true} assume !(sll_create_~len#1 > 0); {6525#true} is VALID [2022-02-21 00:00:08,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {6525#true} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {6525#true} is VALID [2022-02-21 00:00:08,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {6525#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {6525#true} is VALID [2022-02-21 00:00:08,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {6525#true} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {6525#true} is VALID [2022-02-21 00:00:08,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {6525#true} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {6617#(and (= |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) |ULTIMATE.start_sll_remove_last_#t~mem6#1.base|))} is VALID [2022-02-21 00:00:08,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {6617#(and (= |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) |ULTIMATE.start_sll_remove_last_#t~mem6#1.base|))} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {6621#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) |ULTIMATE.start_sll_remove_last_#t~mem7#1.base|) (= |ULTIMATE.start_sll_remove_last_#t~mem7#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)))))} is VALID [2022-02-21 00:00:08,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {6621#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) |ULTIMATE.start_sll_remove_last_#t~mem7#1.base|) (= |ULTIMATE.start_sll_remove_last_#t~mem7#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)))))} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {6625#(or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 0)))} is VALID [2022-02-21 00:00:08,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {6625#(or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 0)))} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {6629#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int) (|ULTIMATE.start_sll_remove_last_~head#1.offset| Int)) (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 0))) (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))} is VALID [2022-02-21 00:00:08,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {6629#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int) (|ULTIMATE.start_sll_remove_last_~head#1.offset| Int)) (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 0))) (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {6633#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int) (|ULTIMATE.start_sll_remove_last_~head#1.offset| Int)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 0))) (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))} is VALID [2022-02-21 00:00:08,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {6633#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int) (|ULTIMATE.start_sll_remove_last_~head#1.offset| Int)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 0))) (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {6637#(or (not (= |ULTIMATE.start_sll_remove_last_#t~mem11#1.base| 0)) (not (= |ULTIMATE.start_sll_remove_last_#t~mem11#1.offset| 0)))} is VALID [2022-02-21 00:00:08,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {6637#(or (not (= |ULTIMATE.start_sll_remove_last_#t~mem11#1.base| 0)) (not (= |ULTIMATE.start_sll_remove_last_#t~mem11#1.offset| 0)))} assume !(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset; {6526#false} is VALID [2022-02-21 00:00:08,854 INFO L290 TraceCheckUtils]: 31: Hoare triple {6526#false} assume !(1 == #valid[sll_remove_last_~snd_to_last~0#1.base]); {6526#false} is VALID [2022-02-21 00:00:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 00:00:08,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:00:08,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292239524] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:00:08,855 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 00:00:08,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 23 [2022-02-21 00:00:08,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093263731] [2022-02-21 00:00:08,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:00:08,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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) Word has length 32 [2022-02-21 00:00:08,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:08,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-21 00:00:08,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:08,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 00:00:08,880 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:00:08,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 00:00:08,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2022-02-21 00:00:08,881 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-21 00:00:09,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:09,196 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-02-21 00:00:09,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 00:00:09,197 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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) Word has length 32 [2022-02-21 00:00:09,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-21 00:00:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-02-21 00:00:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-21 00:00:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-02-21 00:00:09,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2022-02-21 00:00:09,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:09,247 INFO L225 Difference]: With dead ends: 77 [2022-02-21 00:00:09,247 INFO L226 Difference]: Without dead ends: 77 [2022-02-21 00:00:09,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2022-02-21 00:00:09,248 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:09,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 257 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-02-21 00:00:09,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-21 00:00:09,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-02-21 00:00:09,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:09,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 76 states have internal predecessors, (82), 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-21 00:00:09,250 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 76 states have internal predecessors, (82), 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-21 00:00:09,250 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 76 states have internal predecessors, (82), 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-21 00:00:09,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:09,251 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-02-21 00:00:09,251 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-02-21 00:00:09,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:09,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:09,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 76 states have internal predecessors, (82), 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 77 states. [2022-02-21 00:00:09,253 INFO L87 Difference]: Start difference. First operand has 77 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 76 states have internal predecessors, (82), 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 77 states. [2022-02-21 00:00:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:09,258 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-02-21 00:00:09,258 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-02-21 00:00:09,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:09,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:09,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:09,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 76 states have internal predecessors, (82), 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-21 00:00:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-02-21 00:00:09,260 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 32 [2022-02-21 00:00:09,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:09,260 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-02-21 00:00:09,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-21 00:00:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-02-21 00:00:09,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-21 00:00:09,262 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:09,262 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] [2022-02-21 00:00:09,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-21 00:00:09,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-02-21 00:00:09,463 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-21 00:00:09,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:09,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1011174575, now seen corresponding path program 1 times [2022-02-21 00:00:09,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:09,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607174709] [2022-02-21 00:00:09,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:09,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:09,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {6955#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(27, 2); {6955#true} is VALID [2022-02-21 00:00:09,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {6955#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:09,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:09,640 INFO L290 TraceCheckUtils]: 3: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:09,641 INFO L290 TraceCheckUtils]: 4: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:09,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:09,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:09,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:09,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:09,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:09,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:09,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {6958#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:09,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {6958#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {6958#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:09,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {6958#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {6958#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:09,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {6958#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {6958#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:09,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {6958#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {6959#(not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:09,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {6959#(not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {6960#(not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|))} is VALID [2022-02-21 00:00:09,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {6960#(not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {6960#(not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|))} is VALID [2022-02-21 00:00:09,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {6960#(not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {6961#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:09,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {6961#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {6961#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:09,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {6961#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} assume !(sll_create_~len#1 > 0); {6961#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:09,656 INFO L290 TraceCheckUtils]: 21: Hoare triple {6961#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {6962#(not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|))} is VALID [2022-02-21 00:00:09,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {6962#(not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {6963#(not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))} is VALID [2022-02-21 00:00:09,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {6963#(not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {6964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) |ULTIMATE.start_sll_remove_last_~head#1.base|))} is VALID [2022-02-21 00:00:09,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {6964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) |ULTIMATE.start_sll_remove_last_~head#1.base|))} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {6965#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) |ULTIMATE.start_sll_remove_last_~head#1.base|)))} is VALID [2022-02-21 00:00:09,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {6965#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) |ULTIMATE.start_sll_remove_last_~head#1.base|)))} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {6965#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) |ULTIMATE.start_sll_remove_last_~head#1.base|)))} is VALID [2022-02-21 00:00:09,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {6965#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) |ULTIMATE.start_sll_remove_last_~head#1.base|)))} assume 0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset; {6965#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) |ULTIMATE.start_sll_remove_last_~head#1.base|)))} is VALID [2022-02-21 00:00:09,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {6965#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) |ULTIMATE.start_sll_remove_last_~head#1.base|)))} SUMMARY for call sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L594 {6966#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (not (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_sll_remove_last_#t~mem8#1.base|)))} is VALID [2022-02-21 00:00:09,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {6966#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (not (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_sll_remove_last_#t~mem8#1.base|)))} assume 0 == sll_remove_last_#t~mem8#1.offset; {6966#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (not (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_sll_remove_last_#t~mem8#1.base|)))} is VALID [2022-02-21 00:00:09,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {6966#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (not (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_sll_remove_last_#t~mem8#1.base|)))} assume sll_remove_last_#t~mem8#1.base < #StackHeapBarrier; {6966#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (not (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_sll_remove_last_#t~mem8#1.base|)))} is VALID [2022-02-21 00:00:09,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {6966#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (not (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_sll_remove_last_#t~mem8#1.base|)))} assume 0 == sll_remove_last_#t~mem8#1.base || 1 == #valid[sll_remove_last_#t~mem8#1.base];call ULTIMATE.dealloc(sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset);havoc sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset; {6967#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1)} is VALID [2022-02-21 00:00:09,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {6967#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1)} assume !(1 == #valid[sll_remove_last_~head#1.base]); {6956#false} is VALID [2022-02-21 00:00:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 00:00:09,662 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:00:09,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607174709] [2022-02-21 00:00:09,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607174709] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:00:09,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550872801] [2022-02-21 00:00:09,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:09,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:00:09,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:00:09,664 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-21 00:00:09,667 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-21 00:00:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:09,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 00:00:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:09,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:10,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:00:10,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-21 00:00:10,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {6955#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(27, 2); {6955#true} is VALID [2022-02-21 00:00:10,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {6955#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,106 INFO L290 TraceCheckUtils]: 3: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,106 INFO L290 TraceCheckUtils]: 4: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !(sll_create_~len#1 > 0); {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:10,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {6957#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {7040#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_sll_remove_last_~head#1.base|)} is VALID [2022-02-21 00:00:10,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {7040#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_sll_remove_last_~head#1.base|)} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {7044#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_sll_remove_last_~head#1.base|))} is VALID [2022-02-21 00:00:10,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {7044#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_sll_remove_last_~head#1.base|))} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {7044#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_sll_remove_last_~head#1.base|))} is VALID [2022-02-21 00:00:10,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {7044#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_sll_remove_last_~head#1.base|))} assume 0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset; {7044#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_sll_remove_last_~head#1.base|))} is VALID [2022-02-21 00:00:10,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {7044#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_sll_remove_last_~head#1.base|))} SUMMARY for call sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L594 {7044#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_sll_remove_last_~head#1.base|))} is VALID [2022-02-21 00:00:10,117 INFO L290 TraceCheckUtils]: 28: Hoare triple {7044#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_sll_remove_last_~head#1.base|))} assume 0 == sll_remove_last_#t~mem8#1.offset; {7044#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_sll_remove_last_~head#1.base|))} is VALID [2022-02-21 00:00:10,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {7044#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_sll_remove_last_~head#1.base|))} assume sll_remove_last_#t~mem8#1.base < #StackHeapBarrier; {7060#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (< (+ |ULTIMATE.start_sll_remove_last_#t~mem8#1.base| 1) |ULTIMATE.start_sll_remove_last_~head#1.base|))} is VALID [2022-02-21 00:00:10,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {7060#(and (= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1) (< (+ |ULTIMATE.start_sll_remove_last_#t~mem8#1.base| 1) |ULTIMATE.start_sll_remove_last_~head#1.base|))} assume 0 == sll_remove_last_#t~mem8#1.base || 1 == #valid[sll_remove_last_#t~mem8#1.base];call ULTIMATE.dealloc(sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset);havoc sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset; {6967#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1)} is VALID [2022-02-21 00:00:10,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {6967#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~head#1.base|) 1)} assume !(1 == #valid[sll_remove_last_~head#1.base]); {6956#false} is VALID [2022-02-21 00:00:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 00:00:10,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 00:00:10,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550872801] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:00:10,119 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 00:00:10,119 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2022-02-21 00:00:10,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659915555] [2022-02-21 00:00:10,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:00:10,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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) Word has length 32 [2022-02-21 00:00:10,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:10,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-21 00:00:10,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:10,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-21 00:00:10,148 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:00:10,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 00:00:10,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-02-21 00:00:10,148 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-21 00:00:10,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:10,406 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-02-21 00:00:10,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 00:00:10,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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) Word has length 32 [2022-02-21 00:00:10,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-21 00:00:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-02-21 00:00:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-21 00:00:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-02-21 00:00:10,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2022-02-21 00:00:10,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:10,458 INFO L225 Difference]: With dead ends: 84 [2022-02-21 00:00:10,458 INFO L226 Difference]: Without dead ends: 84 [2022-02-21 00:00:10,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-02-21 00:00:10,459 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 92 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:10,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 91 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 00:00:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-02-21 00:00:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2022-02-21 00:00:10,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:10,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 76 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 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-21 00:00:10,461 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 76 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 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-21 00:00:10,461 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 76 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 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-21 00:00:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:10,468 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-02-21 00:00:10,468 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-02-21 00:00:10,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:10,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:10,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 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 84 states. [2022-02-21 00:00:10,469 INFO L87 Difference]: Start difference. First operand has 76 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 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 84 states. [2022-02-21 00:00:10,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:10,471 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-02-21 00:00:10,471 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-02-21 00:00:10,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:10,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:10,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:10,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 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-21 00:00:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-02-21 00:00:10,473 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 32 [2022-02-21 00:00:10,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:10,473 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-02-21 00:00:10,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 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-21 00:00:10,474 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-02-21 00:00:10,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-21 00:00:10,475 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:10,475 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] [2022-02-21 00:00:10,503 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-21 00:00:10,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-21 00:00:10,701 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-21 00:00:10,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:10,701 INFO L85 PathProgramCache]: Analyzing trace with hash -366548792, now seen corresponding path program 1 times [2022-02-21 00:00:10,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:10,702 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732974962] [2022-02-21 00:00:10,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:10,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:11,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {7400#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(27, 2); {7400#true} is VALID [2022-02-21 00:00:11,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {7400#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {7400#true} is VALID [2022-02-21 00:00:11,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {7400#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {7402#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:11,049 INFO L290 TraceCheckUtils]: 3: Hoare triple {7402#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {7402#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:11,049 INFO L290 TraceCheckUtils]: 4: Hoare triple {7402#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {7402#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:11,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {7402#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {7402#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:11,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {7402#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {7403#(and (= 8 (select |#length| |ULTIMATE.start_node_create_#res#1.base|)) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} is VALID [2022-02-21 00:00:11,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {7403#(and (= 8 (select |#length| |ULTIMATE.start_node_create_#res#1.base|)) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {7404#(and (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-21 00:00:11,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {7404#(and (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {7404#(and (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-21 00:00:11,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {7404#(and (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {7405#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:11,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {7405#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {7405#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:11,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {7405#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {7406#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:11,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {7406#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {7406#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:11,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {7406#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {7406#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:11,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {7406#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {7406#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:11,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {7406#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {7407#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} is VALID [2022-02-21 00:00:11,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {7407#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {7408#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-21 00:00:11,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {7408#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {7409#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 8) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 0))} is VALID [2022-02-21 00:00:11,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {7409#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 8) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {7410#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4))))} is VALID [2022-02-21 00:00:11,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {7410#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4))))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {7410#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4))))} is VALID [2022-02-21 00:00:11,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {7410#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4))))} assume !(sll_create_~len#1 > 0); {7410#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4))))} is VALID [2022-02-21 00:00:11,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {7410#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4))))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {7411#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4))) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0))} is VALID [2022-02-21 00:00:11,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {7411#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4))) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {7412#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} is VALID [2022-02-21 00:00:11,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {7412#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {7413#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 8))} is VALID [2022-02-21 00:00:11,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {7413#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 8))} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {7413#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 8))} is VALID [2022-02-21 00:00:11,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {7413#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 8))} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {7413#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 8))} is VALID [2022-02-21 00:00:11,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {7413#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 8))} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {7413#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 8))} is VALID [2022-02-21 00:00:11,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {7413#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 8))} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {7414#(and (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 4)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 4) 0))} is VALID [2022-02-21 00:00:11,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {7414#(and (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 4)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 4) 0))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {7415#(and (= (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4) 4) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 8))} is VALID [2022-02-21 00:00:11,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {7415#(and (= (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4) 4) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 8))} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {7415#(and (= (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4) 4) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 8))} is VALID [2022-02-21 00:00:11,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {7415#(and (= (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4) 4) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 8))} assume !!(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset; {7415#(and (= (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4) 4) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 8))} is VALID [2022-02-21 00:00:11,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {7415#(and (= (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4) 4) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 8))} SUMMARY for call sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L601 {7416#(and (= (select |#length| |ULTIMATE.start_sll_remove_last_#t~mem10#1.base|) 8) (= |ULTIMATE.start_sll_remove_last_#t~mem10#1.offset| 0))} is VALID [2022-02-21 00:00:11,064 INFO L290 TraceCheckUtils]: 32: Hoare triple {7416#(and (= (select |#length| |ULTIMATE.start_sll_remove_last_#t~mem10#1.base|) 8) (= |ULTIMATE.start_sll_remove_last_#t~mem10#1.offset| 0))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset;havoc sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset; {7417#(and (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (- 8)) 0))} is VALID [2022-02-21 00:00:11,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {7417#(and (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (- 8)) 0))} assume !(4 + (4 + sll_remove_last_~last~0#1.offset) <= #length[sll_remove_last_~last~0#1.base] && 0 <= 4 + sll_remove_last_~last~0#1.offset); {7401#false} is VALID [2022-02-21 00:00:11,065 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:00:11,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:00:11,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732974962] [2022-02-21 00:00:11,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732974962] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:00:11,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875297202] [2022-02-21 00:00:11,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:11,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:00:11,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:00:11,067 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-21 00:00:11,067 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-21 00:00:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:11,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 72 conjunts are in the unsatisfiable core [2022-02-21 00:00:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:11,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:11,466 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-21 00:00:11,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-02-21 00:00:11,706 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-21 00:00:11,713 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-21 00:00:12,418 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-02-21 00:00:12,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 43 [2022-02-21 00:00:12,443 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-02-21 00:00:12,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2022-02-21 00:00:12,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {7400#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(27, 2); {7400#true} is VALID [2022-02-21 00:00:12,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {7400#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {7424#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} is VALID [2022-02-21 00:00:12,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {7424#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {7428#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:12,558 INFO L290 TraceCheckUtils]: 3: Hoare triple {7428#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {7428#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:12,559 INFO L290 TraceCheckUtils]: 4: Hoare triple {7428#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {7428#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:12,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {7428#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {7428#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:12,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {7428#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {7441#(and (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:12,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {7441#(and (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {7445#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-21 00:00:12,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {7445#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {7449#(and (<= (+ 8 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-21 00:00:12,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {7449#(and (<= (+ 8 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {7453#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:12,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {7453#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {7453#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:12,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {7453#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {7460#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:12,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {7460#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {7460#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:12,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {7460#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {7460#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:12,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {7460#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {7460#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:12,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {7460#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {7473#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_node_create_#res#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:12,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {7473#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_node_create_#res#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {7477#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:12,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {7477#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 8 (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {7481#(and (<= 8 (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 0))} is VALID [2022-02-21 00:00:12,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {7481#(and (<= 8 (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {7485#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)))} is VALID [2022-02-21 00:00:12,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {7485#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {7485#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)))} is VALID [2022-02-21 00:00:12,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {7485#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)))} assume !(sll_create_~len#1 > 0); {7485#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)))} is VALID [2022-02-21 00:00:12,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {7485#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {7495#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) (+ |ULTIMATE.start_sll_create_#res#1.offset| 4)) 0) (<= 8 (select |#length| |ULTIMATE.start_sll_create_#res#1.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (+ |ULTIMATE.start_sll_create_#res#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:12,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {7495#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) (+ |ULTIMATE.start_sll_create_#res#1.offset| 4)) 0) (<= 8 (select |#length| |ULTIMATE.start_sll_create_#res#1.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (+ |ULTIMATE.start_sll_create_#res#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {7499#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))} is VALID [2022-02-21 00:00:12,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {7499#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {7503#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) 0))} is VALID [2022-02-21 00:00:12,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {7503#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) 0))} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {7503#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) 0))} is VALID [2022-02-21 00:00:12,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {7503#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) 0))} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {7503#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) 0))} is VALID [2022-02-21 00:00:12,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {7503#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) 0))} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {7503#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) 0))} is VALID [2022-02-21 00:00:12,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {7503#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) 0))} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {7516#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) 0)))} is VALID [2022-02-21 00:00:12,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {7516#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) 0)))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {7520#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) 0)))} is VALID [2022-02-21 00:00:12,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {7520#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) 0)))} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {7520#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) 0)))} is VALID [2022-02-21 00:00:12,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {7520#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) 0)))} assume !!(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset; {7520#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) 0)))} is VALID [2022-02-21 00:00:12,576 INFO L290 TraceCheckUtils]: 31: Hoare triple {7520#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) 0)))} SUMMARY for call sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L601 {7530#(and (<= 8 (select |#length| |ULTIMATE.start_sll_remove_last_#t~mem10#1.base|)) (= |ULTIMATE.start_sll_remove_last_#t~mem10#1.offset| 0))} is VALID [2022-02-21 00:00:12,576 INFO L290 TraceCheckUtils]: 32: Hoare triple {7530#(and (<= 8 (select |#length| |ULTIMATE.start_sll_remove_last_#t~mem10#1.base|)) (= |ULTIMATE.start_sll_remove_last_#t~mem10#1.offset| 0))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset;havoc sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset; {7534#(and (<= 8 (select |#length| |ULTIMATE.start_sll_remove_last_~last~0#1.base|)) (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 0))} is VALID [2022-02-21 00:00:12,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {7534#(and (<= 8 (select |#length| |ULTIMATE.start_sll_remove_last_~last~0#1.base|)) (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 0))} assume !(4 + (4 + sll_remove_last_~last~0#1.offset) <= #length[sll_remove_last_~last~0#1.base] && 0 <= 4 + sll_remove_last_~last~0#1.offset); {7401#false} is VALID [2022-02-21 00:00:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:00:12,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:00:13,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:00:13,562 INFO L356 Elim1Store]: treesize reduction 27, result has 57.1 percent of original size [2022-02-21 00:00:13,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 382 treesize of output 353 [2022-02-21 00:00:13,798 INFO L356 Elim1Store]: treesize reduction 37, result has 66.7 percent of original size [2022-02-21 00:00:13,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 884 treesize of output 811 [2022-02-21 00:00:14,957 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 37 treesize of output 33 [2022-02-21 00:00:15,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {7538#(and (<= (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)))} assume !(4 + (4 + sll_remove_last_~last~0#1.offset) <= #length[sll_remove_last_~last~0#1.base] && 0 <= 4 + sll_remove_last_~last~0#1.offset); {7401#false} is VALID [2022-02-21 00:00:15,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {7542#(and (<= (+ |ULTIMATE.start_sll_remove_last_#t~mem10#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_#t~mem10#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_#t~mem10#1.offset| 4)))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset;havoc sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset; {7538#(and (<= (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)))} is VALID [2022-02-21 00:00:15,157 INFO L290 TraceCheckUtils]: 31: Hoare triple {7546#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)))))} SUMMARY for call sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L601 {7542#(and (<= (+ |ULTIMATE.start_sll_remove_last_#t~mem10#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_#t~mem10#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_#t~mem10#1.offset| 4)))} is VALID [2022-02-21 00:00:15,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {7546#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)))))} assume !!(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset; {7546#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)))))} is VALID [2022-02-21 00:00:15,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {7546#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)))))} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {7546#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)))))} is VALID [2022-02-21 00:00:15,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {7556#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 4)))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 4)) 4)))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {7546#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)))))} is VALID [2022-02-21 00:00:15,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {7560#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))))} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {7556#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 4)))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 4)) 4)))} is VALID [2022-02-21 00:00:15,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {7560#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))))} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {7560#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))))} is VALID [2022-02-21 00:00:15,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {7560#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))))} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {7560#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))))} is VALID [2022-02-21 00:00:15,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {7560#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))))} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {7560#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))))} is VALID [2022-02-21 00:00:15,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {7573#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)))))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {7560#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))))} is VALID [2022-02-21 00:00:15,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {7577#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_create_#res#1.base|)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_create_#res#1.offset|))))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {7573#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)))))} is VALID [2022-02-21 00:00:15,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {7581#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.offset|))))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {7577#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_create_#res#1.base|)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_create_#res#1.offset|))))} is VALID [2022-02-21 00:00:15,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {7581#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.offset|))))} assume !(sll_create_~len#1 > 0); {7581#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.offset|))))} is VALID [2022-02-21 00:00:15,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {7581#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.offset|))))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {7581#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.offset|))))} is VALID [2022-02-21 00:00:15,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {7591#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_create_~new_head~0#1.offset|))))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {7581#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.offset|))))} is VALID [2022-02-21 00:00:15,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {7595#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {7591#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_create_~new_head~0#1.offset|))))} is VALID [2022-02-21 00:00:15,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {7595#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {7595#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))} is VALID [2022-02-21 00:00:15,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {7595#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {7595#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))} is VALID [2022-02-21 00:00:15,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {7595#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {7595#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))} is VALID [2022-02-21 00:00:15,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {7595#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {7595#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))} is VALID [2022-02-21 00:00:15,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {7595#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {7595#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))} is VALID [2022-02-21 00:00:15,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {7614#(forall ((v_ArrVal_894 Int)) (or (not (<= 8 v_ArrVal_894)) (and (<= 0 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_17| Int)) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_17| v_ArrVal_894) |ULTIMATE.start_sll_create_~head~0#1.base|))))))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {7595#(and (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))} is VALID [2022-02-21 00:00:15,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {7614#(forall ((v_ArrVal_894 Int)) (or (not (<= 8 v_ArrVal_894)) (and (<= 0 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_17| Int)) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_17| v_ArrVal_894) |ULTIMATE.start_sll_create_~head~0#1.base|))))))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {7614#(forall ((v_ArrVal_894 Int)) (or (not (<= 8 v_ArrVal_894)) (and (<= 0 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_17| Int)) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_17| v_ArrVal_894) |ULTIMATE.start_sll_create_~head~0#1.base|))))))} is VALID [2022-02-21 00:00:15,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {7621#(forall ((v_ArrVal_894 Int)) (or (not (<= 8 v_ArrVal_894)) (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_17| Int)) (<= (+ 8 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_17| v_ArrVal_894) |ULTIMATE.start_sll_create_~new_head~0#1.base|))) (<= 0 (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)))))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {7614#(forall ((v_ArrVal_894 Int)) (or (not (<= 8 v_ArrVal_894)) (and (<= 0 (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_17| Int)) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_17| v_ArrVal_894) |ULTIMATE.start_sll_create_~head~0#1.base|))))))} is VALID [2022-02-21 00:00:15,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {7625#(and (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (<= 0 (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {7621#(forall ((v_ArrVal_894 Int)) (or (not (<= 8 v_ArrVal_894)) (and (forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_17| Int)) (<= (+ 8 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (select (store |#length| |v_ULTIMATE.start_node_create_~temp~0#1.base_17| v_ArrVal_894) |ULTIMATE.start_sll_create_~new_head~0#1.base|))) (<= 0 (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)))))} is VALID [2022-02-21 00:00:15,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {7629#(and (<= 0 (+ 4 |ULTIMATE.start_node_create_#res#1.offset|)) (<= |ULTIMATE.start_node_create_#res#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {7625#(and (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (<= 0 (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)))} is VALID [2022-02-21 00:00:15,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {7633#(and (<= 0 (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 4)) (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {7629#(and (<= 0 (+ 4 |ULTIMATE.start_node_create_#res#1.offset|)) (<= |ULTIMATE.start_node_create_#res#1.offset| 0))} is VALID [2022-02-21 00:00:15,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {7633#(and (<= 0 (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 4)) (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {7633#(and (<= 0 (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 4)) (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:15,174 INFO L290 TraceCheckUtils]: 4: Hoare triple {7633#(and (<= 0 (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 4)) (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {7633#(and (<= 0 (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 4)) (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:15,175 INFO L290 TraceCheckUtils]: 3: Hoare triple {7633#(and (<= 0 (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 4)) (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {7633#(and (<= 0 (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 4)) (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:15,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {7400#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {7633#(and (<= 0 (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 4)) (<= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:15,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {7400#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {7400#true} is VALID [2022-02-21 00:00:15,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {7400#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(27, 2); {7400#true} is VALID [2022-02-21 00:00:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:00:15,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875297202] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:00:15,176 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:00:15,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 16] total 50 [2022-02-21 00:00:15,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559827215] [2022-02-21 00:00:15,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:00:15,177 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.98) internal successors, (99), 51 states have internal predecessors, (99), 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) Word has length 34 [2022-02-21 00:00:15,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:15,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 51 states, 50 states have (on average 1.98) internal successors, (99), 51 states have internal predecessors, (99), 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-21 00:00:15,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:15,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-02-21 00:00:15,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:00:15,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-02-21 00:00:15,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2381, Unknown=0, NotChecked=0, Total=2550 [2022-02-21 00:00:15,274 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 51 states, 50 states have (on average 1.98) internal successors, (99), 51 states have internal predecessors, (99), 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-21 00:00:19,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:19,409 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2022-02-21 00:00:19,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-21 00:00:19,410 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.98) internal successors, (99), 51 states have internal predecessors, (99), 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) Word has length 34 [2022-02-21 00:00:19,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.98) internal successors, (99), 51 states have internal predecessors, (99), 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-21 00:00:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 168 transitions. [2022-02-21 00:00:19,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.98) internal successors, (99), 51 states have internal predecessors, (99), 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-21 00:00:19,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 168 transitions. [2022-02-21 00:00:19,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 168 transitions. [2022-02-21 00:00:19,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:19,596 INFO L225 Difference]: With dead ends: 158 [2022-02-21 00:00:19,596 INFO L226 Difference]: Without dead ends: 158 [2022-02-21 00:00:19,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=550, Invalid=3610, Unknown=0, NotChecked=0, Total=4160 [2022-02-21 00:00:19,597 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 1111 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:19,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1111 Valid, 789 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 919 Invalid, 0 Unknown, 272 Unchecked, 0.9s Time] [2022-02-21 00:00:19,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-02-21 00:00:19,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 80. [2022-02-21 00:00:19,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:19,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 80 states, 67 states have (on average 1.328358208955224) internal successors, (89), 79 states have internal predecessors, (89), 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-21 00:00:19,600 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 80 states, 67 states have (on average 1.328358208955224) internal successors, (89), 79 states have internal predecessors, (89), 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-21 00:00:19,600 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 80 states, 67 states have (on average 1.328358208955224) internal successors, (89), 79 states have internal predecessors, (89), 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-21 00:00:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:19,602 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2022-02-21 00:00:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2022-02-21 00:00:19,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:19,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:19,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 67 states have (on average 1.328358208955224) internal successors, (89), 79 states have internal predecessors, (89), 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 158 states. [2022-02-21 00:00:19,603 INFO L87 Difference]: Start difference. First operand has 80 states, 67 states have (on average 1.328358208955224) internal successors, (89), 79 states have internal predecessors, (89), 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 158 states. [2022-02-21 00:00:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:19,605 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2022-02-21 00:00:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2022-02-21 00:00:19,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:19,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:19,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:19,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.328358208955224) internal successors, (89), 79 states have internal predecessors, (89), 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-21 00:00:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-02-21 00:00:19,607 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 34 [2022-02-21 00:00:19,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:19,608 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-02-21 00:00:19,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.98) internal successors, (99), 51 states have internal predecessors, (99), 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-21 00:00:19,608 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-02-21 00:00:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-21 00:00:19,608 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:19,609 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] [2022-02-21 00:00:19,638 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-21 00:00:19,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:00:19,823 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-21 00:00:19,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:19,823 INFO L85 PathProgramCache]: Analyzing trace with hash -366548793, now seen corresponding path program 1 times [2022-02-21 00:00:19,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:19,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783105668] [2022-02-21 00:00:19,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:19,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:20,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {8236#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(27, 2); {8236#true} is VALID [2022-02-21 00:00:20,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {8236#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {8236#true} is VALID [2022-02-21 00:00:20,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {8236#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {8238#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} is VALID [2022-02-21 00:00:20,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {8238#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {8238#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} is VALID [2022-02-21 00:00:20,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {8238#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {8238#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} is VALID [2022-02-21 00:00:20,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {8238#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {8238#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} is VALID [2022-02-21 00:00:20,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {8238#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {8239#(= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1)} is VALID [2022-02-21 00:00:20,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {8239#(= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {8240#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-21 00:00:20,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {8240#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {8240#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-21 00:00:20,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {8240#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {8241#(= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)} is VALID [2022-02-21 00:00:20,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {8241#(= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {8241#(= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)} is VALID [2022-02-21 00:00:20,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {8241#(= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {8242#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:20,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {8242#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {8242#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:20,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {8242#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {8242#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:20,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {8242#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {8242#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:20,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {8242#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {8243#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} is VALID [2022-02-21 00:00:20,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {8243#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {8244#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-21 00:00:20,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {8244#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {8245#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-21 00:00:20,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {8245#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {8246#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:20,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {8246#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {8246#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:20,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {8246#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} assume !(sll_create_~len#1 > 0); {8246#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:20,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {8246#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {8247#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4)) 1) (= |ULTIMATE.start_sll_create_#res#1.offset| 0))} is VALID [2022-02-21 00:00:20,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {8247#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4)) 1) (= |ULTIMATE.start_sll_create_#res#1.offset| 0))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {8248#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} is VALID [2022-02-21 00:00:20,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {8248#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {8249#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 1))} is VALID [2022-02-21 00:00:20,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {8249#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 1))} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {8249#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 1))} is VALID [2022-02-21 00:00:20,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {8249#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 1))} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {8249#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 1))} is VALID [2022-02-21 00:00:20,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {8249#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 1))} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {8249#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 1))} is VALID [2022-02-21 00:00:20,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {8249#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 1))} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {8250#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 4)) 1) (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 0))} is VALID [2022-02-21 00:00:20,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {8250#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 4)) 1) (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 0))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {8251#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 1)} is VALID [2022-02-21 00:00:20,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {8251#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 1)} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {8251#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 1)} is VALID [2022-02-21 00:00:20,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {8251#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 1)} assume !!(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset; {8251#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 1)} is VALID [2022-02-21 00:00:20,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {8251#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 1)} SUMMARY for call sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L601 {8252#(= (select |#valid| |ULTIMATE.start_sll_remove_last_#t~mem10#1.base|) 1)} is VALID [2022-02-21 00:00:20,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {8252#(= (select |#valid| |ULTIMATE.start_sll_remove_last_#t~mem10#1.base|) 1)} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset;havoc sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset; {8253#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 1)} is VALID [2022-02-21 00:00:20,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {8253#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 1)} assume !(1 == #valid[sll_remove_last_~last~0#1.base]); {8237#false} is VALID [2022-02-21 00:00:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:00:20,110 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:00:20,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783105668] [2022-02-21 00:00:20,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783105668] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:00:20,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146025886] [2022-02-21 00:00:20,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:20,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:00:20,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:00:20,116 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-21 00:00:20,118 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-21 00:00:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:20,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 59 conjunts are in the unsatisfiable core [2022-02-21 00:00:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:20,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:20,402 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-21 00:00:20,421 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-21 00:00:20,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-21 00:00:20,677 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 13 treesize of output 9 [2022-02-21 00:00:21,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-21 00:00:22,374 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-21 00:00:22,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 00:00:22,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 00:00:22,884 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 00:00:22,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 19 [2022-02-21 00:00:22,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {8236#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(27, 2); {8236#true} is VALID [2022-02-21 00:00:22,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {8236#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {8260#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} is VALID [2022-02-21 00:00:22,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {8260#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {8260#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} is VALID [2022-02-21 00:00:22,945 INFO L290 TraceCheckUtils]: 3: Hoare triple {8260#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {8260#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} is VALID [2022-02-21 00:00:22,945 INFO L290 TraceCheckUtils]: 4: Hoare triple {8260#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {8260#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} is VALID [2022-02-21 00:00:22,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {8260#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {8260#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} is VALID [2022-02-21 00:00:22,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {8260#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {8260#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} is VALID [2022-02-21 00:00:22,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {8260#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {8260#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} is VALID [2022-02-21 00:00:22,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {8260#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {8282#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-21 00:00:22,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {8282#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {8286#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:22,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {8286#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {8286#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:22,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {8286#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {8293#(and (<= (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) 8) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:22,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {8293#(and (<= (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) 8) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {8293#(and (<= (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) 8) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:22,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {8293#(and (<= (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) 8) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {8293#(and (<= (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) 8) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:22,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {8293#(and (<= (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) 8) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {8293#(and (<= (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) 8) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:22,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {8293#(and (<= (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) 8) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_node_create_~temp~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {8306#(and (<= (select |#length| |ULTIMATE.start_node_create_#res#1.base|) 8) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_node_create_#res#1.offset|) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:22,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {8306#(and (<= (select |#length| |ULTIMATE.start_node_create_#res#1.base|) 8) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_node_create_#res#1.offset|) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {8310#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (<= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:22,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {8310#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (<= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {8314#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:22,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {8314#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {8318#(and (<= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)))))))} is VALID [2022-02-21 00:00:22,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {8318#(and (<= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)))))))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {8318#(and (<= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)))))))} is VALID [2022-02-21 00:00:22,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {8318#(and (<= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)))))))} assume !(sll_create_~len#1 > 0); {8318#(and (<= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)))))))} is VALID [2022-02-21 00:00:22,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {8318#(and (<= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)))))))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {8328#(and (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |ULTIMATE.start_sll_create_#res#1.base|)) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_#res#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_sll_create_#res#1.base|) 8))} is VALID [2022-02-21 00:00:22,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {8328#(and (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |ULTIMATE.start_sll_create_#res#1.base|)) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_#res#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_sll_create_#res#1.base|) 8))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {8332#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int)) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8))} is VALID [2022-02-21 00:00:22,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {8332#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int)) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {8336#(and (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) 8) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0))} is VALID [2022-02-21 00:00:22,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {8336#(and (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) 8) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0))} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {8336#(and (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) 8) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0))} is VALID [2022-02-21 00:00:22,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {8336#(and (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) 8) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0))} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {8336#(and (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) 8) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0))} is VALID [2022-02-21 00:00:22,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {8336#(and (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) 8) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0))} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {8336#(and (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) 8) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0))} is VALID [2022-02-21 00:00:22,961 INFO L290 TraceCheckUtils]: 27: Hoare triple {8336#(and (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) 8) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0))} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {8349#(exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) 8) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset|)))} is VALID [2022-02-21 00:00:22,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {8349#(exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) 8) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset|)))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {8353#(exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) 8) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.offset|)))} is VALID [2022-02-21 00:00:22,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {8353#(exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (<= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) 8) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.offset|)))} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {8357#(and (<= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.offset|))))} is VALID [2022-02-21 00:00:22,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {8357#(and (<= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.offset|))))} assume !!(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset; {8357#(and (<= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.offset|))))} is VALID [2022-02-21 00:00:22,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {8357#(and (<= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 0) (exists ((|ULTIMATE.start_sll_create_~new_head~0#1.offset| Int) (|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 1) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.offset|))))} SUMMARY for call sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L601 {8252#(= (select |#valid| |ULTIMATE.start_sll_remove_last_#t~mem10#1.base|) 1)} is VALID [2022-02-21 00:00:22,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {8252#(= (select |#valid| |ULTIMATE.start_sll_remove_last_#t~mem10#1.base|) 1)} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset;havoc sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset; {8253#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 1)} is VALID [2022-02-21 00:00:22,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {8253#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 1)} assume !(1 == #valid[sll_remove_last_~last~0#1.base]); {8237#false} is VALID [2022-02-21 00:00:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:00:22,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:00:23,222 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 31 [2022-02-21 00:00:24,529 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 00:00:24,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 191 treesize of output 197 [2022-02-21 00:00:28,024 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-21 00:00:28,024 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 30 treesize of output 1 [2022-02-21 00:00:28,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {8253#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 1)} assume !(1 == #valid[sll_remove_last_~last~0#1.base]); {8237#false} is VALID [2022-02-21 00:00:28,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {8252#(= (select |#valid| |ULTIMATE.start_sll_remove_last_#t~mem10#1.base|) 1)} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset;havoc sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset; {8253#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 1)} is VALID [2022-02-21 00:00:28,035 INFO L290 TraceCheckUtils]: 31: Hoare triple {8251#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 1)} SUMMARY for call sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L601 {8252#(= (select |#valid| |ULTIMATE.start_sll_remove_last_#t~mem10#1.base|) 1)} is VALID [2022-02-21 00:00:28,035 INFO L290 TraceCheckUtils]: 30: Hoare triple {8251#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 1)} assume !!(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset; {8251#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 1)} is VALID [2022-02-21 00:00:28,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {8382#(or (< (select |#length| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 8)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 1))} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {8251#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 1)} is VALID [2022-02-21 00:00:28,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {8386#(or (< (select |#length| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 8)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 4))) 1))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {8382#(or (< (select |#length| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 8)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 1))} is VALID [2022-02-21 00:00:28,036 INFO L290 TraceCheckUtils]: 27: Hoare triple {8390#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)))) 1) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {8386#(or (< (select |#length| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 8)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 4))) 1))} is VALID [2022-02-21 00:00:28,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {8390#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)))) 1) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {8390#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)))) 1) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))} is VALID [2022-02-21 00:00:28,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {8390#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)))) 1) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {8390#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)))) 1) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))} is VALID [2022-02-21 00:00:28,038 INFO L290 TraceCheckUtils]: 24: Hoare triple {8390#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)))) 1) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {8390#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)))) 1) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))} is VALID [2022-02-21 00:00:28,038 INFO L290 TraceCheckUtils]: 23: Hoare triple {8403#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 8)))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {8390#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)))) 1) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))))} is VALID [2022-02-21 00:00:28,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {8407#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_31 Int)) (or (not (<= |ULTIMATE.start_sll_create_#res#1.offset| v_arrayElimCell_31)) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 v_arrayElimCell_31)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_create_#res#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 v_arrayElimCell_31))) 1)))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {8403#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 8)))} is VALID [2022-02-21 00:00:28,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {8411#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_31 Int)) (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 v_arrayElimCell_31)) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (< v_arrayElimCell_31 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 v_arrayElimCell_31))) 1)))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {8407#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_31 Int)) (or (not (<= |ULTIMATE.start_sll_create_#res#1.offset| v_arrayElimCell_31)) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 v_arrayElimCell_31)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_create_#res#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 v_arrayElimCell_31))) 1)))} is VALID [2022-02-21 00:00:28,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {8411#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_31 Int)) (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 v_arrayElimCell_31)) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (< v_arrayElimCell_31 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 v_arrayElimCell_31))) 1)))} assume !(sll_create_~len#1 > 0); {8411#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_31 Int)) (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 v_arrayElimCell_31)) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (< v_arrayElimCell_31 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 v_arrayElimCell_31))) 1)))} is VALID [2022-02-21 00:00:28,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {8411#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_31 Int)) (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 v_arrayElimCell_31)) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (< v_arrayElimCell_31 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 v_arrayElimCell_31))) 1)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {8411#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_31 Int)) (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 v_arrayElimCell_31)) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (< v_arrayElimCell_31 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 v_arrayElimCell_31))) 1)))} is VALID [2022-02-21 00:00:28,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {8421#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_31 Int)) (or (< v_arrayElimCell_31 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 v_arrayElimCell_31)) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 v_arrayElimCell_31))) 1) (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {8411#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_31 Int)) (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 v_arrayElimCell_31)) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (< v_arrayElimCell_31 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 v_arrayElimCell_31))) 1)))} is VALID [2022-02-21 00:00:28,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {8425#(and (or (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (< (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 8 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (or (<= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 8 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (forall ((v_arrayElimCell_33 Int)) (= (select |#valid| v_arrayElimCell_33) 1))))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {8421#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimCell_31 Int)) (or (< v_arrayElimCell_31 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 v_arrayElimCell_31)) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 v_arrayElimCell_31))) 1) (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))))} is VALID [2022-02-21 00:00:28,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {8429#(and (or (forall ((v_arrayElimCell_33 Int)) (= (select |#valid| v_arrayElimCell_33) 1)) (<= (select |#length| |ULTIMATE.start_node_create_#res#1.base|) (+ 8 |ULTIMATE.start_node_create_#res#1.offset|))) (or (< (select |#length| |ULTIMATE.start_node_create_#res#1.base|) (+ 8 |ULTIMATE.start_node_create_#res#1.offset|)) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {8425#(and (or (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (< (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 8 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) (or (<= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 8 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) (forall ((v_arrayElimCell_33 Int)) (= (select |#valid| v_arrayElimCell_33) 1))))} is VALID [2022-02-21 00:00:28,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {8433#(and (or (<= (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 8)) (forall ((v_arrayElimCell_33 Int)) (= (select |#valid| v_arrayElimCell_33) 1))) (or (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (< (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 8))))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {8429#(and (or (forall ((v_arrayElimCell_33 Int)) (= (select |#valid| v_arrayElimCell_33) 1)) (<= (select |#length| |ULTIMATE.start_node_create_#res#1.base|) (+ 8 |ULTIMATE.start_node_create_#res#1.offset|))) (or (< (select |#length| |ULTIMATE.start_node_create_#res#1.base|) (+ 8 |ULTIMATE.start_node_create_#res#1.offset|)) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)))} is VALID [2022-02-21 00:00:28,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {8433#(and (or (<= (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 8)) (forall ((v_arrayElimCell_33 Int)) (= (select |#valid| v_arrayElimCell_33) 1))) (or (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (< (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 8))))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {8433#(and (or (<= (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 8)) (forall ((v_arrayElimCell_33 Int)) (= (select |#valid| v_arrayElimCell_33) 1))) (or (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (< (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 8))))} is VALID [2022-02-21 00:00:28,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {8433#(and (or (<= (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 8)) (forall ((v_arrayElimCell_33 Int)) (= (select |#valid| v_arrayElimCell_33) 1))) (or (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (< (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 8))))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {8433#(and (or (<= (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 8)) (forall ((v_arrayElimCell_33 Int)) (= (select |#valid| v_arrayElimCell_33) 1))) (or (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (< (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 8))))} is VALID [2022-02-21 00:00:28,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {8433#(and (or (<= (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 8)) (forall ((v_arrayElimCell_33 Int)) (= (select |#valid| v_arrayElimCell_33) 1))) (or (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (< (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 8))))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {8433#(and (or (<= (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 8)) (forall ((v_arrayElimCell_33 Int)) (= (select |#valid| v_arrayElimCell_33) 1))) (or (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (< (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 8))))} is VALID [2022-02-21 00:00:28,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {8446#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_19| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_19|) 0)) (forall ((v_ArrVal_983 Int)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_19| v_ArrVal_983) |ULTIMATE.start_sll_create_~head~0#1.base|) 1))))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {8433#(and (or (<= (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 8)) (forall ((v_arrayElimCell_33 Int)) (= (select |#valid| v_arrayElimCell_33) 1))) (or (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (< (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|) (+ |ULTIMATE.start_node_create_~temp~0#1.offset| 8))))} is VALID [2022-02-21 00:00:28,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {8446#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_19| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_19|) 0)) (forall ((v_ArrVal_983 Int)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_19| v_ArrVal_983) |ULTIMATE.start_sll_create_~head~0#1.base|) 1))))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {8446#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_19| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_19|) 0)) (forall ((v_ArrVal_983 Int)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_19| v_ArrVal_983) |ULTIMATE.start_sll_create_~head~0#1.base|) 1))))} is VALID [2022-02-21 00:00:28,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {8453#(forall ((v_ArrVal_983 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_19| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_19|) 0)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_19| v_ArrVal_983) |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {8446#(forall ((|v_ULTIMATE.start_node_create_~temp~0#1.base_19| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_19|) 0)) (forall ((v_ArrVal_983 Int)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_19| v_ArrVal_983) |ULTIMATE.start_sll_create_~head~0#1.base|) 1))))} is VALID [2022-02-21 00:00:28,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {8236#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {8453#(forall ((v_ArrVal_983 Int) (|v_ULTIMATE.start_node_create_~temp~0#1.base_19| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_19|) 0)) (= (select (store |#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_19| v_ArrVal_983) |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))} is VALID [2022-02-21 00:00:28,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {8236#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {8236#true} is VALID [2022-02-21 00:00:28,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {8236#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {8236#true} is VALID [2022-02-21 00:00:28,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {8236#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {8236#true} is VALID [2022-02-21 00:00:28,051 INFO L290 TraceCheckUtils]: 4: Hoare triple {8236#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {8236#true} is VALID [2022-02-21 00:00:28,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {8236#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {8236#true} is VALID [2022-02-21 00:00:28,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {8236#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {8236#true} is VALID [2022-02-21 00:00:28,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {8236#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {8236#true} is VALID [2022-02-21 00:00:28,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {8236#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(27, 2); {8236#true} is VALID [2022-02-21 00:00:28,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:00:28,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146025886] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:00:28,052 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:00:28,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 43 [2022-02-21 00:00:28,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285626703] [2022-02-21 00:00:28,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:00:28,055 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 44 states have internal predecessors, (93), 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) Word has length 34 [2022-02-21 00:00:28,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:28,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 44 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 44 states have internal predecessors, (93), 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-21 00:00:28,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:28,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-02-21 00:00:28,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:00:28,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-02-21 00:00:28,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1761, Unknown=0, NotChecked=0, Total=1892 [2022-02-21 00:00:28,142 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 44 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 44 states have internal predecessors, (93), 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-21 00:00:29,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:29,895 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2022-02-21 00:00:29,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-21 00:00:29,895 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 44 states have internal predecessors, (93), 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) Word has length 34 [2022-02-21 00:00:29,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 44 states have internal predecessors, (93), 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-21 00:00:29,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 78 transitions. [2022-02-21 00:00:29,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 44 states have internal predecessors, (93), 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-21 00:00:29,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 78 transitions. [2022-02-21 00:00:29,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 78 transitions. [2022-02-21 00:00:29,980 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-21 00:00:29,981 INFO L225 Difference]: With dead ends: 80 [2022-02-21 00:00:29,981 INFO L226 Difference]: Without dead ends: 80 [2022-02-21 00:00:29,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=336, Invalid=3086, Unknown=0, NotChecked=0, Total=3422 [2022-02-21 00:00:29,983 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 58 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 352 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:29,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 508 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 594 Invalid, 0 Unknown, 352 Unchecked, 0.4s Time] [2022-02-21 00:00:29,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-02-21 00:00:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-02-21 00:00:29,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:29,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 80 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 79 states have internal predecessors, (88), 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-21 00:00:29,985 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 80 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 79 states have internal predecessors, (88), 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-21 00:00:29,985 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 80 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 79 states have internal predecessors, (88), 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-21 00:00:29,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:29,986 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2022-02-21 00:00:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-02-21 00:00:29,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:29,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:29,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 79 states have internal predecessors, (88), 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 80 states. [2022-02-21 00:00:29,989 INFO L87 Difference]: Start difference. First operand has 80 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 79 states have internal predecessors, (88), 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 80 states. [2022-02-21 00:00:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:29,990 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2022-02-21 00:00:29,990 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-02-21 00:00:29,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:29,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:29,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:29,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 79 states have internal predecessors, (88), 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-21 00:00:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-02-21 00:00:29,993 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 34 [2022-02-21 00:00:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:29,993 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-02-21 00:00:29,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 44 states have internal predecessors, (93), 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-21 00:00:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-02-21 00:00:29,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-21 00:00:29,994 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:29,994 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] [2022-02-21 00:00:30,023 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-21 00:00:30,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:00:30,215 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-21 00:00:30,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:30,216 INFO L85 PathProgramCache]: Analyzing trace with hash -66070095, now seen corresponding path program 1 times [2022-02-21 00:00:30,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:30,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944997122] [2022-02-21 00:00:30,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:30,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:30,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {8831#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(27, 2); {8831#true} is VALID [2022-02-21 00:00:30,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {8831#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {8831#true} is VALID [2022-02-21 00:00:30,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {8831#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,349 INFO L290 TraceCheckUtils]: 3: Hoare triple {8831#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {8831#true} is VALID [2022-02-21 00:00:30,349 INFO L290 TraceCheckUtils]: 4: Hoare triple {8831#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {8831#true} is VALID [2022-02-21 00:00:30,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {8831#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {8831#true} is VALID [2022-02-21 00:00:30,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {8831#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {8831#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {8831#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {8831#true} is VALID [2022-02-21 00:00:30,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {8831#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {8831#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {8831#true} is VALID [2022-02-21 00:00:30,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {8831#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {8831#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {8831#true} is VALID [2022-02-21 00:00:30,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {8831#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {8833#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {8833#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {8833#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {8833#(= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {8834#(= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1)} is VALID [2022-02-21 00:00:30,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {8834#(= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {8835#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {8835#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {8835#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {8835#(= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {8836#(= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {8836#(= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {8836#(= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {8836#(= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)} assume !(sll_create_~len#1 > 0); {8836#(= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {8836#(= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {8837#(= (select |#valid| |ULTIMATE.start_sll_create_#res#1.base|) 1)} is VALID [2022-02-21 00:00:30,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {8837#(= (select |#valid| |ULTIMATE.start_sll_create_#res#1.base|) 1)} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {8838#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 1)} is VALID [2022-02-21 00:00:30,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {8838#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 1)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {8839#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-21 00:00:30,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {8839#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 1)} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {8839#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-21 00:00:30,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {8839#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 1)} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {8839#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-21 00:00:30,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {8839#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 1)} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {8839#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 1)} is VALID [2022-02-21 00:00:30,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {8839#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 1)} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {8840#(= (select |#valid| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 1)} is VALID [2022-02-21 00:00:30,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {8840#(= (select |#valid| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 1)} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {8841#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {8841#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 1)} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {8841#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {8841#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 1)} assume !!(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset; {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} SUMMARY for call sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L601 {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset;havoc sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset; {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} assume !(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset; {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} assume !(1 == #valid[sll_remove_last_~snd_to_last~0#1.base]); {8832#false} is VALID [2022-02-21 00:00:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 00:00:30,376 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:00:30,376 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944997122] [2022-02-21 00:00:30,376 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944997122] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:00:30,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546357785] [2022-02-21 00:00:30,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:30,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:00:30,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:00:30,378 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-21 00:00:30,406 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-21 00:00:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:30,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 00:00:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:30,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:30,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-02-21 00:00:30,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {8831#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(27, 2); {8831#true} is VALID [2022-02-21 00:00:30,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {8831#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {8831#true} is VALID [2022-02-21 00:00:30,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {8831#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {8831#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {8831#true} is VALID [2022-02-21 00:00:30,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {8831#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {8831#true} is VALID [2022-02-21 00:00:30,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {8831#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {8831#true} is VALID [2022-02-21 00:00:30,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {8831#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {8831#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {8831#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {8831#true} is VALID [2022-02-21 00:00:30,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {8831#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {8831#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {8831#true} is VALID [2022-02-21 00:00:30,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {8831#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {8831#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {8831#true} is VALID [2022-02-21 00:00:30,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {8831#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {8831#true} is VALID [2022-02-21 00:00:30,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {8831#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {8831#true} is VALID [2022-02-21 00:00:30,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {8831#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {8831#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {8831#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {8831#true} is VALID [2022-02-21 00:00:30,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {8831#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {8831#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {8831#true} is VALID [2022-02-21 00:00:30,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {8831#true} assume !(sll_create_~len#1 > 0); {8831#true} is VALID [2022-02-21 00:00:30,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {8831#true} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {8831#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {8831#true} is VALID [2022-02-21 00:00:30,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {8831#true} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {8831#true} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {8831#true} is VALID [2022-02-21 00:00:30,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {8831#true} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {8831#true} is VALID [2022-02-21 00:00:30,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {8831#true} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {8831#true} is VALID [2022-02-21 00:00:30,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {8831#true} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {8831#true} is VALID [2022-02-21 00:00:30,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {8831#true} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {8831#true} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {8841#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,627 INFO L290 TraceCheckUtils]: 30: Hoare triple {8841#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 1)} assume !!(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset; {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,627 INFO L290 TraceCheckUtils]: 31: Hoare triple {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} SUMMARY for call sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L601 {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,628 INFO L290 TraceCheckUtils]: 32: Hoare triple {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset;havoc sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset; {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,628 INFO L290 TraceCheckUtils]: 33: Hoare triple {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,628 INFO L290 TraceCheckUtils]: 34: Hoare triple {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} assume !(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset; {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,629 INFO L290 TraceCheckUtils]: 35: Hoare triple {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} assume !(1 == #valid[sll_remove_last_~snd_to_last~0#1.base]); {8832#false} is VALID [2022-02-21 00:00:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 00:00:30,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:00:30,684 INFO L290 TraceCheckUtils]: 35: Hoare triple {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} assume !(1 == #valid[sll_remove_last_~snd_to_last~0#1.base]); {8832#false} is VALID [2022-02-21 00:00:30,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} assume !(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset; {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,685 INFO L290 TraceCheckUtils]: 33: Hoare triple {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,685 INFO L290 TraceCheckUtils]: 32: Hoare triple {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset;havoc sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset; {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} SUMMARY for call sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L601 {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {8841#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 1)} assume !!(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset; {8842#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {8831#true} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {8841#(= (select |#valid| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 1)} is VALID [2022-02-21 00:00:30,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {8831#true} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {8831#true} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {8831#true} is VALID [2022-02-21 00:00:30,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {8831#true} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {8831#true} is VALID [2022-02-21 00:00:30,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {8831#true} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {8831#true} is VALID [2022-02-21 00:00:30,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {8831#true} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {8831#true} is VALID [2022-02-21 00:00:30,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {8831#true} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {8831#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {8831#true} is VALID [2022-02-21 00:00:30,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {8831#true} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {8831#true} assume !(sll_create_~len#1 > 0); {8831#true} is VALID [2022-02-21 00:00:30,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {8831#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {8831#true} is VALID [2022-02-21 00:00:30,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {8831#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {8831#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {8831#true} is VALID [2022-02-21 00:00:30,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {8831#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {8831#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {8831#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {8831#true} is VALID [2022-02-21 00:00:30,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {8831#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {8831#true} is VALID [2022-02-21 00:00:30,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {8831#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {8831#true} is VALID [2022-02-21 00:00:30,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {8831#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {8831#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {8831#true} is VALID [2022-02-21 00:00:30,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {8831#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {8831#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {8831#true} is VALID [2022-02-21 00:00:30,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {8831#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {8831#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {8831#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {8831#true} is VALID [2022-02-21 00:00:30,691 INFO L290 TraceCheckUtils]: 4: Hoare triple {8831#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {8831#true} is VALID [2022-02-21 00:00:30,691 INFO L290 TraceCheckUtils]: 3: Hoare triple {8831#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {8831#true} is VALID [2022-02-21 00:00:30,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {8831#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {8831#true} is VALID [2022-02-21 00:00:30,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {8831#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {8831#true} is VALID [2022-02-21 00:00:30,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {8831#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(27, 2); {8831#true} is VALID [2022-02-21 00:00:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 00:00:30,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546357785] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:00:30,692 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:00:30,692 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 3, 3] total 11 [2022-02-21 00:00:30,692 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959672755] [2022-02-21 00:00:30,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:00:30,693 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 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) Word has length 36 [2022-02-21 00:00:30,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:30,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 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-21 00:00:30,724 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-21 00:00:30,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 00:00:30,725 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:00:30,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 00:00:30,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-02-21 00:00:30,726 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 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-21 00:00:31,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:31,526 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-02-21 00:00:31,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-21 00:00:31,526 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 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) Word has length 36 [2022-02-21 00:00:31,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 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-21 00:00:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 93 transitions. [2022-02-21 00:00:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 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-21 00:00:31,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 93 transitions. [2022-02-21 00:00:31,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 93 transitions. [2022-02-21 00:00:31,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:31,596 INFO L225 Difference]: With dead ends: 94 [2022-02-21 00:00:31,596 INFO L226 Difference]: Without dead ends: 94 [2022-02-21 00:00:31,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2022-02-21 00:00:31,597 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 207 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:31,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 209 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 00:00:31,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-21 00:00:31,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 79. [2022-02-21 00:00:31,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:31,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 79 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 78 states have internal predecessors, (86), 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-21 00:00:31,600 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 79 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 78 states have internal predecessors, (86), 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-21 00:00:31,600 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 79 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 78 states have internal predecessors, (86), 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-21 00:00:31,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:31,602 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-02-21 00:00:31,602 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-02-21 00:00:31,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:31,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:31,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 78 states have internal predecessors, (86), 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 94 states. [2022-02-21 00:00:31,603 INFO L87 Difference]: Start difference. First operand has 79 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 78 states have internal predecessors, (86), 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 94 states. [2022-02-21 00:00:31,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:31,604 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-02-21 00:00:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-02-21 00:00:31,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:31,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:31,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:31,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:31,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 78 states have internal predecessors, (86), 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-21 00:00:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2022-02-21 00:00:31,606 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 36 [2022-02-21 00:00:31,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:31,607 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2022-02-21 00:00:31,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 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-21 00:00:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2022-02-21 00:00:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-21 00:00:31,607 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:31,607 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] [2022-02-21 00:00:31,627 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-21 00:00:31,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:00:31,816 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-21 00:00:31,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:31,816 INFO L85 PathProgramCache]: Analyzing trace with hash -66070094, now seen corresponding path program 1 times [2022-02-21 00:00:31,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:31,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411557824] [2022-02-21 00:00:31,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:31,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:31,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {9444#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(27, 2); {9444#true} is VALID [2022-02-21 00:00:31,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {9444#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {9444#true} is VALID [2022-02-21 00:00:31,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {9444#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {9444#true} is VALID [2022-02-21 00:00:31,989 INFO L290 TraceCheckUtils]: 3: Hoare triple {9444#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {9444#true} is VALID [2022-02-21 00:00:31,989 INFO L290 TraceCheckUtils]: 4: Hoare triple {9444#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {9444#true} is VALID [2022-02-21 00:00:31,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {9444#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {9444#true} is VALID [2022-02-21 00:00:31,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {9444#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {9444#true} is VALID [2022-02-21 00:00:31,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {9444#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {9444#true} is VALID [2022-02-21 00:00:31,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {9444#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {9444#true} is VALID [2022-02-21 00:00:31,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {9444#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {9444#true} is VALID [2022-02-21 00:00:31,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {9444#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {9444#true} is VALID [2022-02-21 00:00:31,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {9444#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {9446#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:31,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {9446#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {9446#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:31,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {9446#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {9446#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:31,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {9446#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {9446#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:31,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {9446#(and (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {9447#(and (= 8 (select |#length| |ULTIMATE.start_node_create_#res#1.base|)) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} is VALID [2022-02-21 00:00:31,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {9447#(and (= 8 (select |#length| |ULTIMATE.start_node_create_#res#1.base|)) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {9448#(and (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-21 00:00:31,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {9448#(and (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {9448#(and (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-21 00:00:31,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {9448#(and (= (select |#length| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {9449#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:31,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {9449#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {9449#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:31,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {9449#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} assume !(sll_create_~len#1 > 0); {9449#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:31,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {9449#(and (= (select |#length| |ULTIMATE.start_sll_create_~head~0#1.base|) 8) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {9450#(and (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_create_#res#1.base|) 8))} is VALID [2022-02-21 00:00:31,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {9450#(and (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_create_#res#1.base|) 8))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {9451#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8))} is VALID [2022-02-21 00:00:31,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {9451#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 8))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {9452#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 8))} is VALID [2022-02-21 00:00:31,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {9452#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 8))} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {9452#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 8))} is VALID [2022-02-21 00:00:31,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {9452#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 8))} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {9452#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 8))} is VALID [2022-02-21 00:00:32,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {9452#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 8))} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {9452#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 8))} is VALID [2022-02-21 00:00:32,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {9452#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 8))} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {9453#(and (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 8))} is VALID [2022-02-21 00:00:32,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {9453#(and (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 8))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {9454#(and (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 8))} is VALID [2022-02-21 00:00:32,005 INFO L290 TraceCheckUtils]: 29: Hoare triple {9454#(and (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 8))} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {9454#(and (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 8))} is VALID [2022-02-21 00:00:32,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {9454#(and (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) 8))} assume !!(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset; {9455#(and (= |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) (- 8)) 0))} is VALID [2022-02-21 00:00:32,006 INFO L290 TraceCheckUtils]: 31: Hoare triple {9455#(and (= |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) (- 8)) 0))} SUMMARY for call sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L601 {9455#(and (= |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) (- 8)) 0))} is VALID [2022-02-21 00:00:32,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {9455#(and (= |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) (- 8)) 0))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset;havoc sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset; {9455#(and (= |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) (- 8)) 0))} is VALID [2022-02-21 00:00:32,007 INFO L290 TraceCheckUtils]: 33: Hoare triple {9455#(and (= |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) (- 8)) 0))} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {9455#(and (= |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) (- 8)) 0))} is VALID [2022-02-21 00:00:32,008 INFO L290 TraceCheckUtils]: 34: Hoare triple {9455#(and (= |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) (- 8)) 0))} assume !(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset; {9455#(and (= |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) (- 8)) 0))} is VALID [2022-02-21 00:00:32,008 INFO L290 TraceCheckUtils]: 35: Hoare triple {9455#(and (= |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|) (- 8)) 0))} assume !(4 + (4 + sll_remove_last_~snd_to_last~0#1.offset) <= #length[sll_remove_last_~snd_to_last~0#1.base] && 0 <= 4 + sll_remove_last_~snd_to_last~0#1.offset); {9445#false} is VALID [2022-02-21 00:00:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 00:00:32,009 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:00:32,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411557824] [2022-02-21 00:00:32,009 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411557824] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:00:32,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728740497] [2022-02-21 00:00:32,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:32,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:00:32,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:00:32,011 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-21 00:00:32,013 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-21 00:00:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:32,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 00:00:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:32,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:32,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-02-21 00:00:32,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {9444#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(27, 2); {9444#true} is VALID [2022-02-21 00:00:32,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {9444#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {9444#true} is VALID [2022-02-21 00:00:32,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {9444#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,298 INFO L290 TraceCheckUtils]: 3: Hoare triple {9444#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {9444#true} is VALID [2022-02-21 00:00:32,298 INFO L290 TraceCheckUtils]: 4: Hoare triple {9444#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {9444#true} is VALID [2022-02-21 00:00:32,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {9444#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {9444#true} is VALID [2022-02-21 00:00:32,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {9444#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {9444#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {9444#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {9444#true} is VALID [2022-02-21 00:00:32,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {9444#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {9444#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {9444#true} is VALID [2022-02-21 00:00:32,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {9444#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {9444#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {9444#true} is VALID [2022-02-21 00:00:32,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {9444#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {9444#true} is VALID [2022-02-21 00:00:32,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {9444#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {9444#true} is VALID [2022-02-21 00:00:32,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {9444#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {9444#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {9444#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {9444#true} is VALID [2022-02-21 00:00:32,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {9444#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {9444#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {9444#true} is VALID [2022-02-21 00:00:32,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {9444#true} assume !(sll_create_~len#1 > 0); {9444#true} is VALID [2022-02-21 00:00:32,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {9444#true} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {9444#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {9444#true} is VALID [2022-02-21 00:00:32,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {9444#true} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {9444#true} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {9444#true} is VALID [2022-02-21 00:00:32,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {9444#true} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {9444#true} is VALID [2022-02-21 00:00:32,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {9444#true} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {9444#true} is VALID [2022-02-21 00:00:32,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {9444#true} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {9444#true} is VALID [2022-02-21 00:00:32,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {9444#true} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {9444#true} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {9546#(and (<= (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)))} is VALID [2022-02-21 00:00:32,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {9546#(and (<= (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)))} assume !!(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset; {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-21 00:00:32,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} SUMMARY for call sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L601 {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-21 00:00:32,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset;havoc sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset; {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-21 00:00:32,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-21 00:00:32,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} assume !(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset; {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-21 00:00:32,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} assume !(4 + (4 + sll_remove_last_~snd_to_last~0#1.offset) <= #length[sll_remove_last_~snd_to_last~0#1.base] && 0 <= 4 + sll_remove_last_~snd_to_last~0#1.offset); {9445#false} is VALID [2022-02-21 00:00:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 00:00:32,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:00:32,441 INFO L290 TraceCheckUtils]: 35: Hoare triple {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} assume !(4 + (4 + sll_remove_last_~snd_to_last~0#1.offset) <= #length[sll_remove_last_~snd_to_last~0#1.base] && 0 <= 4 + sll_remove_last_~snd_to_last~0#1.offset); {9445#false} is VALID [2022-02-21 00:00:32,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} assume !(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset; {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-21 00:00:32,443 INFO L290 TraceCheckUtils]: 33: Hoare triple {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-21 00:00:32,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset;havoc sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset; {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-21 00:00:32,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} SUMMARY for call sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L601 {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-21 00:00:32,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {9546#(and (<= (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)))} assume !!(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset; {9550#(and (<= (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~snd_to_last~0#1.offset| 4)))} is VALID [2022-02-21 00:00:32,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {9444#true} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {9546#(and (<= (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 8) (select |#length| |ULTIMATE.start_sll_remove_last_~last~0#1.base|)) (<= 0 (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)))} is VALID [2022-02-21 00:00:32,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {9444#true} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {9444#true} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {9444#true} is VALID [2022-02-21 00:00:32,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {9444#true} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {9444#true} is VALID [2022-02-21 00:00:32,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {9444#true} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {9444#true} is VALID [2022-02-21 00:00:32,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {9444#true} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {9444#true} is VALID [2022-02-21 00:00:32,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {9444#true} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {9444#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {9444#true} is VALID [2022-02-21 00:00:32,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {9444#true} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {9444#true} assume !(sll_create_~len#1 > 0); {9444#true} is VALID [2022-02-21 00:00:32,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {9444#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {9444#true} is VALID [2022-02-21 00:00:32,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {9444#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {9444#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {9444#true} is VALID [2022-02-21 00:00:32,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {9444#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {9444#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {9444#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {9444#true} is VALID [2022-02-21 00:00:32,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {9444#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {9444#true} is VALID [2022-02-21 00:00:32,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {9444#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {9444#true} is VALID [2022-02-21 00:00:32,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {9444#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {9444#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {9444#true} is VALID [2022-02-21 00:00:32,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {9444#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {9444#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {9444#true} is VALID [2022-02-21 00:00:32,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {9444#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {9444#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {9444#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {9444#true} is VALID [2022-02-21 00:00:32,449 INFO L290 TraceCheckUtils]: 4: Hoare triple {9444#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {9444#true} is VALID [2022-02-21 00:00:32,449 INFO L290 TraceCheckUtils]: 3: Hoare triple {9444#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {9444#true} is VALID [2022-02-21 00:00:32,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {9444#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {9444#true} is VALID [2022-02-21 00:00:32,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {9444#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {9444#true} is VALID [2022-02-21 00:00:32,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {9444#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(27, 2); {9444#true} is VALID [2022-02-21 00:00:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 00:00:32,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728740497] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:00:32,450 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:00:32,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 3, 3] total 13 [2022-02-21 00:00:32,451 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655203782] [2022-02-21 00:00:32,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:00:32,451 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 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) Word has length 36 [2022-02-21 00:00:32,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:32,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 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-21 00:00:32,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:32,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 00:00:32,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:00:32,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 00:00:32,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-02-21 00:00:32,499 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 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-21 00:00:33,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:33,792 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-02-21 00:00:33,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-21 00:00:33,793 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 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) Word has length 36 [2022-02-21 00:00:33,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 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-21 00:00:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 118 transitions. [2022-02-21 00:00:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 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-21 00:00:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 118 transitions. [2022-02-21 00:00:33,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 118 transitions. [2022-02-21 00:00:33,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:33,935 INFO L225 Difference]: With dead ends: 111 [2022-02-21 00:00:33,935 INFO L226 Difference]: Without dead ends: 111 [2022-02-21 00:00:33,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=301, Invalid=691, Unknown=0, NotChecked=0, Total=992 [2022-02-21 00:00:33,936 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 475 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:33,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 174 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 00:00:33,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-21 00:00:33,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 78. [2022-02-21 00:00:33,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:33,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 78 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 77 states have internal predecessors, (84), 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-21 00:00:33,938 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 78 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 77 states have internal predecessors, (84), 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-21 00:00:33,938 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 78 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 77 states have internal predecessors, (84), 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-21 00:00:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:33,940 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-02-21 00:00:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2022-02-21 00:00:33,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:33,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:33,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 77 states have internal predecessors, (84), 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 111 states. [2022-02-21 00:00:33,941 INFO L87 Difference]: Start difference. First operand has 78 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 77 states have internal predecessors, (84), 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 111 states. [2022-02-21 00:00:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:33,942 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-02-21 00:00:33,942 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2022-02-21 00:00:33,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:33,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:33,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:33,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:33,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 77 states have internal predecessors, (84), 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-21 00:00:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2022-02-21 00:00:33,944 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 36 [2022-02-21 00:00:33,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:33,944 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2022-02-21 00:00:33,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 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-21 00:00:33,944 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-02-21 00:00:33,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-21 00:00:33,945 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:33,945 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] [2022-02-21 00:00:33,972 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-21 00:00:34,145 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,SelfDestructingSolverStorable21 [2022-02-21 00:00:34,146 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-21 00:00:34,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:34,146 INFO L85 PathProgramCache]: Analyzing trace with hash -897341486, now seen corresponding path program 1 times [2022-02-21 00:00:34,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:34,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908912356] [2022-02-21 00:00:34,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:34,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:34,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {10120#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(27, 2); {10120#true} is VALID [2022-02-21 00:00:34,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {10120#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {10120#true} is VALID [2022-02-21 00:00:34,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {10120#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {10120#true} is VALID [2022-02-21 00:00:34,187 INFO L290 TraceCheckUtils]: 3: Hoare triple {10120#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {10120#true} is VALID [2022-02-21 00:00:34,187 INFO L290 TraceCheckUtils]: 4: Hoare triple {10120#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {10120#true} is VALID [2022-02-21 00:00:34,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {10120#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {10120#true} is VALID [2022-02-21 00:00:34,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {10120#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {10120#true} is VALID [2022-02-21 00:00:34,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {10120#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {10120#true} is VALID [2022-02-21 00:00:34,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {10120#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {10120#true} is VALID [2022-02-21 00:00:34,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {10120#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {10120#true} is VALID [2022-02-21 00:00:34,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {10120#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {10120#true} is VALID [2022-02-21 00:00:34,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {10120#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {10120#true} is VALID [2022-02-21 00:00:34,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {10120#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {10120#true} is VALID [2022-02-21 00:00:34,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {10120#true} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {10120#true} is VALID [2022-02-21 00:00:34,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {10120#true} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {10120#true} is VALID [2022-02-21 00:00:34,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {10120#true} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {10120#true} is VALID [2022-02-21 00:00:34,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {10120#true} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {10120#true} is VALID [2022-02-21 00:00:34,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {10120#true} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {10120#true} is VALID [2022-02-21 00:00:34,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {10120#true} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {10120#true} is VALID [2022-02-21 00:00:34,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {10120#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {10120#true} is VALID [2022-02-21 00:00:34,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {10120#true} assume !(sll_create_~len#1 > 0); {10120#true} is VALID [2022-02-21 00:00:34,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {10120#true} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {10120#true} is VALID [2022-02-21 00:00:34,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {10120#true} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {10120#true} is VALID [2022-02-21 00:00:34,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {10120#true} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {10122#(= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:34,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {10122#(= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {10122#(= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:34,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {10122#(= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {10122#(= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:34,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {10122#(= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} assume 0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset; {10122#(= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:34,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {10122#(= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L594 {10122#(= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:34,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {10122#(= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} assume 0 == sll_remove_last_#t~mem8#1.offset; {10122#(= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:34,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {10122#(= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} assume sll_remove_last_#t~mem8#1.base < #StackHeapBarrier; {10122#(= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:34,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {10122#(= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} assume 0 == sll_remove_last_#t~mem8#1.base || 1 == #valid[sll_remove_last_#t~mem8#1.base];call ULTIMATE.dealloc(sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset);havoc sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset; {10122#(= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-21 00:00:34,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {10122#(= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)} SUMMARY for call write~$Pointer$(0, 0, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L595 {10123#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-21 00:00:34,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {10123#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume { :end_inline_sll_remove_last } true; {10123#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-21 00:00:34,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {10123#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {10123#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-21 00:00:34,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {10123#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(main_~i~0#1 >= 0); {10123#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} is VALID [2022-02-21 00:00:34,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {10123#(= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)} assume !(1 == #valid[main_~#s~0#1.base]); {10121#false} is VALID [2022-02-21 00:00:34,195 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 00:00:34,195 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:00:34,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908912356] [2022-02-21 00:00:34,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908912356] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:00:34,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:00:34,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:00:34,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128275247] [2022-02-21 00:00:34,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:00:34,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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) Word has length 36 [2022-02-21 00:00:34,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:34,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-21 00:00:34,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:34,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 00:00:34,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:00:34,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 00:00:34,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 00:00:34,216 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-21 00:00:34,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:34,312 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2022-02-21 00:00:34,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 00:00:34,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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) Word has length 36 [2022-02-21 00:00:34,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-21 00:00:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-02-21 00:00:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-21 00:00:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-02-21 00:00:34,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-02-21 00:00:34,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:34,366 INFO L225 Difference]: With dead ends: 83 [2022-02-21 00:00:34,366 INFO L226 Difference]: Without dead ends: 83 [2022-02-21 00:00:34,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 00:00:34,366 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 70 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:34,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 42 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:00:34,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-02-21 00:00:34,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-02-21 00:00:34,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:34,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 72 states have (on average 1.25) internal successors, (90), 82 states have internal predecessors, (90), 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-21 00:00:34,368 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 72 states have (on average 1.25) internal successors, (90), 82 states have internal predecessors, (90), 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-21 00:00:34,368 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 72 states have (on average 1.25) internal successors, (90), 82 states have internal predecessors, (90), 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-21 00:00:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:34,369 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2022-02-21 00:00:34,369 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2022-02-21 00:00:34,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:34,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:34,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 72 states have (on average 1.25) internal successors, (90), 82 states have internal predecessors, (90), 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 83 states. [2022-02-21 00:00:34,370 INFO L87 Difference]: Start difference. First operand has 83 states, 72 states have (on average 1.25) internal successors, (90), 82 states have internal predecessors, (90), 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 83 states. [2022-02-21 00:00:34,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:34,371 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2022-02-21 00:00:34,371 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2022-02-21 00:00:34,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:34,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:34,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:34,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.25) internal successors, (90), 82 states have internal predecessors, (90), 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-21 00:00:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2022-02-21 00:00:34,372 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 36 [2022-02-21 00:00:34,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:34,373 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2022-02-21 00:00:34,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-21 00:00:34,373 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2022-02-21 00:00:34,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-21 00:00:34,373 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:34,374 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-21 00:00:34,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-21 00:00:34,374 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-21 00:00:34,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:34,374 INFO L85 PathProgramCache]: Analyzing trace with hash -2047782270, now seen corresponding path program 1 times [2022-02-21 00:00:34,374 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:34,375 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456712304] [2022-02-21 00:00:34,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:34,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:34,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {10460#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(27, 2); {10460#true} is VALID [2022-02-21 00:00:34,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {10460#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {10460#true} is VALID [2022-02-21 00:00:34,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {10460#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {10462#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} is VALID [2022-02-21 00:00:34,662 INFO L290 TraceCheckUtils]: 3: Hoare triple {10462#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {10462#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} is VALID [2022-02-21 00:00:34,662 INFO L290 TraceCheckUtils]: 4: Hoare triple {10462#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {10462#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} is VALID [2022-02-21 00:00:34,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {10462#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {10462#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} is VALID [2022-02-21 00:00:34,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {10462#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {10463#(not (= |ULTIMATE.start_node_create_#res#1.base| 0))} is VALID [2022-02-21 00:00:34,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {10463#(not (= |ULTIMATE.start_node_create_#res#1.base| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {10464#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-21 00:00:34,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {10464#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {10464#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-21 00:00:34,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {10464#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {10465#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-21 00:00:34,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {10465#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {10465#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-21 00:00:34,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {10465#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {10466#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:34,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {10466#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {10466#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:34,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {10466#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {10466#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:34,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {10466#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {10466#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:34,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {10466#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {10467#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} is VALID [2022-02-21 00:00:34,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {10467#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {10468#(and (= (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) 4) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)))} is VALID [2022-02-21 00:00:34,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {10468#(and (= (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) 4) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {10469#(and (= (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) 4) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 0)))} is VALID [2022-02-21 00:00:34,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {10469#(and (= (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) 4) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 0)))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {10470#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-21 00:00:34,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {10470#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {10470#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-21 00:00:34,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {10470#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} assume !(sll_create_~len#1 > 0); {10470#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-21 00:00:34,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {10470#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {10471#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0))} is VALID [2022-02-21 00:00:34,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {10471#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {10472#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} is VALID [2022-02-21 00:00:34,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {10472#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {10473#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0)) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:34,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {10473#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0)) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {10474#(and (or (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem6#1.base|) (+ |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| 4)) 0)) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| 0))) (or (= |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| 0)))} is VALID [2022-02-21 00:00:34,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {10474#(and (or (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem6#1.base|) (+ |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| 4)) 0)) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| 0))) (or (= |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| 0)))} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {10475#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) (and (not (= |ULTIMATE.start_sll_remove_last_#t~mem7#1.base| 0)) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-21 00:00:34,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {10475#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) (and (not (= |ULTIMATE.start_sll_remove_last_#t~mem7#1.base| 0)) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume 0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset; {10476#(not (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)))} is VALID [2022-02-21 00:00:34,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {10476#(not (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)))} SUMMARY for call sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L594 {10477#(not (= |ULTIMATE.start_sll_remove_last_#t~mem8#1.offset| 0))} is VALID [2022-02-21 00:00:34,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {10477#(not (= |ULTIMATE.start_sll_remove_last_#t~mem8#1.offset| 0))} assume 0 == sll_remove_last_#t~mem8#1.offset; {10461#false} is VALID [2022-02-21 00:00:34,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {10461#false} assume sll_remove_last_#t~mem8#1.base < #StackHeapBarrier; {10461#false} is VALID [2022-02-21 00:00:34,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {10461#false} assume 0 == sll_remove_last_#t~mem8#1.base || 1 == #valid[sll_remove_last_#t~mem8#1.base];call ULTIMATE.dealloc(sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset);havoc sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset; {10461#false} is VALID [2022-02-21 00:00:34,673 INFO L290 TraceCheckUtils]: 31: Hoare triple {10461#false} SUMMARY for call write~$Pointer$(0, 0, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L595 {10461#false} is VALID [2022-02-21 00:00:34,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {10461#false} assume { :end_inline_sll_remove_last } true; {10461#false} is VALID [2022-02-21 00:00:34,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {10461#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {10461#false} is VALID [2022-02-21 00:00:34,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {10461#false} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {10461#false} is VALID [2022-02-21 00:00:34,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {10461#false} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {10461#false} is VALID [2022-02-21 00:00:34,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {10461#false} assume !(1 == #valid[sll_remove_last_#t~mem6#1.base]); {10461#false} is VALID [2022-02-21 00:00:34,674 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:00:34,674 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:00:34,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456712304] [2022-02-21 00:00:34,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456712304] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:00:34,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121903699] [2022-02-21 00:00:34,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:34,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:00:34,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:00:34,675 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:00:34,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-21 00:00:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:34,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 53 conjunts are in the unsatisfiable core [2022-02-21 00:00:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:34,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:35,057 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-21 00:00:35,273 INFO L356 Elim1Store]: treesize reduction 6, result has 83.8 percent of original size [2022-02-21 00:00:35,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 44 [2022-02-21 00:00:35,374 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-21 00:00:35,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {10460#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(27, 2); {10460#true} is VALID [2022-02-21 00:00:35,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {10460#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {10484#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} is VALID [2022-02-21 00:00:35,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {10484#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {10488#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0)))} is VALID [2022-02-21 00:00:35,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {10488#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0)))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {10488#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0)))} is VALID [2022-02-21 00:00:35,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {10488#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0)))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {10488#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0)))} is VALID [2022-02-21 00:00:35,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {10488#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0)))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {10488#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0)))} is VALID [2022-02-21 00:00:35,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {10488#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0)))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {10501#(and (not (= |ULTIMATE.start_node_create_#res#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:35,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {10501#(and (not (= |ULTIMATE.start_node_create_#res#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {10505#(and (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:35,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {10505#(and (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {10505#(and (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:35,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {10505#(and (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {10512#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:35,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {10512#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {10512#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:35,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {10512#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {10519#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:35,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {10519#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {10519#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:35,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {10519#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {10519#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:35,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {10519#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {10519#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:35,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {10519#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {10532#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:35,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {10532#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {10536#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-21 00:00:35,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {10536#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {10540#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:35,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {10540#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {10544#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:35,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {10544#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {10544#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:35,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {10544#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(sll_create_~len#1 > 0); {10544#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:35,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {10544#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {10554#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:35,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {10554#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {10558#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0)))} is VALID [2022-02-21 00:00:35,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {10558#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0)))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {10562#(and (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) 0)) (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:35,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {10562#(and (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) 0)) (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {10566#(and (= |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) |ULTIMATE.start_sll_remove_last_#t~mem6#1.base|) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) 0)) (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:35,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {10566#(and (= |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|) |ULTIMATE.start_sll_remove_last_#t~mem6#1.base|) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4) 0)) (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {10570#(and (or (not (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) (not (= |ULTIMATE.start_sll_remove_last_#t~mem7#1.base| 0))) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:35,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {10570#(and (or (not (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) (not (= |ULTIMATE.start_sll_remove_last_#t~mem7#1.base| 0))) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} assume 0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset; {10574#(and (not (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-21 00:00:35,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {10574#(and (not (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (= |ULTIMATE.start_sll_remove_last_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} SUMMARY for call sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L594 {10477#(not (= |ULTIMATE.start_sll_remove_last_#t~mem8#1.offset| 0))} is VALID [2022-02-21 00:00:35,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {10477#(not (= |ULTIMATE.start_sll_remove_last_#t~mem8#1.offset| 0))} assume 0 == sll_remove_last_#t~mem8#1.offset; {10461#false} is VALID [2022-02-21 00:00:35,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {10461#false} assume sll_remove_last_#t~mem8#1.base < #StackHeapBarrier; {10461#false} is VALID [2022-02-21 00:00:35,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {10461#false} assume 0 == sll_remove_last_#t~mem8#1.base || 1 == #valid[sll_remove_last_#t~mem8#1.base];call ULTIMATE.dealloc(sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset);havoc sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset; {10461#false} is VALID [2022-02-21 00:00:35,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {10461#false} SUMMARY for call write~$Pointer$(0, 0, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L595 {10461#false} is VALID [2022-02-21 00:00:35,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {10461#false} assume { :end_inline_sll_remove_last } true; {10461#false} is VALID [2022-02-21 00:00:35,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {10461#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {10461#false} is VALID [2022-02-21 00:00:35,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {10461#false} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {10461#false} is VALID [2022-02-21 00:00:35,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {10461#false} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {10461#false} is VALID [2022-02-21 00:00:35,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {10461#false} assume !(1 == #valid[sll_remove_last_#t~mem6#1.base]); {10461#false} is VALID [2022-02-21 00:00:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:00:35,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:00:35,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-02-21 00:00:35,733 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 00:00:35,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 147 [2022-02-21 00:00:36,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {10461#false} assume !(1 == #valid[sll_remove_last_#t~mem6#1.base]); {10461#false} is VALID [2022-02-21 00:00:36,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {10461#false} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {10461#false} is VALID [2022-02-21 00:00:36,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {10461#false} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {10461#false} is VALID [2022-02-21 00:00:36,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {10461#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := main_#t~post13#1 - 1;havoc main_#t~post13#1; {10461#false} is VALID [2022-02-21 00:00:36,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {10461#false} assume { :end_inline_sll_remove_last } true; {10461#false} is VALID [2022-02-21 00:00:36,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {10461#false} SUMMARY for call write~$Pointer$(0, 0, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L595 {10461#false} is VALID [2022-02-21 00:00:36,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {10461#false} assume 0 == sll_remove_last_#t~mem8#1.base || 1 == #valid[sll_remove_last_#t~mem8#1.base];call ULTIMATE.dealloc(sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset);havoc sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset; {10461#false} is VALID [2022-02-21 00:00:36,160 INFO L290 TraceCheckUtils]: 29: Hoare triple {10461#false} assume sll_remove_last_#t~mem8#1.base < #StackHeapBarrier; {10461#false} is VALID [2022-02-21 00:00:36,160 INFO L290 TraceCheckUtils]: 28: Hoare triple {10477#(not (= |ULTIMATE.start_sll_remove_last_#t~mem8#1.offset| 0))} assume 0 == sll_remove_last_#t~mem8#1.offset; {10461#false} is VALID [2022-02-21 00:00:36,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {10476#(not (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)))} SUMMARY for call sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L594 {10477#(not (= |ULTIMATE.start_sll_remove_last_#t~mem8#1.offset| 0))} is VALID [2022-02-21 00:00:36,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {10635#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) (not (= |ULTIMATE.start_sll_remove_last_#t~mem7#1.base| 0)))} assume 0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset; {10476#(not (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)))} is VALID [2022-02-21 00:00:36,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {10639#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem6#1.base|) (+ |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| 4)) 0)))} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {10635#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) (not (= |ULTIMATE.start_sll_remove_last_#t~mem7#1.base| 0)))} is VALID [2022-02-21 00:00:36,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {10643#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0))} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {10639#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem6#1.base|) (+ |ULTIMATE.start_sll_remove_last_#t~mem6#1.offset| 4)) 0)))} is VALID [2022-02-21 00:00:36,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {10472#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {10643#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0))} is VALID [2022-02-21 00:00:36,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {10650#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_create_#res#1.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {10472#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} is VALID [2022-02-21 00:00:36,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {10654#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {10650#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_create_#res#1.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} is VALID [2022-02-21 00:00:36,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {10654#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} assume !(sll_create_~len#1 > 0); {10654#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} is VALID [2022-02-21 00:00:36,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {10654#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {10654#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} is VALID [2022-02-21 00:00:36,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {10664#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0)) (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {10654#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))))} is VALID [2022-02-21 00:00:36,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {10468#(and (= (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) 4) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {10664#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0)) (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))))} is VALID [2022-02-21 00:00:36,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {10467#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {10468#(and (= (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|) 4) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)))} is VALID [2022-02-21 00:00:36,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {10466#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {10467#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_#res#1.offset| 0))} is VALID [2022-02-21 00:00:36,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {10466#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {10466#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:36,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {10466#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {10466#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:36,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {10466#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {10466#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:36,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {10465#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {10466#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0))} is VALID [2022-02-21 00:00:36,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {10465#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {10465#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-21 00:00:36,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {10464#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {10465#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-21 00:00:36,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {10464#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {10464#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-21 00:00:36,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {10463#(not (= |ULTIMATE.start_node_create_#res#1.base| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {10464#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-21 00:00:36,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {10462#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {10463#(not (= |ULTIMATE.start_node_create_#res#1.base| 0))} is VALID [2022-02-21 00:00:36,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {10462#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {10462#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} is VALID [2022-02-21 00:00:36,173 INFO L290 TraceCheckUtils]: 4: Hoare triple {10462#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {10462#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} is VALID [2022-02-21 00:00:36,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {10462#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {10462#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} is VALID [2022-02-21 00:00:36,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {10460#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {10462#(not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))} is VALID [2022-02-21 00:00:36,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {10460#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {10460#true} is VALID [2022-02-21 00:00:36,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {10460#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(27, 2); {10460#true} is VALID [2022-02-21 00:00:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:00:36,175 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121903699] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:00:36,175 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:00:36,175 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 18] total 40 [2022-02-21 00:00:36,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700019832] [2022-02-21 00:00:36,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:00:36,177 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 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) Word has length 37 [2022-02-21 00:00:36,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:36,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 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-21 00:00:36,244 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-21 00:00:36,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-21 00:00:36,245 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:00:36,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-21 00:00:36,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1430, Unknown=0, NotChecked=0, Total=1560 [2022-02-21 00:00:36,246 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 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-21 00:00:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:38,443 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-02-21 00:00:38,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-21 00:00:38,443 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 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) Word has length 37 [2022-02-21 00:00:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 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-21 00:00:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 84 transitions. [2022-02-21 00:00:38,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 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-21 00:00:38,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 84 transitions. [2022-02-21 00:00:38,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 84 transitions. [2022-02-21 00:00:38,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:00:38,528 INFO L225 Difference]: With dead ends: 94 [2022-02-21 00:00:38,528 INFO L226 Difference]: Without dead ends: 92 [2022-02-21 00:00:38,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=644, Invalid=2662, Unknown=0, NotChecked=0, Total=3306 [2022-02-21 00:00:38,530 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 729 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:38,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [729 Valid, 605 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 567 Invalid, 0 Unknown, 84 Unchecked, 0.5s Time] [2022-02-21 00:00:38,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-21 00:00:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2022-02-21 00:00:38,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:38,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 80 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 79 states have internal predecessors, (86), 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-21 00:00:38,535 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 80 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 79 states have internal predecessors, (86), 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-21 00:00:38,535 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 80 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 79 states have internal predecessors, (86), 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-21 00:00:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:38,536 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-02-21 00:00:38,536 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2022-02-21 00:00:38,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:38,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:38,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 79 states have internal predecessors, (86), 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 92 states. [2022-02-21 00:00:38,537 INFO L87 Difference]: Start difference. First operand has 80 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 79 states have internal predecessors, (86), 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 92 states. [2022-02-21 00:00:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:38,538 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-02-21 00:00:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2022-02-21 00:00:38,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:38,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:38,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:38,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:38,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 79 states have internal predecessors, (86), 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-21 00:00:38,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-02-21 00:00:38,540 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 37 [2022-02-21 00:00:38,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:38,540 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-02-21 00:00:38,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 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-21 00:00:38,540 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-02-21 00:00:38,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-21 00:00:38,541 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:38,541 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] [2022-02-21 00:00:38,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-21 00:00:38,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-02-21 00:00:38,754 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-21 00:00:38,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:38,755 INFO L85 PathProgramCache]: Analyzing trace with hash 931150289, now seen corresponding path program 1 times [2022-02-21 00:00:38,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:38,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457171524] [2022-02-21 00:00:38,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:38,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:39,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {11112#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(27, 2); {11112#true} is VALID [2022-02-21 00:00:39,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {11112#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {11112#true} is VALID [2022-02-21 00:00:39,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {11112#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {11114#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:39,074 INFO L290 TraceCheckUtils]: 3: Hoare triple {11114#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {11114#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:39,074 INFO L290 TraceCheckUtils]: 4: Hoare triple {11114#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {11114#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:39,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {11114#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {11114#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:39,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {11114#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {11115#(<= (+ |ULTIMATE.start_node_create_#res#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:39,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {11115#(<= (+ |ULTIMATE.start_node_create_#res#1.base| 1) |#StackHeapBarrier|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {11116#(<= (+ |ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:39,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {11116#(<= (+ |ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {11116#(<= (+ |ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:39,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {11116#(<= (+ |ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:39,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:39,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {11118#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:39,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {11118#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {11118#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:39,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {11118#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {11118#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:39,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {11118#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {11118#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:39,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {11118#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {11119#(and (= |ULTIMATE.start_node_create_#res#1.offset| 0) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:39,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {11119#(and (= |ULTIMATE.start_node_create_#res#1.offset| 0) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {11120#(and (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:39,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {11120#(and (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {11121#(and (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 1) |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:39,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {11121#(and (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 1) |#StackHeapBarrier|))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {11122#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:39,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {11122#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {11122#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:39,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {11122#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} assume !(sll_create_~len#1 > 0); {11122#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-21 00:00:39,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {11122#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {11123#(and (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4) 1) |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:39,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {11123#(and (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4) 1) |#StackHeapBarrier|))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {11124#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 1) |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:39,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {11124#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 1) |#StackHeapBarrier|))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {11125#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 1) |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:39,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {11125#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 1) |#StackHeapBarrier|))} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {11125#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 1) |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:39,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {11125#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 1) |#StackHeapBarrier|))} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {11125#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 1) |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:39,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {11125#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 1) |#StackHeapBarrier|))} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {11125#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 1) |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:39,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {11125#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 1) |#StackHeapBarrier|))} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {11126#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 4) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 0))} is VALID [2022-02-21 00:00:39,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {11126#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 4) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 0))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {11127#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:39,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {11127#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 1) |#StackHeapBarrier|)} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {11127#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:39,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {11127#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 1) |#StackHeapBarrier|)} assume !!(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset; {11127#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:39,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {11127#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 1) |#StackHeapBarrier|)} SUMMARY for call sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L601 {11128#(<= (+ |ULTIMATE.start_sll_remove_last_#t~mem10#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:39,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {11128#(<= (+ |ULTIMATE.start_sll_remove_last_#t~mem10#1.base| 1) |#StackHeapBarrier|)} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset;havoc sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset; {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:39,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:39,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} assume !(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset; {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:39,090 INFO L290 TraceCheckUtils]: 35: Hoare triple {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(0, 0, sll_remove_last_~snd_to_last~0#1.base, 4 + sll_remove_last_~snd_to_last~0#1.offset, 4); srcloc: L599-4 {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:39,091 INFO L290 TraceCheckUtils]: 36: Hoare triple {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} assume 0 == sll_remove_last_~last~0#1.offset; {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:39,091 INFO L290 TraceCheckUtils]: 37: Hoare triple {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} assume !(sll_remove_last_~last~0#1.base < #StackHeapBarrier); {11113#false} is VALID [2022-02-21 00:00:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:00:39,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:00:39,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457171524] [2022-02-21 00:00:39,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457171524] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:00:39,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973574144] [2022-02-21 00:00:39,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:39,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:00:39,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:00:39,096 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:00:39,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-21 00:00:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:39,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 44 conjunts are in the unsatisfiable core [2022-02-21 00:00:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:39,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:39,527 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-21 00:00:39,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-02-21 00:00:39,936 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 00:00:39,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 24 [2022-02-21 00:00:40,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {11112#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(27, 2); {11112#true} is VALID [2022-02-21 00:00:40,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {11112#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {11136#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} is VALID [2022-02-21 00:00:40,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {11136#(= |ULTIMATE.start_main_~#s~0#1.offset| 0)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {11140#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< |ULTIMATE.start_node_create_~temp~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:40,049 INFO L290 TraceCheckUtils]: 3: Hoare triple {11140#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< |ULTIMATE.start_node_create_~temp~0#1.base| |#StackHeapBarrier|))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {11140#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< |ULTIMATE.start_node_create_~temp~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:40,049 INFO L290 TraceCheckUtils]: 4: Hoare triple {11140#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< |ULTIMATE.start_node_create_~temp~0#1.base| |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {11140#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< |ULTIMATE.start_node_create_~temp~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:40,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {11140#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< |ULTIMATE.start_node_create_~temp~0#1.base| |#StackHeapBarrier|))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {11140#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< |ULTIMATE.start_node_create_~temp~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:40,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {11140#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< |ULTIMATE.start_node_create_~temp~0#1.base| |#StackHeapBarrier|))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {11153#(and (< |ULTIMATE.start_node_create_#res#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:40,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {11153#(and (< |ULTIMATE.start_node_create_#res#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {11157#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:40,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {11157#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {11157#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:40,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {11157#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (< |ULTIMATE.start_sll_create_~new_head~0#1.base| |#StackHeapBarrier|))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {11164#(and (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:40,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {11164#(and (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {11164#(and (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:40,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {11164#(and (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {11164#(and (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:40,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {11164#(and (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {11164#(and (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:40,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {11164#(and (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {11164#(and (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:40,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {11164#(and (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {11164#(and (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:40,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {11164#(and (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {11164#(and (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:40,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {11164#(and (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {11164#(and (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:40,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {11164#(and (< |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {11189#(and (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:40,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {11189#(and (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {11193#(and (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:40,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {11193#(and (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {11193#(and (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:40,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {11193#(and (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(sll_create_~len#1 > 0); {11193#(and (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:40,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {11193#(and (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {11203#(and (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (+ |ULTIMATE.start_sll_create_#res#1.offset| 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:40,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {11203#(and (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (+ |ULTIMATE.start_sll_create_#res#1.offset| 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {11207#(and (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-21 00:00:40,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {11207#(and (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {11211#(and (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:40,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {11211#(and (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) |#StackHeapBarrier|))} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {11211#(and (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:40,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {11211#(and (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) |#StackHeapBarrier|))} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {11211#(and (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:40,060 INFO L290 TraceCheckUtils]: 26: Hoare triple {11211#(and (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) |#StackHeapBarrier|))} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {11211#(and (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) |#StackHeapBarrier|))} is VALID [2022-02-21 00:00:40,061 INFO L290 TraceCheckUtils]: 27: Hoare triple {11211#(and (= |ULTIMATE.start_sll_remove_last_~head#1.offset| 0) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) 4)) |#StackHeapBarrier|))} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {11224#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))))} is VALID [2022-02-21 00:00:40,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {11224#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0))))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {11228#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) |#StackHeapBarrier|)))} is VALID [2022-02-21 00:00:40,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {11228#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) |#StackHeapBarrier|)))} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {11228#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) |#StackHeapBarrier|)))} is VALID [2022-02-21 00:00:40,064 INFO L290 TraceCheckUtils]: 30: Hoare triple {11228#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) |#StackHeapBarrier|)))} assume !!(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset; {11228#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) |#StackHeapBarrier|)))} is VALID [2022-02-21 00:00:40,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {11228#(exists ((|ULTIMATE.start_sll_remove_last_~head#1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (< (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) 0)) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) |#StackHeapBarrier|)))} SUMMARY for call sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L601 {11128#(<= (+ |ULTIMATE.start_sll_remove_last_#t~mem10#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:40,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {11128#(<= (+ |ULTIMATE.start_sll_remove_last_#t~mem10#1.base| 1) |#StackHeapBarrier|)} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset;havoc sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset; {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:40,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:40,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} assume !(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset; {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:40,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(0, 0, sll_remove_last_~snd_to_last~0#1.base, 4 + sll_remove_last_~snd_to_last~0#1.offset, 4); srcloc: L599-4 {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:40,081 INFO L290 TraceCheckUtils]: 36: Hoare triple {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} assume 0 == sll_remove_last_~last~0#1.offset; {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:40,082 INFO L290 TraceCheckUtils]: 37: Hoare triple {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} assume !(sll_remove_last_~last~0#1.base < #StackHeapBarrier); {11113#false} is VALID [2022-02-21 00:00:40,082 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:00:40,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 00:00:40,266 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 20 [2022-02-21 00:00:40,580 INFO L356 Elim1Store]: treesize reduction 13, result has 62.9 percent of original size [2022-02-21 00:00:40,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 117 [2022-02-21 00:00:41,021 INFO L290 TraceCheckUtils]: 37: Hoare triple {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} assume !(sll_remove_last_~last~0#1.base < #StackHeapBarrier); {11113#false} is VALID [2022-02-21 00:00:41,022 INFO L290 TraceCheckUtils]: 36: Hoare triple {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} assume 0 == sll_remove_last_~last~0#1.offset; {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,022 INFO L290 TraceCheckUtils]: 35: Hoare triple {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(0, 0, sll_remove_last_~snd_to_last~0#1.base, 4 + sll_remove_last_~snd_to_last~0#1.offset, 4); srcloc: L599-4 {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} assume !(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset; {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {11128#(<= (+ |ULTIMATE.start_sll_remove_last_#t~mem10#1.base| 1) |#StackHeapBarrier|)} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset;havoc sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset; {11129#(<= (+ 1 |ULTIMATE.start_sll_remove_last_~last~0#1.base|) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {11127#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 1) |#StackHeapBarrier|)} SUMMARY for call sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L601 {11128#(<= (+ |ULTIMATE.start_sll_remove_last_#t~mem10#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {11127#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 1) |#StackHeapBarrier|)} assume !!(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset; {11127#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {11127#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 1) |#StackHeapBarrier|)} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {11127#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {11283#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 4)) 1) |#StackHeapBarrier|)} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {11127#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {11287#(<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 1) |#StackHeapBarrier|)} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {11283#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) (+ |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {11287#(<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 1) |#StackHeapBarrier|)} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {11287#(<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {11287#(<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 1) |#StackHeapBarrier|)} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {11287#(<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {11287#(<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 1) |#StackHeapBarrier|)} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {11287#(<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {11300#(<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 1) |#StackHeapBarrier|)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {11287#(<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (+ 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|))) 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {11304#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_sll_create_#res#1.offset| 4)) 1) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_create_#res#1.base|))))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {11300#(<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {11308#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 1) |#StackHeapBarrier|)))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {11304#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_sll_create_#res#1.offset| 4)) 1) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_sll_create_#res#1.base|))))} is VALID [2022-02-21 00:00:41,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {11308#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 1) |#StackHeapBarrier|)))} assume !(sll_create_~len#1 > 0); {11308#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 1) |#StackHeapBarrier|)))} is VALID [2022-02-21 00:00:41,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {11308#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 1) |#StackHeapBarrier|)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {11308#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 1) |#StackHeapBarrier|)))} is VALID [2022-02-21 00:00:41,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {11318#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {11308#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 1) |#StackHeapBarrier|)))} is VALID [2022-02-21 00:00:41,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {11318#(forall ((|ULTIMATE.start_main_~#s~0#1.base| Int)) (or (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))))} is VALID [2022-02-21 00:00:41,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {11116#(<= (+ |ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {11117#(<= (+ |ULTIMATE.start_sll_create_~head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {11116#(<= (+ |ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {11116#(<= (+ |ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {11115#(<= (+ |ULTIMATE.start_node_create_#res#1.base| 1) |#StackHeapBarrier|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {11116#(<= (+ |ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {11114#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {11115#(<= (+ |ULTIMATE.start_node_create_#res#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {11114#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {11114#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,040 INFO L290 TraceCheckUtils]: 4: Hoare triple {11114#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {11114#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,040 INFO L290 TraceCheckUtils]: 3: Hoare triple {11114#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {11114#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {11112#true} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {11114#(<= (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-21 00:00:41,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {11112#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {11112#true} is VALID [2022-02-21 00:00:41,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {11112#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(27, 2); {11112#true} is VALID [2022-02-21 00:00:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:00:41,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973574144] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 00:00:41,041 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 00:00:41,041 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 14] total 35 [2022-02-21 00:00:41,041 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232130792] [2022-02-21 00:00:41,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 00:00:41,042 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 36 states have internal predecessors, (87), 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) Word has length 38 [2022-02-21 00:00:41,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:00:41,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 36 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 36 states have internal predecessors, (87), 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-21 00:00:41,115 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-21 00:00:41,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-02-21 00:00:41,116 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:00:41,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-02-21 00:00:41,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1163, Unknown=0, NotChecked=0, Total=1260 [2022-02-21 00:00:41,117 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 36 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 36 states have internal predecessors, (87), 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-21 00:00:43,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:43,045 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-02-21 00:00:43,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-21 00:00:43,046 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 36 states have internal predecessors, (87), 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) Word has length 38 [2022-02-21 00:00:43,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:00:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 36 states have internal predecessors, (87), 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-21 00:00:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 95 transitions. [2022-02-21 00:00:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 36 states have internal predecessors, (87), 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-21 00:00:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 95 transitions. [2022-02-21 00:00:43,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 95 transitions. [2022-02-21 00:00:43,120 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-21 00:00:43,121 INFO L225 Difference]: With dead ends: 93 [2022-02-21 00:00:43,121 INFO L226 Difference]: Without dead ends: 93 [2022-02-21 00:00:43,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=414, Invalid=2036, Unknown=0, NotChecked=0, Total=2450 [2022-02-21 00:00:43,122 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 217 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-21 00:00:43,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 540 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 536 Invalid, 0 Unknown, 170 Unchecked, 0.4s Time] [2022-02-21 00:00:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-21 00:00:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2022-02-21 00:00:43,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:00:43,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 81 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 80 states have internal predecessors, (87), 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-21 00:00:43,125 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 81 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 80 states have internal predecessors, (87), 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-21 00:00:43,125 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 81 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 80 states have internal predecessors, (87), 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-21 00:00:43,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:43,126 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-02-21 00:00:43,126 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-02-21 00:00:43,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:43,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:43,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 80 states have internal predecessors, (87), 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 93 states. [2022-02-21 00:00:43,127 INFO L87 Difference]: Start difference. First operand has 81 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 80 states have internal predecessors, (87), 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 93 states. [2022-02-21 00:00:43,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:00:43,128 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-02-21 00:00:43,128 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-02-21 00:00:43,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:00:43,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:00:43,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:00:43,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:00:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 80 states have internal predecessors, (87), 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-21 00:00:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-02-21 00:00:43,130 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 38 [2022-02-21 00:00:43,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:00:43,130 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-02-21 00:00:43,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 36 states have internal predecessors, (87), 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-21 00:00:43,131 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-02-21 00:00:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-21 00:00:43,131 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:00:43,131 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] [2022-02-21 00:00:43,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-21 00:00:43,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-02-21 00:00:43,347 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 28 more)] === [2022-02-21 00:00:43,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:00:43,348 INFO L85 PathProgramCache]: Analyzing trace with hash 931202878, now seen corresponding path program 2 times [2022-02-21 00:00:43,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:00:43,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722018875] [2022-02-21 00:00:43,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:00:43,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:00:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:43,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {11762#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(27, 2); {11762#true} is VALID [2022-02-21 00:00:43,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {11762#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset, main_#t~post13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, 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;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {11764#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-21 00:00:43,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {11764#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {11765#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-21 00:00:43,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {11765#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {11765#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-21 00:00:43,845 INFO L290 TraceCheckUtils]: 4: Hoare triple {11765#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {11766#(and (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-21 00:00:43,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {11766#(and (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {11766#(and (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-21 00:00:43,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {11766#(and (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {11767#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1))} is VALID [2022-02-21 00:00:43,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {11767#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {11768#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-21 00:00:43,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {11768#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {11769#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 0))} is VALID [2022-02-21 00:00:43,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {11769#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {11770#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-21 00:00:43,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {11770#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {11770#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-21 00:00:43,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {11770#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {11771#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-21 00:00:43,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {11771#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {11771#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-21 00:00:43,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {11771#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} SUMMARY for call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4); srcloc: L576-1 {11771#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-21 00:00:43,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {11771#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} SUMMARY for call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4); srcloc: L579 {11771#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-21 00:00:43,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {11771#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {11772#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-21 00:00:43,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {11772#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset; {11773#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-21 00:00:43,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {11773#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} SUMMARY for call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4); srcloc: L587 {11774#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 4) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 4) 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 0))} is VALID [2022-02-21 00:00:43,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {11774#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 4) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|))) 4) 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ 4 |ULTIMATE.start_sll_create_~new_head~0#1.offset|)) 0))} sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {11775#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-21 00:00:43,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {11775#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {11775#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-21 00:00:43,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {11775#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} assume !(sll_create_~len#1 > 0); {11775#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-21 00:00:43,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {11775#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {11776#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4)) 4) 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0))} is VALID [2022-02-21 00:00:43,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {11776#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4)) 4) 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0))} main_#t~ret12#1.base, main_#t~ret12#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {11777#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)) 4) 0))} is VALID [2022-02-21 00:00:43,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {11777#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)) 4) 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_last } true;sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset, sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset, sll_remove_last_#t~mem8#1.base, sll_remove_last_#t~mem8#1.offset, sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset, sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset, sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset, sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset, sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset, sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset;sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset := sll_remove_last_#in~head#1.base, sll_remove_last_#in~head#1.offset; {11778#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 4) 0))} is VALID [2022-02-21 00:00:43,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {11778#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 4) 0))} SUMMARY for call sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L593 {11778#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 4) 0))} is VALID [2022-02-21 00:00:43,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {11778#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 4) 0))} SUMMARY for call sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset := read~$Pointer$(sll_remove_last_#t~mem6#1.base, 4 + sll_remove_last_#t~mem6#1.offset, 4); srcloc: L593-1 {11778#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 4) 0))} is VALID [2022-02-21 00:00:43,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {11778#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 4) 0))} assume !(0 == sll_remove_last_#t~mem7#1.base && 0 == sll_remove_last_#t~mem7#1.offset);havoc sll_remove_last_#t~mem6#1.base, sll_remove_last_#t~mem6#1.offset;havoc sll_remove_last_#t~mem7#1.base, sll_remove_last_#t~mem7#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := 0, 0; {11778#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 4) 0))} is VALID [2022-02-21 00:00:43,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {11778#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~head#1.base|) |ULTIMATE.start_sll_remove_last_~head#1.offset|)) 4)) 4) 0))} SUMMARY for call sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset := read~$Pointer$(sll_remove_last_~head#1.base, sll_remove_last_~head#1.offset, 4); srcloc: L598 {11779#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 4)) 4) 0) (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 4) 0))} is VALID [2022-02-21 00:00:43,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {11779#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 4)) 4) 0) (= |ULTIMATE.start_sll_remove_last_#t~mem9#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_#t~mem9#1.base|) 4) 0))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset;havoc sll_remove_last_#t~mem9#1.base, sll_remove_last_#t~mem9#1.offset; {11780#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 0))} is VALID [2022-02-21 00:00:43,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {11780#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 0))} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {11780#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 0))} is VALID [2022-02-21 00:00:43,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {11780#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 0))} assume !!(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset; {11780#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 0))} is VALID [2022-02-21 00:00:43,859 INFO L290 TraceCheckUtils]: 31: Hoare triple {11780#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 4) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4))) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 0))} SUMMARY for call sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L601 {11781#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_#t~mem10#1.base|) 4) 0) (= |ULTIMATE.start_sll_remove_last_#t~mem10#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem10#1.base|) 4) 0))} is VALID [2022-02-21 00:00:43,860 INFO L290 TraceCheckUtils]: 32: Hoare triple {11781#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_#t~mem10#1.base|) 4) 0) (= |ULTIMATE.start_sll_remove_last_#t~mem10#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_#t~mem10#1.base|) 4) 0))} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset;havoc sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset; {11782#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 0) (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 0))} is VALID [2022-02-21 00:00:43,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {11782#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 0) (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_remove_last_~last~0#1.base|) (+ |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 4)) 0))} SUMMARY for call sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L599-3 {11783#(and (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_remove_last_#t~mem11#1.base| 0) (= |ULTIMATE.start_sll_remove_last_#t~mem11#1.offset| 0))} is VALID [2022-02-21 00:00:43,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {11783#(and (= |ULTIMATE.start_sll_remove_last_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_remove_last_#t~mem11#1.base| 0) (= |ULTIMATE.start_sll_remove_last_#t~mem11#1.offset| 0))} assume !!(sll_remove_last_#t~mem11#1.base != 0 || sll_remove_last_#t~mem11#1.offset != 0);havoc sll_remove_last_#t~mem11#1.base, sll_remove_last_#t~mem11#1.offset;sll_remove_last_~snd_to_last~0#1.base, sll_remove_last_~snd_to_last~0#1.offset := sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset; {11763#false} is VALID [2022-02-21 00:00:43,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {11763#false} SUMMARY for call sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset := read~$Pointer$(sll_remove_last_~last~0#1.base, 4 + sll_remove_last_~last~0#1.offset, 4); srcloc: L601 {11763#false} is VALID [2022-02-21 00:00:43,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {11763#false} sll_remove_last_~last~0#1.base, sll_remove_last_~last~0#1.offset := sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset;havoc sll_remove_last_#t~mem10#1.base, sll_remove_last_#t~mem10#1.offset; {11763#false} is VALID [2022-02-21 00:00:43,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {11763#false} assume !(4 + (4 + sll_remove_last_~last~0#1.offset) <= #length[sll_remove_last_~last~0#1.base] && 0 <= 4 + sll_remove_last_~last~0#1.offset); {11763#false} is VALID [2022-02-21 00:00:43,861 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:00:43,861 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:00:43,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722018875] [2022-02-21 00:00:43,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722018875] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 00:00:43,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343918315] [2022-02-21 00:00:43,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 00:00:43,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 00:00:43,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:00:43,862 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 00:00:43,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-21 00:00:44,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 00:00:44,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 00:00:44,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 97 conjunts are in the unsatisfiable core [2022-02-21 00:00:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:00:44,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 00:00:44,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-21 00:00:44,273 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-21 00:00:44,280 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-21 00:00:44,416 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-21 00:00:44,430 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 00:00:44,430 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-21 00:00:44,511 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-21 00:00:44,527 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-21 00:00:44,568 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-21 00:00:44,579 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-21 00:00:44,777 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 23 treesize of output 22 [2022-02-21 00:00:44,795 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 29 treesize of output 28