./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0234-2.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/memsafety/test-0234-2.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 3248e88e6fd49fdcf0a9f78f1aa9e69276951d353f75f39f6bb30d51b2e53989 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:45:33,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:45:33,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:45:33,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:45:33,502 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:45:33,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:45:33,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:45:33,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:45:33,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:45:33,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:45:33,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:45:33,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:45:33,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:45:33,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:45:33,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:45:33,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:45:33,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:45:33,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:45:33,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:45:33,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:45:33,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:45:33,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:45:33,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:45:33,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:45:33,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:45:33,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:45:33,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:45:33,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:45:33,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:45:33,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:45:33,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:45:33,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:45:33,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:45:33,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:45:33,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:45:33,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:45:33,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:45:33,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:45:33,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:45:33,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:45:33,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:45:33,525 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:45:33,543 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:45:33,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:45:33,544 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:45:33,544 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:45:33,544 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:45:33,544 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:45:33,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:45:33,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:45:33,545 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:45:33,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:45:33,546 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:45:33,546 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:45:33,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:45:33,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:45:33,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:45:33,546 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:45:33,546 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:45:33,547 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:45:33,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:45:33,547 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:45:33,547 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:45:33,547 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:45:33,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:45:33,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:45:33,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:45:33,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:33,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:45:33,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:45:33,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:45:33,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:45:33,549 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 -> 3248e88e6fd49fdcf0a9f78f1aa9e69276951d353f75f39f6bb30d51b2e53989 [2022-02-20 23:45:33,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:45:33,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:45:33,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:45:33,735 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:45:33,735 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:45:33,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0234-2.i [2022-02-20 23:45:33,815 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/582766c58/6c5542480ade42a38ebccb1b6c2e458c/FLAGf49c523cb [2022-02-20 23:45:34,207 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:45:34,208 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0234-2.i [2022-02-20 23:45:34,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/582766c58/6c5542480ade42a38ebccb1b6c2e458c/FLAGf49c523cb [2022-02-20 23:45:34,228 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/582766c58/6c5542480ade42a38ebccb1b6c2e458c [2022-02-20 23:45:34,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:45:34,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:45:34,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:34,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:45:34,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:45:34,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:34" (1/1) ... [2022-02-20 23:45:34,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34d52ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:34, skipping insertion in model container [2022-02-20 23:45:34,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:34" (1/1) ... [2022-02-20 23:45:34,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:45:34,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:45:34,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:34,561 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:45:34,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:34,639 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:45:34,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:34 WrapperNode [2022-02-20 23:45:34,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:34,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:34,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:45:34,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:45:34,646 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:45:34" (1/1) ... [2022-02-20 23:45:34,671 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:45:34" (1/1) ... [2022-02-20 23:45:34,710 INFO L137 Inliner]: procedures = 188, calls = 58, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 197 [2022-02-20 23:45:34,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:34,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:45:34,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:45:34,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:45:34,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:34" (1/1) ... [2022-02-20 23:45:34,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:34" (1/1) ... [2022-02-20 23:45:34,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:34" (1/1) ... [2022-02-20 23:45:34,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:34" (1/1) ... [2022-02-20 23:45:34,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:34" (1/1) ... [2022-02-20 23:45:34,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:34" (1/1) ... [2022-02-20 23:45:34,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:34" (1/1) ... [2022-02-20 23:45:34,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:45:34,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:45:34,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:45:34,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:45:34,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:34" (1/1) ... [2022-02-20 23:45:34,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:34,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:34,788 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:45:34,801 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:45:34,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:45:34,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:45:34,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:45:34,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:45:34,820 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2022-02-20 23:45:34,820 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2022-02-20 23:45:34,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:45:34,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:45:34,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:45:34,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:45:34,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:45:34,904 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:45:34,911 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:45:35,387 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:45:35,397 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:45:35,398 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-02-20 23:45:35,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:35 BoogieIcfgContainer [2022-02-20 23:45:35,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:45:35,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:45:35,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:45:35,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:45:35,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:45:34" (1/3) ... [2022-02-20 23:45:35,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4735af4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:35, skipping insertion in model container [2022-02-20 23:45:35,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:34" (2/3) ... [2022-02-20 23:45:35,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4735af4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:35, skipping insertion in model container [2022-02-20 23:45:35,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:35" (3/3) ... [2022-02-20 23:45:35,406 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0234-2.i [2022-02-20 23:45:35,411 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:45:35,411 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2022-02-20 23:45:35,443 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:45:35,447 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:45:35,448 INFO L340 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-02-20 23:45:35,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 182 states, 104 states have (on average 1.8846153846153846) internal successors, (196), 174 states have internal predecessors, (196), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:35,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:45:35,476 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:35,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:45:35,476 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:45:35,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:35,480 INFO L85 PathProgramCache]: Analyzing trace with hash 930118, now seen corresponding path program 1 times [2022-02-20 23:45:35,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:35,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731680993] [2022-02-20 23:45:35,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:35,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:35,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {185#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {185#true} is VALID [2022-02-20 23:45:35,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {185#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~mem31#1.base, main_#t~mem31#1.offset; {185#true} is VALID [2022-02-20 23:45:35,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {185#true} assume !true; {186#false} is VALID [2022-02-20 23:45:35,580 INFO L290 TraceCheckUtils]: 3: Hoare triple {186#false} assume !(1 == #valid[~#list~0.base]); {186#false} is VALID [2022-02-20 23:45:35,581 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:45:35,581 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:35,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731680993] [2022-02-20 23:45:35,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731680993] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:35,582 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:35,582 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:35,583 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268878044] [2022-02-20 23:45:35,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:35,588 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 23:45:35,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:35,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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:45:35,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:35,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:45:35,601 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:35,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:45:35,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:45:35,624 INFO L87 Difference]: Start difference. First operand has 182 states, 104 states have (on average 1.8846153846153846) internal successors, (196), 174 states have internal predecessors, (196), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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:45:35,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:35,742 INFO L93 Difference]: Finished difference Result 182 states and 197 transitions. [2022-02-20 23:45:35,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:45:35,743 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 23:45:35,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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:45:35,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 208 transitions. [2022-02-20 23:45:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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:45:35,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 208 transitions. [2022-02-20 23:45:35,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 208 transitions. [2022-02-20 23:45:35,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:35,937 INFO L225 Difference]: With dead ends: 182 [2022-02-20 23:45:35,938 INFO L226 Difference]: Without dead ends: 180 [2022-02-20 23:45:35,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:45:35,944 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:35,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:35,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-02-20 23:45:35,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2022-02-20 23:45:35,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:35,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 180 states, 103 states have (on average 1.7766990291262137) internal successors, (183), 172 states have internal predecessors, (183), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:35,983 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 180 states, 103 states have (on average 1.7766990291262137) internal successors, (183), 172 states have internal predecessors, (183), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:35,984 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 180 states, 103 states have (on average 1.7766990291262137) internal successors, (183), 172 states have internal predecessors, (183), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:36,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:36,001 INFO L93 Difference]: Finished difference Result 180 states and 195 transitions. [2022-02-20 23:45:36,001 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 195 transitions. [2022-02-20 23:45:36,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:36,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:36,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 103 states have (on average 1.7766990291262137) internal successors, (183), 172 states have internal predecessors, (183), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 180 states. [2022-02-20 23:45:36,005 INFO L87 Difference]: Start difference. First operand has 180 states, 103 states have (on average 1.7766990291262137) internal successors, (183), 172 states have internal predecessors, (183), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 180 states. [2022-02-20 23:45:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:36,016 INFO L93 Difference]: Finished difference Result 180 states and 195 transitions. [2022-02-20 23:45:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 195 transitions. [2022-02-20 23:45:36,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:36,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:36,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:36,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:36,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 103 states have (on average 1.7766990291262137) internal successors, (183), 172 states have internal predecessors, (183), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 195 transitions. [2022-02-20 23:45:36,038 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 195 transitions. Word has length 4 [2022-02-20 23:45:36,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:36,038 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 195 transitions. [2022-02-20 23:45:36,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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:45:36,039 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 195 transitions. [2022-02-20 23:45:36,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:45:36,039 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:36,039 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:45:36,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:45:36,040 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:45:36,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:36,040 INFO L85 PathProgramCache]: Analyzing trace with hash 889833681, now seen corresponding path program 1 times [2022-02-20 23:45:36,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:36,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624831112] [2022-02-20 23:45:36,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:36,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:36,052 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:36,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2037024949] [2022-02-20 23:45:36,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:36,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:36,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:36,054 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:45:36,084 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:45:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:36,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:45:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:36,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:36,165 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:45:36,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {911#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {911#true} is VALID [2022-02-20 23:45:36,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {911#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~mem31#1.base, main_#t~mem31#1.offset; {911#true} is VALID [2022-02-20 23:45:36,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {911#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {911#true} is VALID [2022-02-20 23:45:36,172 INFO L272 TraceCheckUtils]: 3: Hoare triple {911#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {911#true} is VALID [2022-02-20 23:45:36,173 INFO L290 TraceCheckUtils]: 4: Hoare triple {911#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {928#(= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)} is VALID [2022-02-20 23:45:36,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {928#(= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)} assume !(1 == #valid[#Ultimate.C_memset_#ptr#1.base]); {912#false} is VALID [2022-02-20 23:45:36,173 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:45:36,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:36,174 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:36,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624831112] [2022-02-20 23:45:36,174 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:36,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037024949] [2022-02-20 23:45:36,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037024949] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:36,175 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:36,175 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:36,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568210167] [2022-02-20 23:45:36,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:36,176 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:45:36,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:36,176 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:36,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:36,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:36,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:36,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:36,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:36,182 INFO L87 Difference]: Start difference. First operand 180 states and 195 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:36,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:36,445 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2022-02-20 23:45:36,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:36,445 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:45:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:36,445 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2022-02-20 23:45:36,448 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2022-02-20 23:45:36,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 195 transitions. [2022-02-20 23:45:36,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:36,596 INFO L225 Difference]: With dead ends: 179 [2022-02-20 23:45:36,596 INFO L226 Difference]: Without dead ends: 179 [2022-02-20 23:45:36,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:45:36,597 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 9 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:36,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 302 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:36,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-02-20 23:45:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-02-20 23:45:36,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:36,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 179 states, 103 states have (on average 1.766990291262136) internal successors, (182), 171 states have internal predecessors, (182), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:36,610 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 179 states, 103 states have (on average 1.766990291262136) internal successors, (182), 171 states have internal predecessors, (182), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:36,610 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 179 states, 103 states have (on average 1.766990291262136) internal successors, (182), 171 states have internal predecessors, (182), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:36,615 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2022-02-20 23:45:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 194 transitions. [2022-02-20 23:45:36,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:36,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:36,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 103 states have (on average 1.766990291262136) internal successors, (182), 171 states have internal predecessors, (182), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 179 states. [2022-02-20 23:45:36,617 INFO L87 Difference]: Start difference. First operand has 179 states, 103 states have (on average 1.766990291262136) internal successors, (182), 171 states have internal predecessors, (182), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 179 states. [2022-02-20 23:45:36,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:36,623 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2022-02-20 23:45:36,623 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 194 transitions. [2022-02-20 23:45:36,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:36,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:36,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:36,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 103 states have (on average 1.766990291262136) internal successors, (182), 171 states have internal predecessors, (182), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 194 transitions. [2022-02-20 23:45:36,629 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 194 transitions. Word has length 6 [2022-02-20 23:45:36,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:36,630 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 194 transitions. [2022-02-20 23:45:36,630 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:36,630 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 194 transitions. [2022-02-20 23:45:36,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:45:36,631 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:36,631 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:36,652 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:45:36,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:36,851 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:45:36,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:36,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1815040656, now seen corresponding path program 1 times [2022-02-20 23:45:36,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:36,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547296464] [2022-02-20 23:45:36,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:36,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:36,863 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:36,863 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1611581302] [2022-02-20 23:45:36,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:36,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:36,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:36,864 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:45:36,866 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:45:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:36,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:45:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:36,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:37,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:45:37,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {1647#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {1647#true} is VALID [2022-02-20 23:45:37,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {1647#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~mem31#1.base, main_#t~mem31#1.offset; {1647#true} is VALID [2022-02-20 23:45:37,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {1647#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {1647#true} is VALID [2022-02-20 23:45:37,851 INFO L272 TraceCheckUtils]: 3: Hoare triple {1647#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {1647#true} is VALID [2022-02-20 23:45:37,858 INFO L290 TraceCheckUtils]: 4: Hoare triple {1647#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {1664#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= |zalloc_or_die_#Ultimate.C_memset_#amount#1| (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|)) (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (select |#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)))) (= |zalloc_or_die_#Ultimate.C_memset_#ptr#1.offset| 0))} is VALID [2022-02-20 23:45:37,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {1664#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= |zalloc_or_die_#Ultimate.C_memset_#amount#1| (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|)) (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (select |#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)))) (= |zalloc_or_die_#Ultimate.C_memset_#ptr#1.offset| 0))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {1664#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= |zalloc_or_die_#Ultimate.C_memset_#amount#1| (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|)) (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (select |#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)))) (= |zalloc_or_die_#Ultimate.C_memset_#ptr#1.offset| 0))} is VALID [2022-02-20 23:45:37,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {1664#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= |zalloc_or_die_#Ultimate.C_memset_#amount#1| (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|)) (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (select |#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)))) (= |zalloc_or_die_#Ultimate.C_memset_#ptr#1.offset| 0))} assume !(#Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset); {1648#false} is VALID [2022-02-20 23:45:37,860 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:45:37,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:37,860 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:37,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547296464] [2022-02-20 23:45:37,860 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:37,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611581302] [2022-02-20 23:45:37,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611581302] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:37,860 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:37,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:37,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700450693] [2022-02-20 23:45:37,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:37,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:45:37,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:37,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:37,883 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:45:37,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:37,884 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:37,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:37,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:37,887 INFO L87 Difference]: Start difference. First operand 179 states and 194 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:38,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:38,039 INFO L93 Difference]: Finished difference Result 178 states and 193 transitions. [2022-02-20 23:45:38,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:38,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:45:38,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2022-02-20 23:45:38,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2022-02-20 23:45:38,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 194 transitions. [2022-02-20 23:45:38,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:38,167 INFO L225 Difference]: With dead ends: 178 [2022-02-20 23:45:38,167 INFO L226 Difference]: Without dead ends: 178 [2022-02-20 23:45:38,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:38,168 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:38,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 58 Unchecked, 0.0s Time] [2022-02-20 23:45:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-02-20 23:45:38,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-02-20 23:45:38,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:38,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 178 states, 103 states have (on average 1.7572815533980584) internal successors, (181), 170 states have internal predecessors, (181), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:38,184 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 178 states, 103 states have (on average 1.7572815533980584) internal successors, (181), 170 states have internal predecessors, (181), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:38,184 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 178 states, 103 states have (on average 1.7572815533980584) internal successors, (181), 170 states have internal predecessors, (181), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:38,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:38,188 INFO L93 Difference]: Finished difference Result 178 states and 193 transitions. [2022-02-20 23:45:38,188 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2022-02-20 23:45:38,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:38,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:38,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 103 states have (on average 1.7572815533980584) internal successors, (181), 170 states have internal predecessors, (181), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 178 states. [2022-02-20 23:45:38,189 INFO L87 Difference]: Start difference. First operand has 178 states, 103 states have (on average 1.7572815533980584) internal successors, (181), 170 states have internal predecessors, (181), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 178 states. [2022-02-20 23:45:38,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:38,193 INFO L93 Difference]: Finished difference Result 178 states and 193 transitions. [2022-02-20 23:45:38,193 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2022-02-20 23:45:38,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:38,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:38,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:38,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:38,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 103 states have (on average 1.7572815533980584) internal successors, (181), 170 states have internal predecessors, (181), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:38,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2022-02-20 23:45:38,197 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 7 [2022-02-20 23:45:38,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:38,197 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2022-02-20 23:45:38,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2022-02-20 23:45:38,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 23:45:38,199 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:38,199 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:38,217 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:45:38,413 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,SelfDestructingSolverStorable2 [2022-02-20 23:45:38,414 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:45:38,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:38,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1487051478, now seen corresponding path program 1 times [2022-02-20 23:45:38,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:38,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077605471] [2022-02-20 23:45:38,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:38,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:38,446 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:38,446 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1030248140] [2022-02-20 23:45:38,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:38,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:38,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:38,448 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:45:38,449 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:45:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:38,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:45:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:38,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:39,026 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:45:39,026 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 12 treesize of output 14 [2022-02-20 23:45:39,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {2382#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {2382#true} is VALID [2022-02-20 23:45:39,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {2382#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~mem31#1.base, main_#t~mem31#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {2382#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,041 INFO L272 TraceCheckUtils]: 3: Hoare triple {2382#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {2382#true} is VALID [2022-02-20 23:45:39,041 INFO L290 TraceCheckUtils]: 4: Hoare triple {2382#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2382#true} is VALID [2022-02-20 23:45:39,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {2382#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2382#true} is VALID [2022-02-20 23:45:39,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {2382#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {2382#true} is VALID [2022-02-20 23:45:39,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {2382#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2382#true} is VALID [2022-02-20 23:45:39,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {2382#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {2382#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {2382#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {2382#true} assume true; {2382#true} is VALID [2022-02-20 23:45:39,042 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2382#true} {2382#true} #308#return; {2382#true} is VALID [2022-02-20 23:45:39,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {2382#true} l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset := l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {2382#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := l0_insert_~item~4#1.base, 4 + l0_insert_~item~4#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset, l1_insert_#t~nondet16#1, l1_insert_#t~mem17#1.base, l1_insert_#t~mem17#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,043 INFO L272 TraceCheckUtils]: 15: Hoare triple {2382#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {2382#true} is VALID [2022-02-20 23:45:39,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {2382#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2382#true} is VALID [2022-02-20 23:45:39,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {2382#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2382#true} is VALID [2022-02-20 23:45:39,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {2382#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {2382#true} is VALID [2022-02-20 23:45:39,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {2382#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2382#true} is VALID [2022-02-20 23:45:39,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {2382#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {2382#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {2382#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {2382#true} assume true; {2382#true} is VALID [2022-02-20 23:45:39,043 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2382#true} {2382#true} #310#return; {2382#true} is VALID [2022-02-20 23:45:39,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {2382#true} l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset := l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {2382#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset, l2_insert_#t~nondet13#1, l2_insert_#t~mem14#1.base, l2_insert_#t~mem14#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,044 INFO L272 TraceCheckUtils]: 27: Hoare triple {2382#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {2382#true} is VALID [2022-02-20 23:45:39,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {2382#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2382#true} is VALID [2022-02-20 23:45:39,044 INFO L290 TraceCheckUtils]: 29: Hoare triple {2382#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2382#true} is VALID [2022-02-20 23:45:39,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {2382#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {2382#true} is VALID [2022-02-20 23:45:39,044 INFO L290 TraceCheckUtils]: 31: Hoare triple {2382#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2382#true} is VALID [2022-02-20 23:45:39,044 INFO L290 TraceCheckUtils]: 32: Hoare triple {2382#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {2382#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,044 INFO L290 TraceCheckUtils]: 34: Hoare triple {2382#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,044 INFO L290 TraceCheckUtils]: 35: Hoare triple {2382#true} assume true; {2382#true} is VALID [2022-02-20 23:45:39,045 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2382#true} {2382#true} #312#return; {2382#true} is VALID [2022-02-20 23:45:39,045 INFO L290 TraceCheckUtils]: 37: Hoare triple {2382#true} l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset := l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,045 INFO L290 TraceCheckUtils]: 38: Hoare triple {2382#true} assume { :begin_inline_l3_insert } true;l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset := l2_insert_~item~2#1.base, 4 + l2_insert_~item~2#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset, l3_insert_#t~nondet10#1, l3_insert_#t~mem11#1.base, l3_insert_#t~mem11#1.offset, l3_insert_~list#1.base, l3_insert_~list#1.offset, l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;l3_insert_~list#1.base, l3_insert_~list#1.offset := l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,045 INFO L272 TraceCheckUtils]: 39: Hoare triple {2382#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {2382#true} is VALID [2022-02-20 23:45:39,045 INFO L290 TraceCheckUtils]: 40: Hoare triple {2382#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2382#true} is VALID [2022-02-20 23:45:39,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {2382#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2382#true} is VALID [2022-02-20 23:45:39,047 INFO L290 TraceCheckUtils]: 42: Hoare triple {2382#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {2382#true} is VALID [2022-02-20 23:45:39,047 INFO L290 TraceCheckUtils]: 43: Hoare triple {2382#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2382#true} is VALID [2022-02-20 23:45:39,047 INFO L290 TraceCheckUtils]: 44: Hoare triple {2382#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,048 INFO L290 TraceCheckUtils]: 45: Hoare triple {2382#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,048 INFO L290 TraceCheckUtils]: 46: Hoare triple {2382#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,048 INFO L290 TraceCheckUtils]: 47: Hoare triple {2382#true} assume true; {2382#true} is VALID [2022-02-20 23:45:39,048 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2382#true} {2382#true} #314#return; {2382#true} is VALID [2022-02-20 23:45:39,048 INFO L290 TraceCheckUtils]: 49: Hoare triple {2382#true} l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset := l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,048 INFO L290 TraceCheckUtils]: 50: Hoare triple {2382#true} assume { :begin_inline_l4_insert } true;l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset := l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset, l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset, l4_insert_~list#1.base, l4_insert_~list#1.offset, l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset;l4_insert_~list#1.base, l4_insert_~list#1.offset := l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,048 INFO L272 TraceCheckUtils]: 51: Hoare triple {2382#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {2382#true} is VALID [2022-02-20 23:45:39,049 INFO L290 TraceCheckUtils]: 52: Hoare triple {2382#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2543#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:45:39,049 INFO L290 TraceCheckUtils]: 53: Hoare triple {2543#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2547#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:39,049 INFO L290 TraceCheckUtils]: 54: Hoare triple {2547#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {2547#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:39,050 INFO L290 TraceCheckUtils]: 55: Hoare triple {2547#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2547#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:39,051 INFO L290 TraceCheckUtils]: 56: Hoare triple {2547#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2557#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:39,051 INFO L290 TraceCheckUtils]: 57: Hoare triple {2557#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2561#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:45:39,052 INFO L290 TraceCheckUtils]: 58: Hoare triple {2561#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2565#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:39,054 INFO L290 TraceCheckUtils]: 59: Hoare triple {2565#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {2565#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:39,055 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2565#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {2382#true} #316#return; {2572#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} is VALID [2022-02-20 23:45:39,056 INFO L290 TraceCheckUtils]: 61: Hoare triple {2572#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset := l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset; {2576#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:39,057 INFO L272 TraceCheckUtils]: 62: Hoare triple {2576#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {2580#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:45:39,058 INFO L290 TraceCheckUtils]: 63: Hoare triple {2580#(= |old(#valid)| |#valid|)} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2584#(exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35)))} is VALID [2022-02-20 23:45:39,058 INFO L290 TraceCheckUtils]: 64: Hoare triple {2584#(exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35)))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2588#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:45:39,059 INFO L290 TraceCheckUtils]: 65: Hoare triple {2588#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {2588#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:45:39,059 INFO L290 TraceCheckUtils]: 66: Hoare triple {2588#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2588#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:45:39,059 INFO L290 TraceCheckUtils]: 67: Hoare triple {2588#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2588#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:45:39,063 INFO L290 TraceCheckUtils]: 68: Hoare triple {2588#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2588#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:45:39,063 INFO L290 TraceCheckUtils]: 69: Hoare triple {2588#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2588#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:45:39,064 INFO L290 TraceCheckUtils]: 70: Hoare triple {2588#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume true; {2588#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:45:39,066 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {2588#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} {2576#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} #318#return; {2576#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:39,066 INFO L290 TraceCheckUtils]: 72: Hoare triple {2576#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} assume !(1 == #valid[l4_insert_~item~0#1.base]); {2383#false} is VALID [2022-02-20 23:45:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 69 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-02-20 23:45:39,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:45:39,490 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:45:39,490 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 12 treesize of output 11 [2022-02-20 23:45:39,588 INFO L290 TraceCheckUtils]: 72: Hoare triple {2576#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} assume !(1 == #valid[l4_insert_~item~0#1.base]); {2383#false} is VALID [2022-02-20 23:45:39,589 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {2619#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} {2576#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} #318#return; {2576#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:39,590 INFO L290 TraceCheckUtils]: 70: Hoare triple {2619#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} assume true; {2619#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} is VALID [2022-02-20 23:45:39,590 INFO L290 TraceCheckUtils]: 69: Hoare triple {2619#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2619#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} is VALID [2022-02-20 23:45:39,591 INFO L290 TraceCheckUtils]: 68: Hoare triple {2619#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2619#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} is VALID [2022-02-20 23:45:39,591 INFO L290 TraceCheckUtils]: 67: Hoare triple {2619#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2619#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} is VALID [2022-02-20 23:45:39,592 INFO L290 TraceCheckUtils]: 66: Hoare triple {2619#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2619#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} is VALID [2022-02-20 23:45:39,592 INFO L290 TraceCheckUtils]: 65: Hoare triple {2619#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {2619#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} is VALID [2022-02-20 23:45:39,593 INFO L290 TraceCheckUtils]: 64: Hoare triple {2641#(or (not (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2619#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} is VALID [2022-02-20 23:45:39,594 INFO L290 TraceCheckUtils]: 63: Hoare triple {2619#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2641#(or (not (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1))))} is VALID [2022-02-20 23:45:39,594 INFO L272 TraceCheckUtils]: 62: Hoare triple {2576#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {2619#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} is VALID [2022-02-20 23:45:39,595 INFO L290 TraceCheckUtils]: 61: Hoare triple {2572#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset := l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset; {2576#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:39,595 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2565#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {2382#true} #316#return; {2572#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} is VALID [2022-02-20 23:45:39,598 INFO L290 TraceCheckUtils]: 59: Hoare triple {2565#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {2565#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:39,598 INFO L290 TraceCheckUtils]: 58: Hoare triple {2561#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2565#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:39,599 INFO L290 TraceCheckUtils]: 57: Hoare triple {2557#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2561#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:45:39,599 INFO L290 TraceCheckUtils]: 56: Hoare triple {2547#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2557#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:39,600 INFO L290 TraceCheckUtils]: 55: Hoare triple {2547#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2547#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:39,600 INFO L290 TraceCheckUtils]: 54: Hoare triple {2547#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {2547#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:39,600 INFO L290 TraceCheckUtils]: 53: Hoare triple {2543#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2547#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:39,601 INFO L290 TraceCheckUtils]: 52: Hoare triple {2382#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2543#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:45:39,601 INFO L272 TraceCheckUtils]: 51: Hoare triple {2382#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {2382#true} is VALID [2022-02-20 23:45:39,601 INFO L290 TraceCheckUtils]: 50: Hoare triple {2382#true} assume { :begin_inline_l4_insert } true;l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset := l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset, l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset, l4_insert_~list#1.base, l4_insert_~list#1.offset, l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset;l4_insert_~list#1.base, l4_insert_~list#1.offset := l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,601 INFO L290 TraceCheckUtils]: 49: Hoare triple {2382#true} l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset := l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,602 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2382#true} {2382#true} #314#return; {2382#true} is VALID [2022-02-20 23:45:39,602 INFO L290 TraceCheckUtils]: 47: Hoare triple {2382#true} assume true; {2382#true} is VALID [2022-02-20 23:45:39,602 INFO L290 TraceCheckUtils]: 46: Hoare triple {2382#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,603 INFO L290 TraceCheckUtils]: 45: Hoare triple {2382#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,604 INFO L290 TraceCheckUtils]: 44: Hoare triple {2382#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,605 INFO L290 TraceCheckUtils]: 43: Hoare triple {2382#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2382#true} is VALID [2022-02-20 23:45:39,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {2382#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {2382#true} is VALID [2022-02-20 23:45:39,614 INFO L290 TraceCheckUtils]: 41: Hoare triple {2382#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2382#true} is VALID [2022-02-20 23:45:39,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {2382#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2382#true} is VALID [2022-02-20 23:45:39,614 INFO L272 TraceCheckUtils]: 39: Hoare triple {2382#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {2382#true} is VALID [2022-02-20 23:45:39,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {2382#true} assume { :begin_inline_l3_insert } true;l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset := l2_insert_~item~2#1.base, 4 + l2_insert_~item~2#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset, l3_insert_#t~nondet10#1, l3_insert_#t~mem11#1.base, l3_insert_#t~mem11#1.offset, l3_insert_~list#1.base, l3_insert_~list#1.offset, l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;l3_insert_~list#1.base, l3_insert_~list#1.offset := l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,614 INFO L290 TraceCheckUtils]: 37: Hoare triple {2382#true} l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset := l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,614 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2382#true} {2382#true} #312#return; {2382#true} is VALID [2022-02-20 23:45:39,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {2382#true} assume true; {2382#true} is VALID [2022-02-20 23:45:39,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {2382#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {2382#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {2382#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {2382#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2382#true} is VALID [2022-02-20 23:45:39,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {2382#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {2382#true} is VALID [2022-02-20 23:45:39,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {2382#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2382#true} is VALID [2022-02-20 23:45:39,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {2382#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2382#true} is VALID [2022-02-20 23:45:39,615 INFO L272 TraceCheckUtils]: 27: Hoare triple {2382#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {2382#true} is VALID [2022-02-20 23:45:39,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {2382#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset, l2_insert_#t~nondet13#1, l2_insert_#t~mem14#1.base, l2_insert_#t~mem14#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {2382#true} l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset := l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,615 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2382#true} {2382#true} #310#return; {2382#true} is VALID [2022-02-20 23:45:39,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {2382#true} assume true; {2382#true} is VALID [2022-02-20 23:45:39,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {2382#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {2382#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {2382#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {2382#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2382#true} is VALID [2022-02-20 23:45:39,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {2382#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {2382#true} is VALID [2022-02-20 23:45:39,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {2382#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2382#true} is VALID [2022-02-20 23:45:39,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {2382#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2382#true} is VALID [2022-02-20 23:45:39,616 INFO L272 TraceCheckUtils]: 15: Hoare triple {2382#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {2382#true} is VALID [2022-02-20 23:45:39,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {2382#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := l0_insert_~item~4#1.base, 4 + l0_insert_~item~4#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset, l1_insert_#t~nondet16#1, l1_insert_#t~mem17#1.base, l1_insert_#t~mem17#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {2382#true} l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset := l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,616 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2382#true} {2382#true} #308#return; {2382#true} is VALID [2022-02-20 23:45:39,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {2382#true} assume true; {2382#true} is VALID [2022-02-20 23:45:39,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {2382#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {2382#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {2382#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {2382#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2382#true} is VALID [2022-02-20 23:45:39,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {2382#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {2382#true} is VALID [2022-02-20 23:45:39,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {2382#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2382#true} is VALID [2022-02-20 23:45:39,616 INFO L290 TraceCheckUtils]: 4: Hoare triple {2382#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2382#true} is VALID [2022-02-20 23:45:39,616 INFO L272 TraceCheckUtils]: 3: Hoare triple {2382#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {2382#true} is VALID [2022-02-20 23:45:39,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {2382#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {2382#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~mem31#1.base, main_#t~mem31#1.offset; {2382#true} is VALID [2022-02-20 23:45:39,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {2382#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {2382#true} is VALID [2022-02-20 23:45:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 69 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-02-20 23:45:39,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:39,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077605471] [2022-02-20 23:45:39,617 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:39,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030248140] [2022-02-20 23:45:39,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030248140] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:45:39,617 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:45:39,617 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2022-02-20 23:45:39,618 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435824544] [2022-02-20 23:45:39,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:45:39,618 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2022-02-20 23:45:39,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:39,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 23:45:39,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:39,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:45:39,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:39,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:45:39,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:45:39,662 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 23:45:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:49,180 INFO L93 Difference]: Finished difference Result 223 states and 243 transitions. [2022-02-20 23:45:49,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:45:49,181 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2022-02-20 23:45:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 23:45:49,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 245 transitions. [2022-02-20 23:45:49,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 23:45:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 245 transitions. [2022-02-20 23:45:49,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 245 transitions. [2022-02-20 23:45:49,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:49,353 INFO L225 Difference]: With dead ends: 223 [2022-02-20 23:45:49,353 INFO L226 Difference]: Without dead ends: 223 [2022-02-20 23:45:49,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 132 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:45:49,354 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 125 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:49,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 1175 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 590 Invalid, 0 Unknown, 113 Unchecked, 0.4s Time] [2022-02-20 23:45:49,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-02-20 23:45:49,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 187. [2022-02-20 23:45:49,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:49,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand has 187 states, 112 states have (on average 1.7053571428571428) internal successors, (191), 177 states have internal predecessors, (191), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:45:49,363 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand has 187 states, 112 states have (on average 1.7053571428571428) internal successors, (191), 177 states have internal predecessors, (191), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:45:49,363 INFO L87 Difference]: Start difference. First operand 223 states. Second operand has 187 states, 112 states have (on average 1.7053571428571428) internal successors, (191), 177 states have internal predecessors, (191), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:45:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:49,368 INFO L93 Difference]: Finished difference Result 223 states and 243 transitions. [2022-02-20 23:45:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 243 transitions. [2022-02-20 23:45:49,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:49,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:49,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 112 states have (on average 1.7053571428571428) internal successors, (191), 177 states have internal predecessors, (191), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 223 states. [2022-02-20 23:45:49,370 INFO L87 Difference]: Start difference. First operand has 187 states, 112 states have (on average 1.7053571428571428) internal successors, (191), 177 states have internal predecessors, (191), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 223 states. [2022-02-20 23:45:49,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:49,375 INFO L93 Difference]: Finished difference Result 223 states and 243 transitions. [2022-02-20 23:45:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 243 transitions. [2022-02-20 23:45:49,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:49,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:49,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:49,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:49,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 112 states have (on average 1.7053571428571428) internal successors, (191), 177 states have internal predecessors, (191), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:45:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 204 transitions. [2022-02-20 23:45:49,380 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 204 transitions. Word has length 73 [2022-02-20 23:45:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:49,380 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 204 transitions. [2022-02-20 23:45:49,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 23:45:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2022-02-20 23:45:49,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 23:45:49,381 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:49,381 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:49,401 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:45:49,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:49,595 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:45:49,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:49,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1487051477, now seen corresponding path program 1 times [2022-02-20 23:45:49,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:49,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690596403] [2022-02-20 23:45:49,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:49,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:49,619 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:49,619 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [493765085] [2022-02-20 23:45:49,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:49,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:49,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:49,636 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:45:49,644 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:45:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:49,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 57 conjunts are in the unsatisfiable core [2022-02-20 23:45:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:49,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:49,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 23:45:58,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:45:58,873 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 21 treesize of output 21 [2022-02-20 23:45:58,904 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:45:58,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:45:58,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {3707#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {3707#true} is VALID [2022-02-20 23:45:58,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {3707#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~mem31#1.base, main_#t~mem31#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {3707#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,985 INFO L272 TraceCheckUtils]: 3: Hoare triple {3707#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {3707#true} is VALID [2022-02-20 23:45:58,985 INFO L290 TraceCheckUtils]: 4: Hoare triple {3707#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {3707#true} is VALID [2022-02-20 23:45:58,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {3707#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3707#true} is VALID [2022-02-20 23:45:58,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {3707#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {3707#true} is VALID [2022-02-20 23:45:58,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {3707#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3707#true} is VALID [2022-02-20 23:45:58,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {3707#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {3707#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {3707#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {3707#true} assume true; {3707#true} is VALID [2022-02-20 23:45:58,985 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3707#true} {3707#true} #308#return; {3707#true} is VALID [2022-02-20 23:45:58,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {3707#true} l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset := l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {3707#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := l0_insert_~item~4#1.base, 4 + l0_insert_~item~4#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset, l1_insert_#t~nondet16#1, l1_insert_#t~mem17#1.base, l1_insert_#t~mem17#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,986 INFO L272 TraceCheckUtils]: 15: Hoare triple {3707#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {3707#true} is VALID [2022-02-20 23:45:58,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {3707#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {3707#true} is VALID [2022-02-20 23:45:58,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {3707#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3707#true} is VALID [2022-02-20 23:45:58,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {3707#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {3707#true} is VALID [2022-02-20 23:45:58,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {3707#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3707#true} is VALID [2022-02-20 23:45:58,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {3707#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {3707#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {3707#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {3707#true} assume true; {3707#true} is VALID [2022-02-20 23:45:58,986 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3707#true} {3707#true} #310#return; {3707#true} is VALID [2022-02-20 23:45:58,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {3707#true} l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset := l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {3707#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset, l2_insert_#t~nondet13#1, l2_insert_#t~mem14#1.base, l2_insert_#t~mem14#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,987 INFO L272 TraceCheckUtils]: 27: Hoare triple {3707#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {3707#true} is VALID [2022-02-20 23:45:58,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {3707#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {3707#true} is VALID [2022-02-20 23:45:58,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {3707#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3707#true} is VALID [2022-02-20 23:45:58,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {3707#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {3707#true} is VALID [2022-02-20 23:45:58,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {3707#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3707#true} is VALID [2022-02-20 23:45:58,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {3707#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,988 INFO L290 TraceCheckUtils]: 33: Hoare triple {3707#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {3707#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,988 INFO L290 TraceCheckUtils]: 35: Hoare triple {3707#true} assume true; {3707#true} is VALID [2022-02-20 23:45:58,988 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3707#true} {3707#true} #312#return; {3707#true} is VALID [2022-02-20 23:45:58,988 INFO L290 TraceCheckUtils]: 37: Hoare triple {3707#true} l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset := l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,988 INFO L290 TraceCheckUtils]: 38: Hoare triple {3707#true} assume { :begin_inline_l3_insert } true;l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset := l2_insert_~item~2#1.base, 4 + l2_insert_~item~2#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset, l3_insert_#t~nondet10#1, l3_insert_#t~mem11#1.base, l3_insert_#t~mem11#1.offset, l3_insert_~list#1.base, l3_insert_~list#1.offset, l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;l3_insert_~list#1.base, l3_insert_~list#1.offset := l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,988 INFO L272 TraceCheckUtils]: 39: Hoare triple {3707#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {3707#true} is VALID [2022-02-20 23:45:58,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {3707#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {3707#true} is VALID [2022-02-20 23:45:58,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {3707#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3707#true} is VALID [2022-02-20 23:45:58,988 INFO L290 TraceCheckUtils]: 42: Hoare triple {3707#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {3707#true} is VALID [2022-02-20 23:45:58,988 INFO L290 TraceCheckUtils]: 43: Hoare triple {3707#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3707#true} is VALID [2022-02-20 23:45:58,988 INFO L290 TraceCheckUtils]: 44: Hoare triple {3707#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,992 INFO L290 TraceCheckUtils]: 45: Hoare triple {3707#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,992 INFO L290 TraceCheckUtils]: 46: Hoare triple {3707#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,992 INFO L290 TraceCheckUtils]: 47: Hoare triple {3707#true} assume true; {3707#true} is VALID [2022-02-20 23:45:58,992 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3707#true} {3707#true} #314#return; {3707#true} is VALID [2022-02-20 23:45:58,992 INFO L290 TraceCheckUtils]: 49: Hoare triple {3707#true} l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset := l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,992 INFO L290 TraceCheckUtils]: 50: Hoare triple {3707#true} assume { :begin_inline_l4_insert } true;l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset := l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset, l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset, l4_insert_~list#1.base, l4_insert_~list#1.offset, l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset;l4_insert_~list#1.base, l4_insert_~list#1.offset := l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset; {3707#true} is VALID [2022-02-20 23:45:58,993 INFO L272 TraceCheckUtils]: 51: Hoare triple {3707#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {3707#true} is VALID [2022-02-20 23:45:58,995 INFO L290 TraceCheckUtils]: 52: Hoare triple {3707#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {3868#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} is VALID [2022-02-20 23:45:58,997 INFO L290 TraceCheckUtils]: 53: Hoare triple {3868#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3872#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} is VALID [2022-02-20 23:45:58,998 INFO L290 TraceCheckUtils]: 54: Hoare triple {3872#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {3872#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} is VALID [2022-02-20 23:45:58,998 INFO L290 TraceCheckUtils]: 55: Hoare triple {3872#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3872#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} is VALID [2022-02-20 23:45:58,999 INFO L290 TraceCheckUtils]: 56: Hoare triple {3872#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {3882#(and (= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1) (= |zalloc_or_die_calloc_model_#res#1.offset| 0) (or (and (= (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (= (mod (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) |zalloc_or_die_#in~size#1|) 0) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) |zalloc_or_die_#in~size#1|)))))} is VALID [2022-02-20 23:45:59,000 INFO L290 TraceCheckUtils]: 57: Hoare triple {3882#(and (= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1) (= |zalloc_or_die_calloc_model_#res#1.offset| 0) (or (and (= (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (= (mod (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) |zalloc_or_die_#in~size#1|) 0) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) |zalloc_or_die_#in~size#1|)))))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {3886#(and (= |zalloc_or_die_~ptr~1#1.offset| 0) (or (and (= (mod (select |#length| |zalloc_or_die_~ptr~1#1.base|) |zalloc_or_die_#in~size#1|) 0) (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_~ptr~1#1.base|) |zalloc_or_die_#in~size#1|))) (and (= (select |#length| |zalloc_or_die_~ptr~1#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0))) (= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1))} is VALID [2022-02-20 23:45:59,002 INFO L290 TraceCheckUtils]: 58: Hoare triple {3886#(and (= |zalloc_or_die_~ptr~1#1.offset| 0) (or (and (= (mod (select |#length| |zalloc_or_die_~ptr~1#1.base|) |zalloc_or_die_#in~size#1|) 0) (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_~ptr~1#1.base|) |zalloc_or_die_#in~size#1|))) (and (= (select |#length| |zalloc_or_die_~ptr~1#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0))) (= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {3890#(and (= |zalloc_or_die_#res#1.offset| 0) (or (and (= (select |#length| |zalloc_or_die_#res#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0)) (and (<= 1 (div (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|)) (not (= |zalloc_or_die_#in~size#1| 0)) (= (mod (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|) 0))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} is VALID [2022-02-20 23:45:59,002 INFO L290 TraceCheckUtils]: 59: Hoare triple {3890#(and (= |zalloc_or_die_#res#1.offset| 0) (or (and (= (select |#length| |zalloc_or_die_#res#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0)) (and (<= 1 (div (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|)) (not (= |zalloc_or_die_#in~size#1| 0)) (= (mod (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|) 0))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} assume true; {3890#(and (= |zalloc_or_die_#res#1.offset| 0) (or (and (= (select |#length| |zalloc_or_die_#res#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0)) (and (<= 1 (div (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|)) (not (= |zalloc_or_die_#in~size#1| 0)) (= (mod (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|) 0))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} is VALID [2022-02-20 23:45:59,004 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3890#(and (= |zalloc_or_die_#res#1.offset| 0) (or (and (= (select |#length| |zalloc_or_die_#res#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0)) (and (<= 1 (div (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|)) (not (= |zalloc_or_die_#in~size#1| 0)) (= (mod (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|) 0))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} {3707#true} #316#return; {3897#(and (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_17| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) (= (mod (select |#length| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) 0) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|)))) (= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1) (= |ULTIMATE.start_l4_insert_#t~ret6#1.offset| 0))} is VALID [2022-02-20 23:45:59,005 INFO L290 TraceCheckUtils]: 61: Hoare triple {3897#(and (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_17| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) (= (mod (select |#length| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) 0) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|)))) (= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1) (= |ULTIMATE.start_l4_insert_#t~ret6#1.offset| 0))} l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset := l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset; {3901#(and (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_17| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) 0))) (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1))} is VALID [2022-02-20 23:45:59,006 INFO L272 TraceCheckUtils]: 62: Hoare triple {3901#(and (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_17| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) 0))) (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1))} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {3905#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:45:59,007 INFO L290 TraceCheckUtils]: 63: Hoare triple {3905#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {3909#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} is VALID [2022-02-20 23:45:59,007 INFO L290 TraceCheckUtils]: 64: Hoare triple {3909#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3909#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} is VALID [2022-02-20 23:45:59,008 INFO L290 TraceCheckUtils]: 65: Hoare triple {3909#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {3909#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} is VALID [2022-02-20 23:45:59,009 INFO L290 TraceCheckUtils]: 66: Hoare triple {3909#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3909#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} is VALID [2022-02-20 23:45:59,017 INFO L290 TraceCheckUtils]: 67: Hoare triple {3909#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {3909#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} is VALID [2022-02-20 23:45:59,019 INFO L290 TraceCheckUtils]: 68: Hoare triple {3909#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {3909#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} is VALID [2022-02-20 23:45:59,020 INFO L290 TraceCheckUtils]: 69: Hoare triple {3909#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {3909#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} is VALID [2022-02-20 23:45:59,020 INFO L290 TraceCheckUtils]: 70: Hoare triple {3909#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} assume true; {3909#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} is VALID [2022-02-20 23:45:59,024 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3909#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} {3901#(and (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_17| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) 0))) (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1))} #318#return; {3934#(and (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_17| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) 0))) (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0))} is VALID [2022-02-20 23:45:59,025 INFO L290 TraceCheckUtils]: 72: Hoare triple {3934#(and (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_17| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) 0))) (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0))} assume !(4 + (4 + l4_insert_~item~0#1.offset) <= #length[l4_insert_~item~0#1.base] && 0 <= 4 + l4_insert_~item~0#1.offset); {3708#false} is VALID [2022-02-20 23:45:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 69 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-02-20 23:45:59,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:45:59,196 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:59,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690596403] [2022-02-20 23:45:59,196 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:59,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493765085] [2022-02-20 23:45:59,196 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493765085] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:45:59,197 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:45:59,197 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-02-20 23:45:59,197 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872745420] [2022-02-20 23:45:59,197 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 23:45:59,197 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2022-02-20 23:45:59,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:59,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:45:59,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:59,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:45:59,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:59,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:45:59,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:45:59,242 INFO L87 Difference]: Start difference. First operand 187 states and 204 transitions. Second operand has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:01,060 INFO L93 Difference]: Finished difference Result 186 states and 202 transitions. [2022-02-20 23:46:01,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:46:01,060 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2022-02-20 23:46:01,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2022-02-20 23:46:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2022-02-20 23:46:01,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 192 transitions. [2022-02-20 23:46:01,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:01,198 INFO L225 Difference]: With dead ends: 186 [2022-02-20 23:46:01,198 INFO L226 Difference]: Without dead ends: 186 [2022-02-20 23:46:01,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:46:01,199 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 2 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:01,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1032 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 516 Invalid, 0 Unknown, 221 Unchecked, 0.5s Time] [2022-02-20 23:46:01,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-02-20 23:46:01,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-02-20 23:46:01,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:01,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 186 states, 112 states have (on average 1.6875) internal successors, (189), 176 states have internal predecessors, (189), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:46:01,203 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 186 states, 112 states have (on average 1.6875) internal successors, (189), 176 states have internal predecessors, (189), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:46:01,204 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 186 states, 112 states have (on average 1.6875) internal successors, (189), 176 states have internal predecessors, (189), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:46:01,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:01,207 INFO L93 Difference]: Finished difference Result 186 states and 202 transitions. [2022-02-20 23:46:01,207 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 202 transitions. [2022-02-20 23:46:01,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:01,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:01,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 112 states have (on average 1.6875) internal successors, (189), 176 states have internal predecessors, (189), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 186 states. [2022-02-20 23:46:01,209 INFO L87 Difference]: Start difference. First operand has 186 states, 112 states have (on average 1.6875) internal successors, (189), 176 states have internal predecessors, (189), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 186 states. [2022-02-20 23:46:01,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:01,212 INFO L93 Difference]: Finished difference Result 186 states and 202 transitions. [2022-02-20 23:46:01,212 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 202 transitions. [2022-02-20 23:46:01,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:01,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:01,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:01,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 112 states have (on average 1.6875) internal successors, (189), 176 states have internal predecessors, (189), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-20 23:46:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 202 transitions. [2022-02-20 23:46:01,216 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 202 transitions. Word has length 73 [2022-02-20 23:46:01,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:01,217 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 202 transitions. [2022-02-20 23:46:01,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 202 transitions. [2022-02-20 23:46:01,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 23:46:01,218 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:01,218 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:01,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:01,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:01,435 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:46:01,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:01,435 INFO L85 PathProgramCache]: Analyzing trace with hash 120292531, now seen corresponding path program 1 times [2022-02-20 23:46:01,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:01,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517063402] [2022-02-20 23:46:01,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:01,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:01,461 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:01,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [488748346] [2022-02-20 23:46:01,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:01,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:01,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:01,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:46:01,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 23:46:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:01,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:46:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:01,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:01,996 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:46:01,997 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 12 treesize of output 14 [2022-02-20 23:46:02,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {4700#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {4700#true} is VALID [2022-02-20 23:46:02,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {4700#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~mem31#1.base, main_#t~mem31#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {4700#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,012 INFO L272 TraceCheckUtils]: 3: Hoare triple {4700#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {4700#true} is VALID [2022-02-20 23:46:02,012 INFO L290 TraceCheckUtils]: 4: Hoare triple {4700#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4700#true} is VALID [2022-02-20 23:46:02,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {4700#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4700#true} is VALID [2022-02-20 23:46:02,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {4700#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {4700#true} is VALID [2022-02-20 23:46:02,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {4700#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4700#true} is VALID [2022-02-20 23:46:02,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {4700#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {4700#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {4700#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-02-20 23:46:02,013 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4700#true} {4700#true} #308#return; {4700#true} is VALID [2022-02-20 23:46:02,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {4700#true} l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset := l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {4700#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := l0_insert_~item~4#1.base, 4 + l0_insert_~item~4#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset, l1_insert_#t~nondet16#1, l1_insert_#t~mem17#1.base, l1_insert_#t~mem17#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,013 INFO L272 TraceCheckUtils]: 15: Hoare triple {4700#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {4700#true} is VALID [2022-02-20 23:46:02,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {4700#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4700#true} is VALID [2022-02-20 23:46:02,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {4700#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4700#true} is VALID [2022-02-20 23:46:02,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {4700#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {4700#true} is VALID [2022-02-20 23:46:02,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {4700#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4700#true} is VALID [2022-02-20 23:46:02,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {4700#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {4700#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {4700#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-02-20 23:46:02,014 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4700#true} {4700#true} #310#return; {4700#true} is VALID [2022-02-20 23:46:02,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {4700#true} l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset := l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {4700#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset, l2_insert_#t~nondet13#1, l2_insert_#t~mem14#1.base, l2_insert_#t~mem14#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,015 INFO L272 TraceCheckUtils]: 27: Hoare triple {4700#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {4700#true} is VALID [2022-02-20 23:46:02,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {4700#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4700#true} is VALID [2022-02-20 23:46:02,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {4700#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4700#true} is VALID [2022-02-20 23:46:02,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {4700#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {4700#true} is VALID [2022-02-20 23:46:02,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {4700#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4700#true} is VALID [2022-02-20 23:46:02,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {4700#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,016 INFO L290 TraceCheckUtils]: 33: Hoare triple {4700#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {4700#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,016 INFO L290 TraceCheckUtils]: 35: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-02-20 23:46:02,016 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4700#true} {4700#true} #312#return; {4700#true} is VALID [2022-02-20 23:46:02,016 INFO L290 TraceCheckUtils]: 37: Hoare triple {4700#true} l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset := l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,016 INFO L290 TraceCheckUtils]: 38: Hoare triple {4700#true} assume { :begin_inline_l3_insert } true;l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset := l2_insert_~item~2#1.base, 4 + l2_insert_~item~2#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset, l3_insert_#t~nondet10#1, l3_insert_#t~mem11#1.base, l3_insert_#t~mem11#1.offset, l3_insert_~list#1.base, l3_insert_~list#1.offset, l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;l3_insert_~list#1.base, l3_insert_~list#1.offset := l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,016 INFO L272 TraceCheckUtils]: 39: Hoare triple {4700#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {4700#true} is VALID [2022-02-20 23:46:02,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {4700#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4700#true} is VALID [2022-02-20 23:46:02,017 INFO L290 TraceCheckUtils]: 41: Hoare triple {4700#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4700#true} is VALID [2022-02-20 23:46:02,017 INFO L290 TraceCheckUtils]: 42: Hoare triple {4700#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {4700#true} is VALID [2022-02-20 23:46:02,017 INFO L290 TraceCheckUtils]: 43: Hoare triple {4700#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4700#true} is VALID [2022-02-20 23:46:02,017 INFO L290 TraceCheckUtils]: 44: Hoare triple {4700#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,017 INFO L290 TraceCheckUtils]: 45: Hoare triple {4700#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,017 INFO L290 TraceCheckUtils]: 46: Hoare triple {4700#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,017 INFO L290 TraceCheckUtils]: 47: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-02-20 23:46:02,018 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4700#true} {4700#true} #314#return; {4700#true} is VALID [2022-02-20 23:46:02,018 INFO L290 TraceCheckUtils]: 49: Hoare triple {4700#true} l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset := l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,018 INFO L290 TraceCheckUtils]: 50: Hoare triple {4700#true} assume { :begin_inline_l4_insert } true;l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset := l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset, l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset, l4_insert_~list#1.base, l4_insert_~list#1.offset, l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset;l4_insert_~list#1.base, l4_insert_~list#1.offset := l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,018 INFO L272 TraceCheckUtils]: 51: Hoare triple {4700#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {4700#true} is VALID [2022-02-20 23:46:02,019 INFO L290 TraceCheckUtils]: 52: Hoare triple {4700#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4861#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:46:02,019 INFO L290 TraceCheckUtils]: 53: Hoare triple {4861#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4865#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:02,019 INFO L290 TraceCheckUtils]: 54: Hoare triple {4865#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {4865#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:02,020 INFO L290 TraceCheckUtils]: 55: Hoare triple {4865#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4865#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:02,020 INFO L290 TraceCheckUtils]: 56: Hoare triple {4865#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4875#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:02,020 INFO L290 TraceCheckUtils]: 57: Hoare triple {4875#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4879#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:02,021 INFO L290 TraceCheckUtils]: 58: Hoare triple {4879#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4883#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:02,021 INFO L290 TraceCheckUtils]: 59: Hoare triple {4883#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {4883#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:02,022 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4883#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {4700#true} #316#return; {4890#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} is VALID [2022-02-20 23:46:02,022 INFO L290 TraceCheckUtils]: 61: Hoare triple {4890#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset := l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset; {4894#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:02,023 INFO L272 TraceCheckUtils]: 62: Hoare triple {4894#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {4898#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:02,024 INFO L290 TraceCheckUtils]: 63: Hoare triple {4898#(= |old(#valid)| |#valid|)} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4902#(exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|))} is VALID [2022-02-20 23:46:02,025 INFO L290 TraceCheckUtils]: 64: Hoare triple {4902#(exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4906#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:02,026 INFO L290 TraceCheckUtils]: 65: Hoare triple {4906#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {4906#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:02,027 INFO L290 TraceCheckUtils]: 66: Hoare triple {4906#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr33#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr33#1 := #Ultimate.C_memset_#value#1 % 256];#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr33#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr33#1 := 1 + #Ultimate.C_memset_#t~loopctr33#1; {4906#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:02,028 INFO L290 TraceCheckUtils]: 67: Hoare triple {4906#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4906#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:02,028 INFO L290 TraceCheckUtils]: 68: Hoare triple {4906#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4906#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:02,029 INFO L290 TraceCheckUtils]: 69: Hoare triple {4906#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4906#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:02,030 INFO L290 TraceCheckUtils]: 70: Hoare triple {4906#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4906#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:02,030 INFO L290 TraceCheckUtils]: 71: Hoare triple {4906#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume true; {4906#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:02,031 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {4906#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} {4894#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} #318#return; {4894#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:02,032 INFO L290 TraceCheckUtils]: 73: Hoare triple {4894#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} assume !(1 == #valid[l4_insert_~item~0#1.base]); {4701#false} is VALID [2022-02-20 23:46:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 73 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-02-20 23:46:02,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:02,444 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:46:02,445 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 12 treesize of output 11 [2022-02-20 23:46:02,544 INFO L290 TraceCheckUtils]: 73: Hoare triple {4894#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} assume !(1 == #valid[l4_insert_~item~0#1.base]); {4701#false} is VALID [2022-02-20 23:46:02,546 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {4940#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} {4894#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} #318#return; {4894#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:02,547 INFO L290 TraceCheckUtils]: 71: Hoare triple {4940#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} assume true; {4940#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} is VALID [2022-02-20 23:46:02,547 INFO L290 TraceCheckUtils]: 70: Hoare triple {4940#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4940#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} is VALID [2022-02-20 23:46:02,547 INFO L290 TraceCheckUtils]: 69: Hoare triple {4940#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4940#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} is VALID [2022-02-20 23:46:02,547 INFO L290 TraceCheckUtils]: 68: Hoare triple {4940#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4940#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} is VALID [2022-02-20 23:46:02,548 INFO L290 TraceCheckUtils]: 67: Hoare triple {4940#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4940#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} is VALID [2022-02-20 23:46:02,548 INFO L290 TraceCheckUtils]: 66: Hoare triple {4940#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} assume #Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr33#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr33#1 := #Ultimate.C_memset_#value#1 % 256];#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr33#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr33#1 := 1 + #Ultimate.C_memset_#t~loopctr33#1; {4940#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} is VALID [2022-02-20 23:46:02,548 INFO L290 TraceCheckUtils]: 65: Hoare triple {4940#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {4940#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} is VALID [2022-02-20 23:46:02,549 INFO L290 TraceCheckUtils]: 64: Hoare triple {4965#(or (not (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1)))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4940#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} is VALID [2022-02-20 23:46:02,551 INFO L290 TraceCheckUtils]: 63: Hoare triple {4940#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4965#(or (not (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1)))))} is VALID [2022-02-20 23:46:02,551 INFO L272 TraceCheckUtils]: 62: Hoare triple {4894#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {4940#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} is VALID [2022-02-20 23:46:02,552 INFO L290 TraceCheckUtils]: 61: Hoare triple {4890#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset := l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset; {4894#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:02,552 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4883#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {4700#true} #316#return; {4890#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} is VALID [2022-02-20 23:46:02,553 INFO L290 TraceCheckUtils]: 59: Hoare triple {4883#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {4883#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:02,553 INFO L290 TraceCheckUtils]: 58: Hoare triple {4879#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4883#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:02,553 INFO L290 TraceCheckUtils]: 57: Hoare triple {4875#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4879#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:02,554 INFO L290 TraceCheckUtils]: 56: Hoare triple {4865#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4875#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:02,554 INFO L290 TraceCheckUtils]: 55: Hoare triple {4865#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4865#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:02,554 INFO L290 TraceCheckUtils]: 54: Hoare triple {4865#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {4865#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:02,555 INFO L290 TraceCheckUtils]: 53: Hoare triple {4861#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4865#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:02,555 INFO L290 TraceCheckUtils]: 52: Hoare triple {4700#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4861#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:46:02,555 INFO L272 TraceCheckUtils]: 51: Hoare triple {4700#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {4700#true} is VALID [2022-02-20 23:46:02,555 INFO L290 TraceCheckUtils]: 50: Hoare triple {4700#true} assume { :begin_inline_l4_insert } true;l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset := l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset, l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset, l4_insert_~list#1.base, l4_insert_~list#1.offset, l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset;l4_insert_~list#1.base, l4_insert_~list#1.offset := l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,555 INFO L290 TraceCheckUtils]: 49: Hoare triple {4700#true} l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset := l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,555 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4700#true} {4700#true} #314#return; {4700#true} is VALID [2022-02-20 23:46:02,555 INFO L290 TraceCheckUtils]: 47: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-02-20 23:46:02,555 INFO L290 TraceCheckUtils]: 46: Hoare triple {4700#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,555 INFO L290 TraceCheckUtils]: 45: Hoare triple {4700#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,555 INFO L290 TraceCheckUtils]: 44: Hoare triple {4700#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,555 INFO L290 TraceCheckUtils]: 43: Hoare triple {4700#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4700#true} is VALID [2022-02-20 23:46:02,556 INFO L290 TraceCheckUtils]: 42: Hoare triple {4700#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {4700#true} is VALID [2022-02-20 23:46:02,556 INFO L290 TraceCheckUtils]: 41: Hoare triple {4700#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4700#true} is VALID [2022-02-20 23:46:02,556 INFO L290 TraceCheckUtils]: 40: Hoare triple {4700#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4700#true} is VALID [2022-02-20 23:46:02,556 INFO L272 TraceCheckUtils]: 39: Hoare triple {4700#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {4700#true} is VALID [2022-02-20 23:46:02,556 INFO L290 TraceCheckUtils]: 38: Hoare triple {4700#true} assume { :begin_inline_l3_insert } true;l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset := l2_insert_~item~2#1.base, 4 + l2_insert_~item~2#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset, l3_insert_#t~nondet10#1, l3_insert_#t~mem11#1.base, l3_insert_#t~mem11#1.offset, l3_insert_~list#1.base, l3_insert_~list#1.offset, l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;l3_insert_~list#1.base, l3_insert_~list#1.offset := l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,556 INFO L290 TraceCheckUtils]: 37: Hoare triple {4700#true} l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset := l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,556 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4700#true} {4700#true} #312#return; {4700#true} is VALID [2022-02-20 23:46:02,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-02-20 23:46:02,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {4700#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {4700#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,556 INFO L290 TraceCheckUtils]: 32: Hoare triple {4700#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {4700#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4700#true} is VALID [2022-02-20 23:46:02,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {4700#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {4700#true} is VALID [2022-02-20 23:46:02,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {4700#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4700#true} is VALID [2022-02-20 23:46:02,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {4700#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4700#true} is VALID [2022-02-20 23:46:02,556 INFO L272 TraceCheckUtils]: 27: Hoare triple {4700#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {4700#true} is VALID [2022-02-20 23:46:02,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {4700#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset, l2_insert_#t~nondet13#1, l2_insert_#t~mem14#1.base, l2_insert_#t~mem14#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {4700#true} l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset := l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,557 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4700#true} {4700#true} #310#return; {4700#true} is VALID [2022-02-20 23:46:02,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-02-20 23:46:02,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {4700#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {4700#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {4700#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {4700#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4700#true} is VALID [2022-02-20 23:46:02,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {4700#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {4700#true} is VALID [2022-02-20 23:46:02,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {4700#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4700#true} is VALID [2022-02-20 23:46:02,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {4700#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4700#true} is VALID [2022-02-20 23:46:02,557 INFO L272 TraceCheckUtils]: 15: Hoare triple {4700#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {4700#true} is VALID [2022-02-20 23:46:02,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {4700#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := l0_insert_~item~4#1.base, 4 + l0_insert_~item~4#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset, l1_insert_#t~nondet16#1, l1_insert_#t~mem17#1.base, l1_insert_#t~mem17#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {4700#true} l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset := l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,557 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4700#true} {4700#true} #308#return; {4700#true} is VALID [2022-02-20 23:46:02,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {4700#true} assume true; {4700#true} is VALID [2022-02-20 23:46:02,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {4700#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {4700#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {4700#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {4700#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4700#true} is VALID [2022-02-20 23:46:02,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {4700#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {4700#true} is VALID [2022-02-20 23:46:02,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {4700#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4700#true} is VALID [2022-02-20 23:46:02,564 INFO L290 TraceCheckUtils]: 4: Hoare triple {4700#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4700#true} is VALID [2022-02-20 23:46:02,565 INFO L272 TraceCheckUtils]: 3: Hoare triple {4700#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {4700#true} is VALID [2022-02-20 23:46:02,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {4700#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {4700#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~mem31#1.base, main_#t~mem31#1.offset; {4700#true} is VALID [2022-02-20 23:46:02,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {4700#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {4700#true} is VALID [2022-02-20 23:46:02,569 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 73 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-02-20 23:46:02,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:02,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517063402] [2022-02-20 23:46:02,569 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:02,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488748346] [2022-02-20 23:46:02,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488748346] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:46:02,569 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:46:02,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2022-02-20 23:46:02,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908107626] [2022-02-20 23:46:02,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:02,571 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2022-02-20 23:46:02,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:02,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 23:46:02,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:02,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:46:02,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:02,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:46:02,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:46:02,620 INFO L87 Difference]: Start difference. First operand 186 states and 202 transitions. Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 23:46:12,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:12,164 INFO L93 Difference]: Finished difference Result 226 states and 246 transitions. [2022-02-20 23:46:12,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:46:12,165 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2022-02-20 23:46:12,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 23:46:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 239 transitions. [2022-02-20 23:46:12,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 23:46:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 239 transitions. [2022-02-20 23:46:12,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 239 transitions. [2022-02-20 23:46:12,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:12,360 INFO L225 Difference]: With dead ends: 226 [2022-02-20 23:46:12,360 INFO L226 Difference]: Without dead ends: 226 [2022-02-20 23:46:12,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 135 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:46:12,360 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 124 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:12,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 1284 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 576 Invalid, 0 Unknown, 112 Unchecked, 0.4s Time] [2022-02-20 23:46:12,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-02-20 23:46:12,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 184. [2022-02-20 23:46:12,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:12,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 184 states, 111 states have (on average 1.6846846846846846) internal successors, (187), 175 states have internal predecessors, (187), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:46:12,365 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 184 states, 111 states have (on average 1.6846846846846846) internal successors, (187), 175 states have internal predecessors, (187), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:46:12,365 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 184 states, 111 states have (on average 1.6846846846846846) internal successors, (187), 175 states have internal predecessors, (187), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:46:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:12,370 INFO L93 Difference]: Finished difference Result 226 states and 246 transitions. [2022-02-20 23:46:12,370 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 246 transitions. [2022-02-20 23:46:12,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:12,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:12,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 111 states have (on average 1.6846846846846846) internal successors, (187), 175 states have internal predecessors, (187), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 226 states. [2022-02-20 23:46:12,371 INFO L87 Difference]: Start difference. First operand has 184 states, 111 states have (on average 1.6846846846846846) internal successors, (187), 175 states have internal predecessors, (187), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 226 states. [2022-02-20 23:46:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:12,376 INFO L93 Difference]: Finished difference Result 226 states and 246 transitions. [2022-02-20 23:46:12,376 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 246 transitions. [2022-02-20 23:46:12,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:12,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:12,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:12,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 111 states have (on average 1.6846846846846846) internal successors, (187), 175 states have internal predecessors, (187), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:46:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2022-02-20 23:46:12,380 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 74 [2022-02-20 23:46:12,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:12,381 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2022-02-20 23:46:12,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 23:46:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2022-02-20 23:46:12,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 23:46:12,381 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:12,382 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:12,403 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-20 23:46:12,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:12,603 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:46:12,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:12,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1167639435, now seen corresponding path program 1 times [2022-02-20 23:46:12,603 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:12,603 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972845120] [2022-02-20 23:46:12,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:12,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:12,628 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:12,628 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [903576361] [2022-02-20 23:46:12,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:12,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:12,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:12,629 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:46:12,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 23:46:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:12,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 23:46:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:12,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:13,112 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:46:13,112 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 12 treesize of output 14 [2022-02-20 23:46:13,304 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:46:13,304 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 12 treesize of output 14 [2022-02-20 23:46:13,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {6038#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {6038#true} is VALID [2022-02-20 23:46:13,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {6038#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~mem31#1.base, main_#t~mem31#1.offset; {6038#true} is VALID [2022-02-20 23:46:13,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {6038#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {6038#true} is VALID [2022-02-20 23:46:13,322 INFO L272 TraceCheckUtils]: 3: Hoare triple {6038#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {6038#true} is VALID [2022-02-20 23:46:13,322 INFO L290 TraceCheckUtils]: 4: Hoare triple {6038#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {6038#true} is VALID [2022-02-20 23:46:13,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {6038#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6038#true} is VALID [2022-02-20 23:46:13,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {6038#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {6038#true} is VALID [2022-02-20 23:46:13,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {6038#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6038#true} is VALID [2022-02-20 23:46:13,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {6038#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {6038#true} is VALID [2022-02-20 23:46:13,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {6038#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {6038#true} is VALID [2022-02-20 23:46:13,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {6038#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {6038#true} is VALID [2022-02-20 23:46:13,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {6038#true} assume true; {6038#true} is VALID [2022-02-20 23:46:13,323 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6038#true} {6038#true} #308#return; {6038#true} is VALID [2022-02-20 23:46:13,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {6038#true} l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset := l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset; {6038#true} is VALID [2022-02-20 23:46:13,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {6038#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := l0_insert_~item~4#1.base, 4 + l0_insert_~item~4#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset, l1_insert_#t~nondet16#1, l1_insert_#t~mem17#1.base, l1_insert_#t~mem17#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {6038#true} is VALID [2022-02-20 23:46:13,323 INFO L272 TraceCheckUtils]: 15: Hoare triple {6038#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {6038#true} is VALID [2022-02-20 23:46:13,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {6038#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {6038#true} is VALID [2022-02-20 23:46:13,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {6038#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6038#true} is VALID [2022-02-20 23:46:13,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {6038#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {6038#true} is VALID [2022-02-20 23:46:13,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {6038#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6038#true} is VALID [2022-02-20 23:46:13,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {6038#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {6038#true} is VALID [2022-02-20 23:46:13,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {6038#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {6038#true} is VALID [2022-02-20 23:46:13,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {6038#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {6038#true} is VALID [2022-02-20 23:46:13,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {6038#true} assume true; {6038#true} is VALID [2022-02-20 23:46:13,325 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6038#true} {6038#true} #310#return; {6038#true} is VALID [2022-02-20 23:46:13,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {6038#true} l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset := l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset; {6038#true} is VALID [2022-02-20 23:46:13,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {6038#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset, l2_insert_#t~nondet13#1, l2_insert_#t~mem14#1.base, l2_insert_#t~mem14#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {6038#true} is VALID [2022-02-20 23:46:13,325 INFO L272 TraceCheckUtils]: 27: Hoare triple {6038#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {6038#true} is VALID [2022-02-20 23:46:13,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {6038#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {6038#true} is VALID [2022-02-20 23:46:13,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {6038#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6038#true} is VALID [2022-02-20 23:46:13,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {6038#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {6038#true} is VALID [2022-02-20 23:46:13,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {6038#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6038#true} is VALID [2022-02-20 23:46:13,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {6038#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {6038#true} is VALID [2022-02-20 23:46:13,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {6038#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {6038#true} is VALID [2022-02-20 23:46:13,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {6038#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {6038#true} is VALID [2022-02-20 23:46:13,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {6038#true} assume true; {6038#true} is VALID [2022-02-20 23:46:13,326 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6038#true} {6038#true} #312#return; {6038#true} is VALID [2022-02-20 23:46:13,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {6038#true} l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset := l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset; {6038#true} is VALID [2022-02-20 23:46:13,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {6038#true} assume { :begin_inline_l3_insert } true;l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset := l2_insert_~item~2#1.base, 4 + l2_insert_~item~2#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset, l3_insert_#t~nondet10#1, l3_insert_#t~mem11#1.base, l3_insert_#t~mem11#1.offset, l3_insert_~list#1.base, l3_insert_~list#1.offset, l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;l3_insert_~list#1.base, l3_insert_~list#1.offset := l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset; {6038#true} is VALID [2022-02-20 23:46:13,327 INFO L272 TraceCheckUtils]: 39: Hoare triple {6038#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {6038#true} is VALID [2022-02-20 23:46:13,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {6038#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {6163#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:46:13,327 INFO L290 TraceCheckUtils]: 41: Hoare triple {6163#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6167#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:13,328 INFO L290 TraceCheckUtils]: 42: Hoare triple {6167#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {6167#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:13,328 INFO L290 TraceCheckUtils]: 43: Hoare triple {6167#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6167#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:13,328 INFO L290 TraceCheckUtils]: 44: Hoare triple {6167#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {6177#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:13,328 INFO L290 TraceCheckUtils]: 45: Hoare triple {6177#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {6181#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:13,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {6181#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {6185#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:13,329 INFO L290 TraceCheckUtils]: 47: Hoare triple {6185#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {6185#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:13,330 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6185#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {6038#true} #314#return; {6192#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} is VALID [2022-02-20 23:46:13,330 INFO L290 TraceCheckUtils]: 49: Hoare triple {6192#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset := l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset; {6196#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:46:13,330 INFO L290 TraceCheckUtils]: 50: Hoare triple {6196#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} assume { :begin_inline_l4_insert } true;l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset := l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset, l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset, l4_insert_~list#1.base, l4_insert_~list#1.offset, l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset;l4_insert_~list#1.base, l4_insert_~list#1.offset := l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset; {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:13,331 INFO L272 TraceCheckUtils]: 51: Hoare triple {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {6204#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:13,332 INFO L290 TraceCheckUtils]: 52: Hoare triple {6204#(= |old(#valid)| |#valid|)} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {6208#(exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|))} is VALID [2022-02-20 23:46:13,333 INFO L290 TraceCheckUtils]: 53: Hoare triple {6208#(exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:13,334 INFO L290 TraceCheckUtils]: 54: Hoare triple {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:13,335 INFO L290 TraceCheckUtils]: 55: Hoare triple {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:13,335 INFO L290 TraceCheckUtils]: 56: Hoare triple {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:13,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:13,336 INFO L290 TraceCheckUtils]: 58: Hoare triple {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:13,337 INFO L290 TraceCheckUtils]: 59: Hoare triple {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume true; {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:13,338 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #316#return; {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:13,338 INFO L290 TraceCheckUtils]: 61: Hoare triple {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset := l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset; {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:13,338 INFO L272 TraceCheckUtils]: 62: Hoare triple {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {6204#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:13,340 INFO L290 TraceCheckUtils]: 63: Hoare triple {6204#(= |old(#valid)| |#valid|)} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {6208#(exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|))} is VALID [2022-02-20 23:46:13,341 INFO L290 TraceCheckUtils]: 64: Hoare triple {6208#(exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:13,342 INFO L290 TraceCheckUtils]: 65: Hoare triple {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:13,342 INFO L290 TraceCheckUtils]: 66: Hoare triple {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:13,343 INFO L290 TraceCheckUtils]: 67: Hoare triple {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:13,343 INFO L290 TraceCheckUtils]: 68: Hoare triple {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:13,344 INFO L290 TraceCheckUtils]: 69: Hoare triple {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:13,345 INFO L290 TraceCheckUtils]: 70: Hoare triple {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume true; {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:13,345 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6212#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #318#return; {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:13,346 INFO L290 TraceCheckUtils]: 72: Hoare triple {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} SUMMARY for call write~$Pointer$(l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_~item~0#1.base, 4 + l4_insert_~item~0#1.offset, 4); srcloc: L675-1 {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:13,346 INFO L290 TraceCheckUtils]: 73: Hoare triple {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:13,351 INFO L290 TraceCheckUtils]: 74: Hoare triple {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} assume !(1 == #valid[l4_insert_~list#1.base]); {6039#false} is VALID [2022-02-20 23:46:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 80 proven. 16 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-20 23:46:13,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:13,948 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:46:13,948 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 12 treesize of output 11 [2022-02-20 23:46:14,023 INFO L290 TraceCheckUtils]: 74: Hoare triple {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} assume !(1 == #valid[l4_insert_~list#1.base]); {6039#false} is VALID [2022-02-20 23:46:14,024 INFO L290 TraceCheckUtils]: 73: Hoare triple {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:14,024 INFO L290 TraceCheckUtils]: 72: Hoare triple {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} SUMMARY for call write~$Pointer$(l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_~item~0#1.base, 4 + l4_insert_~item~0#1.offset, 4); srcloc: L675-1 {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:14,025 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #318#return; {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:14,025 INFO L290 TraceCheckUtils]: 70: Hoare triple {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume true; {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:14,025 INFO L290 TraceCheckUtils]: 69: Hoare triple {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:14,026 INFO L290 TraceCheckUtils]: 68: Hoare triple {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:14,026 INFO L290 TraceCheckUtils]: 67: Hoare triple {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:14,026 INFO L290 TraceCheckUtils]: 66: Hoare triple {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:14,026 INFO L290 TraceCheckUtils]: 65: Hoare triple {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:14,027 INFO L290 TraceCheckUtils]: 64: Hoare triple {6310#(or (not (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1)))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:14,056 INFO L290 TraceCheckUtils]: 63: Hoare triple {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {6310#(or (not (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1)))))} is VALID [2022-02-20 23:46:14,057 INFO L272 TraceCheckUtils]: 62: Hoare triple {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:14,057 INFO L290 TraceCheckUtils]: 61: Hoare triple {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset := l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset; {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:14,058 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #316#return; {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:14,058 INFO L290 TraceCheckUtils]: 59: Hoare triple {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume true; {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:14,059 INFO L290 TraceCheckUtils]: 58: Hoare triple {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:14,059 INFO L290 TraceCheckUtils]: 57: Hoare triple {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:14,059 INFO L290 TraceCheckUtils]: 56: Hoare triple {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:14,060 INFO L290 TraceCheckUtils]: 55: Hoare triple {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:14,060 INFO L290 TraceCheckUtils]: 54: Hoare triple {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:14,060 INFO L290 TraceCheckUtils]: 53: Hoare triple {6310#(or (not (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1)))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:14,062 INFO L290 TraceCheckUtils]: 52: Hoare triple {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {6310#(or (not (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1)))))} is VALID [2022-02-20 23:46:14,062 INFO L272 TraceCheckUtils]: 51: Hoare triple {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {6288#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:14,063 INFO L290 TraceCheckUtils]: 50: Hoare triple {6196#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} assume { :begin_inline_l4_insert } true;l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset := l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset, l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset, l4_insert_~list#1.base, l4_insert_~list#1.offset, l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset;l4_insert_~list#1.base, l4_insert_~list#1.offset := l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset; {6200#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:14,063 INFO L290 TraceCheckUtils]: 49: Hoare triple {6192#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset := l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset; {6196#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:46:14,064 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6185#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {6038#true} #314#return; {6192#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} is VALID [2022-02-20 23:46:14,064 INFO L290 TraceCheckUtils]: 47: Hoare triple {6185#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {6185#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:14,064 INFO L290 TraceCheckUtils]: 46: Hoare triple {6181#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {6185#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:14,065 INFO L290 TraceCheckUtils]: 45: Hoare triple {6177#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {6181#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:14,065 INFO L290 TraceCheckUtils]: 44: Hoare triple {6167#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {6177#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:14,065 INFO L290 TraceCheckUtils]: 43: Hoare triple {6167#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6167#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:14,066 INFO L290 TraceCheckUtils]: 42: Hoare triple {6167#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {6167#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:14,066 INFO L290 TraceCheckUtils]: 41: Hoare triple {6163#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6167#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:14,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {6038#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {6163#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:46:14,066 INFO L272 TraceCheckUtils]: 39: Hoare triple {6038#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {6038#true} is VALID [2022-02-20 23:46:14,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {6038#true} assume { :begin_inline_l3_insert } true;l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset := l2_insert_~item~2#1.base, 4 + l2_insert_~item~2#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset, l3_insert_#t~nondet10#1, l3_insert_#t~mem11#1.base, l3_insert_#t~mem11#1.offset, l3_insert_~list#1.base, l3_insert_~list#1.offset, l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;l3_insert_~list#1.base, l3_insert_~list#1.offset := l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset; {6038#true} is VALID [2022-02-20 23:46:14,067 INFO L290 TraceCheckUtils]: 37: Hoare triple {6038#true} l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset := l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset; {6038#true} is VALID [2022-02-20 23:46:14,067 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6038#true} {6038#true} #312#return; {6038#true} is VALID [2022-02-20 23:46:14,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {6038#true} assume true; {6038#true} is VALID [2022-02-20 23:46:14,068 INFO L290 TraceCheckUtils]: 34: Hoare triple {6038#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {6038#true} is VALID [2022-02-20 23:46:14,068 INFO L290 TraceCheckUtils]: 33: Hoare triple {6038#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {6038#true} is VALID [2022-02-20 23:46:14,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {6038#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {6038#true} is VALID [2022-02-20 23:46:14,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {6038#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6038#true} is VALID [2022-02-20 23:46:14,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {6038#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {6038#true} is VALID [2022-02-20 23:46:14,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {6038#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6038#true} is VALID [2022-02-20 23:46:14,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {6038#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {6038#true} is VALID [2022-02-20 23:46:14,071 INFO L272 TraceCheckUtils]: 27: Hoare triple {6038#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {6038#true} is VALID [2022-02-20 23:46:14,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {6038#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset, l2_insert_#t~nondet13#1, l2_insert_#t~mem14#1.base, l2_insert_#t~mem14#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {6038#true} is VALID [2022-02-20 23:46:14,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {6038#true} l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset := l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset; {6038#true} is VALID [2022-02-20 23:46:14,072 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6038#true} {6038#true} #310#return; {6038#true} is VALID [2022-02-20 23:46:14,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {6038#true} assume true; {6038#true} is VALID [2022-02-20 23:46:14,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {6038#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {6038#true} is VALID [2022-02-20 23:46:14,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {6038#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {6038#true} is VALID [2022-02-20 23:46:14,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {6038#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {6038#true} is VALID [2022-02-20 23:46:14,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {6038#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6038#true} is VALID [2022-02-20 23:46:14,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {6038#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {6038#true} is VALID [2022-02-20 23:46:14,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {6038#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6038#true} is VALID [2022-02-20 23:46:14,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {6038#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {6038#true} is VALID [2022-02-20 23:46:14,073 INFO L272 TraceCheckUtils]: 15: Hoare triple {6038#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {6038#true} is VALID [2022-02-20 23:46:14,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {6038#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := l0_insert_~item~4#1.base, 4 + l0_insert_~item~4#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset, l1_insert_#t~nondet16#1, l1_insert_#t~mem17#1.base, l1_insert_#t~mem17#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {6038#true} is VALID [2022-02-20 23:46:14,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {6038#true} l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset := l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset; {6038#true} is VALID [2022-02-20 23:46:14,073 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6038#true} {6038#true} #308#return; {6038#true} is VALID [2022-02-20 23:46:14,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {6038#true} assume true; {6038#true} is VALID [2022-02-20 23:46:14,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {6038#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {6038#true} is VALID [2022-02-20 23:46:14,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {6038#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {6038#true} is VALID [2022-02-20 23:46:14,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {6038#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {6038#true} is VALID [2022-02-20 23:46:14,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {6038#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6038#true} is VALID [2022-02-20 23:46:14,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {6038#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {6038#true} is VALID [2022-02-20 23:46:14,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {6038#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6038#true} is VALID [2022-02-20 23:46:14,074 INFO L290 TraceCheckUtils]: 4: Hoare triple {6038#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {6038#true} is VALID [2022-02-20 23:46:14,074 INFO L272 TraceCheckUtils]: 3: Hoare triple {6038#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {6038#true} is VALID [2022-02-20 23:46:14,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {6038#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {6038#true} is VALID [2022-02-20 23:46:14,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {6038#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~mem31#1.base, main_#t~mem31#1.offset; {6038#true} is VALID [2022-02-20 23:46:14,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {6038#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {6038#true} is VALID [2022-02-20 23:46:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 80 proven. 16 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-20 23:46:14,075 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:14,075 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972845120] [2022-02-20 23:46:14,075 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:14,075 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903576361] [2022-02-20 23:46:14,075 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903576361] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:46:14,075 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:46:14,076 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2022-02-20 23:46:14,076 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450239435] [2022-02-20 23:46:14,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:14,078 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2022-02-20 23:46:14,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:14,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 23:46:14,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:14,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:46:14,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:14,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:46:14,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:46:14,123 INFO L87 Difference]: Start difference. First operand 184 states and 199 transitions. Second operand has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 23:46:25,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:25,860 INFO L93 Difference]: Finished difference Result 243 states and 264 transitions. [2022-02-20 23:46:25,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:46:25,861 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2022-02-20 23:46:25,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:25,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 23:46:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 248 transitions. [2022-02-20 23:46:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 23:46:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 248 transitions. [2022-02-20 23:46:25,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 248 transitions. [2022-02-20 23:46:26,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:26,058 INFO L225 Difference]: With dead ends: 243 [2022-02-20 23:46:26,058 INFO L226 Difference]: Without dead ends: 243 [2022-02-20 23:46:26,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 132 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2022-02-20 23:46:26,059 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 204 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:26,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 1230 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 664 Invalid, 0 Unknown, 252 Unchecked, 0.5s Time] [2022-02-20 23:46:26,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-02-20 23:46:26,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 208. [2022-02-20 23:46:26,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:26,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand has 208 states, 132 states have (on average 1.5909090909090908) internal successors, (210), 195 states have internal predecessors, (210), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:46:26,063 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand has 208 states, 132 states have (on average 1.5909090909090908) internal successors, (210), 195 states have internal predecessors, (210), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:46:26,064 INFO L87 Difference]: Start difference. First operand 243 states. Second operand has 208 states, 132 states have (on average 1.5909090909090908) internal successors, (210), 195 states have internal predecessors, (210), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:46:26,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:26,069 INFO L93 Difference]: Finished difference Result 243 states and 264 transitions. [2022-02-20 23:46:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 264 transitions. [2022-02-20 23:46:26,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:26,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:26,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 208 states, 132 states have (on average 1.5909090909090908) internal successors, (210), 195 states have internal predecessors, (210), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 243 states. [2022-02-20 23:46:26,070 INFO L87 Difference]: Start difference. First operand has 208 states, 132 states have (on average 1.5909090909090908) internal successors, (210), 195 states have internal predecessors, (210), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 243 states. [2022-02-20 23:46:26,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:26,075 INFO L93 Difference]: Finished difference Result 243 states and 264 transitions. [2022-02-20 23:46:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 264 transitions. [2022-02-20 23:46:26,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:26,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:26,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:26,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:26,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 132 states have (on average 1.5909090909090908) internal successors, (210), 195 states have internal predecessors, (210), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:46:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2022-02-20 23:46:26,079 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 75 [2022-02-20 23:46:26,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:26,080 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2022-02-20 23:46:26,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 23:46:26,080 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2022-02-20 23:46:26,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 23:46:26,080 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:26,081 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:26,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:26,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:26,296 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:46:26,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:26,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1167639436, now seen corresponding path program 1 times [2022-02-20 23:46:26,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:26,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953147158] [2022-02-20 23:46:26,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:26,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:26,313 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:26,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150141324] [2022-02-20 23:46:26,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:26,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:26,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:26,318 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:46:26,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 23:46:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:26,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 70 conjunts are in the unsatisfiable core [2022-02-20 23:46:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:26,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:34,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:46:34,145 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 19 treesize of output 21 [2022-02-20 23:46:34,926 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:46:34,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-20 23:46:37,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:46:37,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-02-20 23:46:37,727 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-02-20 23:46:37,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-02-20 23:46:39,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {7461#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {7461#true} is VALID [2022-02-20 23:46:39,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {7461#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~mem31#1.base, main_#t~mem31#1.offset; {7461#true} is VALID [2022-02-20 23:46:39,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {7461#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {7461#true} is VALID [2022-02-20 23:46:39,318 INFO L272 TraceCheckUtils]: 3: Hoare triple {7461#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {7461#true} is VALID [2022-02-20 23:46:39,318 INFO L290 TraceCheckUtils]: 4: Hoare triple {7461#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {7461#true} is VALID [2022-02-20 23:46:39,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {7461#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7461#true} is VALID [2022-02-20 23:46:39,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {7461#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {7461#true} is VALID [2022-02-20 23:46:39,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {7461#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7461#true} is VALID [2022-02-20 23:46:39,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {7461#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {7461#true} is VALID [2022-02-20 23:46:39,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {7461#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {7461#true} is VALID [2022-02-20 23:46:39,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {7461#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {7461#true} is VALID [2022-02-20 23:46:39,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {7461#true} assume true; {7461#true} is VALID [2022-02-20 23:46:39,318 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7461#true} {7461#true} #308#return; {7461#true} is VALID [2022-02-20 23:46:39,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {7461#true} l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset := l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset; {7461#true} is VALID [2022-02-20 23:46:39,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {7461#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := l0_insert_~item~4#1.base, 4 + l0_insert_~item~4#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset, l1_insert_#t~nondet16#1, l1_insert_#t~mem17#1.base, l1_insert_#t~mem17#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {7461#true} is VALID [2022-02-20 23:46:39,318 INFO L272 TraceCheckUtils]: 15: Hoare triple {7461#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {7461#true} is VALID [2022-02-20 23:46:39,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {7461#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {7461#true} is VALID [2022-02-20 23:46:39,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {7461#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7461#true} is VALID [2022-02-20 23:46:39,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {7461#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {7461#true} is VALID [2022-02-20 23:46:39,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {7461#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7461#true} is VALID [2022-02-20 23:46:39,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {7461#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {7461#true} is VALID [2022-02-20 23:46:39,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {7461#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {7461#true} is VALID [2022-02-20 23:46:39,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {7461#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {7461#true} is VALID [2022-02-20 23:46:39,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {7461#true} assume true; {7461#true} is VALID [2022-02-20 23:46:39,319 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7461#true} {7461#true} #310#return; {7461#true} is VALID [2022-02-20 23:46:39,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {7461#true} l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset := l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset; {7461#true} is VALID [2022-02-20 23:46:39,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {7461#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset, l2_insert_#t~nondet13#1, l2_insert_#t~mem14#1.base, l2_insert_#t~mem14#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {7461#true} is VALID [2022-02-20 23:46:39,319 INFO L272 TraceCheckUtils]: 27: Hoare triple {7461#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {7461#true} is VALID [2022-02-20 23:46:39,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {7461#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {7461#true} is VALID [2022-02-20 23:46:39,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {7461#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7461#true} is VALID [2022-02-20 23:46:39,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {7461#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {7461#true} is VALID [2022-02-20 23:46:39,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {7461#true} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7461#true} is VALID [2022-02-20 23:46:39,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {7461#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {7461#true} is VALID [2022-02-20 23:46:39,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {7461#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {7461#true} is VALID [2022-02-20 23:46:39,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {7461#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {7461#true} is VALID [2022-02-20 23:46:39,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {7461#true} assume true; {7461#true} is VALID [2022-02-20 23:46:39,320 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7461#true} {7461#true} #312#return; {7461#true} is VALID [2022-02-20 23:46:39,320 INFO L290 TraceCheckUtils]: 37: Hoare triple {7461#true} l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset := l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset; {7461#true} is VALID [2022-02-20 23:46:39,320 INFO L290 TraceCheckUtils]: 38: Hoare triple {7461#true} assume { :begin_inline_l3_insert } true;l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset := l2_insert_~item~2#1.base, 4 + l2_insert_~item~2#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset, l3_insert_#t~nondet10#1, l3_insert_#t~mem11#1.base, l3_insert_#t~mem11#1.offset, l3_insert_~list#1.base, l3_insert_~list#1.offset, l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;l3_insert_~list#1.base, l3_insert_~list#1.offset := l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset; {7461#true} is VALID [2022-02-20 23:46:39,320 INFO L272 TraceCheckUtils]: 39: Hoare triple {7461#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {7461#true} is VALID [2022-02-20 23:46:39,330 INFO L290 TraceCheckUtils]: 40: Hoare triple {7461#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {7586#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) |zalloc_or_die_#Ultimate.C_memset_#amount#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))))} is VALID [2022-02-20 23:46:39,331 INFO L290 TraceCheckUtils]: 41: Hoare triple {7586#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) |zalloc_or_die_#Ultimate.C_memset_#amount#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7590#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) |zalloc_or_die_#Ultimate.C_memset_#amount#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1))} is VALID [2022-02-20 23:46:39,332 INFO L290 TraceCheckUtils]: 42: Hoare triple {7590#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) |zalloc_or_die_#Ultimate.C_memset_#amount#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {7594#(and (= |zalloc_or_die_#Ultimate.C_memset_#t~loopctr33#1| 0) (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (<= |zalloc_or_die_#Ultimate.C_memset_#amount#1| (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|)) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) |zalloc_or_die_#Ultimate.C_memset_#amount#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1))} is VALID [2022-02-20 23:46:39,333 INFO L290 TraceCheckUtils]: 43: Hoare triple {7594#(and (= |zalloc_or_die_#Ultimate.C_memset_#t~loopctr33#1| 0) (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (<= |zalloc_or_die_#Ultimate.C_memset_#amount#1| (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|)) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) |zalloc_or_die_#Ultimate.C_memset_#amount#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1))} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7598#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int) (|aux_div_zalloc_or_die_#Ultimate.C_memset_#amount#1_61| Int)) (and (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (* |aux_div_zalloc_or_die_#Ultimate.C_memset_#amount#1_61| 4294967296)) (<= (* |aux_div_zalloc_or_die_#Ultimate.C_memset_#amount#1_61| 4294967296) (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|)) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1))} is VALID [2022-02-20 23:46:41,340 WARN L290 TraceCheckUtils]: 44: Hoare triple {7598#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int) (|aux_div_zalloc_or_die_#Ultimate.C_memset_#amount#1_61| Int)) (and (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (* |aux_div_zalloc_or_die_#Ultimate.C_memset_#amount#1_61| 4294967296)) (<= (* |aux_div_zalloc_or_die_#Ultimate.C_memset_#amount#1_61| 4294967296) (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|)) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {7602#(and (= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1) (= |zalloc_or_die_calloc_model_#res#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (div (- (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|)) (- 4294967296)) (div (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) 4294967296)) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))))} is UNKNOWN [2022-02-20 23:46:41,343 INFO L290 TraceCheckUtils]: 45: Hoare triple {7602#(and (= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1) (= |zalloc_or_die_calloc_model_#res#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (div (- (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|)) (- 4294967296)) (div (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) 4294967296)) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {7606#(and (= |zalloc_or_die_~ptr~1#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |zalloc_or_die_~ptr~1#1.base|) 4294967296)) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1))} is VALID [2022-02-20 23:46:41,344 INFO L290 TraceCheckUtils]: 46: Hoare triple {7606#(and (= |zalloc_or_die_~ptr~1#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |zalloc_or_die_~ptr~1#1.base|) 4294967296)) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {7610#(and (= |zalloc_or_die_#res#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |zalloc_or_die_#res#1.base|) 4294967296)) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} is VALID [2022-02-20 23:46:41,354 INFO L290 TraceCheckUtils]: 47: Hoare triple {7610#(and (= |zalloc_or_die_#res#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |zalloc_or_die_#res#1.base|) 4294967296)) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} assume true; {7610#(and (= |zalloc_or_die_#res#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |zalloc_or_die_#res#1.base|) 4294967296)) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} is VALID [2022-02-20 23:46:41,355 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7610#(and (= |zalloc_or_die_#res#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |zalloc_or_die_#res#1.base|) 4294967296)) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} {7461#true} #314#return; {7617#(and (= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1) (= |ULTIMATE.start_l3_insert_#t~ret9#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 4294967296)))))} is VALID [2022-02-20 23:46:41,356 INFO L290 TraceCheckUtils]: 49: Hoare triple {7617#(and (= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1) (= |ULTIMATE.start_l3_insert_#t~ret9#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 4294967296)))))} l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset := l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset; {7621#(and (= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l3_insert_~item~1#1.base|) 4294967296)))) (= |ULTIMATE.start_l3_insert_~item~1#1.offset| 0))} is VALID [2022-02-20 23:46:41,356 INFO L290 TraceCheckUtils]: 50: Hoare triple {7621#(and (= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l3_insert_~item~1#1.base|) 4294967296)))) (= |ULTIMATE.start_l3_insert_~item~1#1.offset| 0))} assume { :begin_inline_l4_insert } true;l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset := l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset, l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset, l4_insert_~list#1.base, l4_insert_~list#1.offset, l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset;l4_insert_~list#1.base, l4_insert_~list#1.offset := l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset; {7625#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) 4294967296)))) (= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} is VALID [2022-02-20 23:46:41,357 INFO L272 TraceCheckUtils]: 51: Hoare triple {7625#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) 4294967296)))) (= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {7629#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:46:41,359 INFO L290 TraceCheckUtils]: 52: Hoare triple {7629#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {7633#(and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_188 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_188) |#valid|)) (exists ((v_ArrVal_189 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189))))} is VALID [2022-02-20 23:46:41,360 INFO L290 TraceCheckUtils]: 53: Hoare triple {7633#(and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_188 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_188) |#valid|)) (exists ((v_ArrVal_189 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7637#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_188 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_188) |#valid|)) (exists ((v_ArrVal_189 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:41,361 INFO L290 TraceCheckUtils]: 54: Hoare triple {7637#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_188 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_188) |#valid|)) (exists ((v_ArrVal_189 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {7637#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_188 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_188) |#valid|)) (exists ((v_ArrVal_189 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:41,362 INFO L290 TraceCheckUtils]: 55: Hoare triple {7637#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_188 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_188) |#valid|)) (exists ((v_ArrVal_189 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7637#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_188 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_188) |#valid|)) (exists ((v_ArrVal_189 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:41,362 INFO L290 TraceCheckUtils]: 56: Hoare triple {7637#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_188 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_188) |#valid|)) (exists ((v_ArrVal_189 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {7637#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_188 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_188) |#valid|)) (exists ((v_ArrVal_189 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:41,363 INFO L290 TraceCheckUtils]: 57: Hoare triple {7637#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_188 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_188) |#valid|)) (exists ((v_ArrVal_189 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {7637#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_188 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_188) |#valid|)) (exists ((v_ArrVal_189 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:41,364 INFO L290 TraceCheckUtils]: 58: Hoare triple {7637#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_188 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_188) |#valid|)) (exists ((v_ArrVal_189 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {7637#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_188 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_188) |#valid|)) (exists ((v_ArrVal_189 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:41,364 INFO L290 TraceCheckUtils]: 59: Hoare triple {7637#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_188 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_188) |#valid|)) (exists ((v_ArrVal_189 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume true; {7637#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_188 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_188) |#valid|)) (exists ((v_ArrVal_189 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:41,367 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7637#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_188 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_188) |#valid|)) (exists ((v_ArrVal_189 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} {7625#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) 4294967296)))) (= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} #316#return; {7659#(and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |ULTIMATE.start_l4_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1))) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) 4294967296)))) (= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} is VALID [2022-02-20 23:46:41,371 INFO L290 TraceCheckUtils]: 61: Hoare triple {7659#(and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |ULTIMATE.start_l4_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1))) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) 4294967296)))) (= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset := l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset; {7659#(and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |ULTIMATE.start_l4_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1))) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) 4294967296)))) (= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} is VALID [2022-02-20 23:46:41,372 INFO L272 TraceCheckUtils]: 62: Hoare triple {7659#(and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |ULTIMATE.start_l4_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1))) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) 4294967296)))) (= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {7629#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:46:41,374 INFO L290 TraceCheckUtils]: 63: Hoare triple {7629#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {7669#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_190 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))))} is VALID [2022-02-20 23:46:41,375 INFO L290 TraceCheckUtils]: 64: Hoare triple {7669#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_190 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7669#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_190 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))))} is VALID [2022-02-20 23:46:41,375 INFO L290 TraceCheckUtils]: 65: Hoare triple {7669#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_190 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr33#1;#Ultimate.C_memset_#t~loopctr33#1 := 0; {7669#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_190 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))))} is VALID [2022-02-20 23:46:41,376 INFO L290 TraceCheckUtils]: 66: Hoare triple {7669#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_190 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))))} assume !(#Ultimate.C_memset_#t~loopctr33#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7669#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_190 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))))} is VALID [2022-02-20 23:46:41,376 INFO L290 TraceCheckUtils]: 67: Hoare triple {7669#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_190 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {7669#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_190 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))))} is VALID [2022-02-20 23:46:41,377 INFO L290 TraceCheckUtils]: 68: Hoare triple {7669#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_190 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {7669#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_190 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))))} is VALID [2022-02-20 23:46:41,377 INFO L290 TraceCheckUtils]: 69: Hoare triple {7669#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_190 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {7669#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_190 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))))} is VALID [2022-02-20 23:46:41,378 INFO L290 TraceCheckUtils]: 70: Hoare triple {7669#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_190 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))))} assume true; {7669#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_190 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))))} is VALID [2022-02-20 23:46:41,388 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7669#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_190 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))))} {7659#(and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |ULTIMATE.start_l4_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1))) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) 4294967296)))) (= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} #318#return; {7694#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) 4294967296)))) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} is VALID [2022-02-20 23:46:41,403 INFO L290 TraceCheckUtils]: 72: Hoare triple {7694#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) 4294967296)))) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} SUMMARY for call write~$Pointer$(l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_~item~0#1.base, 4 + l4_insert_~item~0#1.offset, 4); srcloc: L675-1 {7694#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) 4294967296)))) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} is VALID [2022-02-20 23:46:41,405 INFO L290 TraceCheckUtils]: 73: Hoare triple {7694#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) 4294967296)))) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {7694#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) 4294967296)))) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} is VALID [2022-02-20 23:46:41,406 INFO L290 TraceCheckUtils]: 74: Hoare triple {7694#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) 4294967296)))) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} assume !(4 + l4_insert_~list#1.offset <= #length[l4_insert_~list#1.base] && 0 <= l4_insert_~list#1.offset); {7462#false} is VALID [2022-02-20 23:46:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 80 proven. 24 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-02-20 23:46:41,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:41,729 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:41,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953147158] [2022-02-20 23:46:41,729 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:41,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150141324] [2022-02-20 23:46:41,729 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150141324] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:46:41,729 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:46:41,729 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-02-20 23:46:41,729 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763253197] [2022-02-20 23:46:41,729 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:41,730 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 75 [2022-02-20 23:46:41,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:41,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:46:44,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 58 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:44,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 23:46:44,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:44,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 23:46:44,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=331, Unknown=1, NotChecked=0, Total=380 [2022-02-20 23:46:44,943 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand has 18 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6)