./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1578b460aeea130a8bff65a72033176e9f15bf2306d156b3a1a80c7596cffb35 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:26:13,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:26:13,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:26:13,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:26:13,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:26:13,235 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:26:13,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:26:13,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:26:13,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:26:13,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:26:13,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:26:13,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:26:13,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:26:13,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:26:13,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:26:13,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:26:13,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:26:13,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:26:13,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:26:13,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:26:13,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:26:13,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:26:13,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:26:13,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:26:13,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:26:13,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:26:13,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:26:13,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:26:13,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:26:13,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:26:13,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:26:13,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:26:13,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:26:13,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:26:13,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:26:13,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:26:13,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:26:13,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:26:13,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:26:13,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:26:13,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:26:13,290 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 22:26:13,313 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:26:13,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:26:13,313 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:26:13,313 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:26:13,314 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:26:13,314 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:26:13,314 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:26:13,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:26:13,314 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:26:13,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:26:13,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 22:26:13,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:26:13,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:26:13,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:26:13,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:26:13,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:26:13,315 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:26:13,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:26:13,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:26:13,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:26:13,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:26:13,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:26:13,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:26:13,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:26:13,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:26:13,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 22:26:13,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 22:26:13,317 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:26:13,317 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:26:13,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:26:13,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1578b460aeea130a8bff65a72033176e9f15bf2306d156b3a1a80c7596cffb35 [2022-02-20 22:26:13,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:26:13,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:26:13,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:26:13,543 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:26:13,543 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:26:13,544 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i [2022-02-20 22:26:13,592 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c947c085d/d90083a6c23a4619979cdd1d0252b358/FLAG1725ea033 [2022-02-20 22:26:14,166 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:26:14,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i [2022-02-20 22:26:14,205 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c947c085d/d90083a6c23a4619979cdd1d0252b358/FLAG1725ea033 [2022-02-20 22:26:14,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c947c085d/d90083a6c23a4619979cdd1d0252b358 [2022-02-20 22:26:14,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:26:14,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:26:14,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:26:14,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:26:14,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:26:14,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:26:14" (1/1) ... [2022-02-20 22:26:14,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c44c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:26:14, skipping insertion in model container [2022-02-20 22:26:14,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:26:14" (1/1) ... [2022-02-20 22:26:14,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:26:14,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:26:15,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i[232289,232302] [2022-02-20 22:26:15,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:26:15,990 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:26:16,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-43_2a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i[232289,232302] [2022-02-20 22:26:16,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:26:16,329 INFO L208 MainTranslator]: Completed translation [2022-02-20 22:26:16,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:26:16 WrapperNode [2022-02-20 22:26:16,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 22:26:16,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 22:26:16,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 22:26:16,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 22:26:16,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:26:16" (1/1) ... [2022-02-20 22:26:16,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:26:16" (1/1) ... [2022-02-20 22:26:16,541 INFO L137 Inliner]: procedures = 235, calls = 1613, calls flagged for inlining = 96, calls inlined = 90, statements flattened = 3693 [2022-02-20 22:26:16,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 22:26:16,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 22:26:16,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 22:26:16,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 22:26:16,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:26:16" (1/1) ... [2022-02-20 22:26:16,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:26:16" (1/1) ... [2022-02-20 22:26:16,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:26:16" (1/1) ... [2022-02-20 22:26:16,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:26:16" (1/1) ... [2022-02-20 22:26:16,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:26:16" (1/1) ... [2022-02-20 22:26:16,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:26:16" (1/1) ... [2022-02-20 22:26:16,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:26:16" (1/1) ... [2022-02-20 22:26:16,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 22:26:16,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 22:26:16,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 22:26:16,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 22:26:16,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:26:16" (1/1) ... [2022-02-20 22:26:16,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:26:16,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:26:16,817 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 22:26:16,853 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 22:26:16,866 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-02-20 22:26:16,867 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-02-20 22:26:16,867 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2022-02-20 22:26:16,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2022-02-20 22:26:16,867 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 22:26:16,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 22:26:16,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 22:26:16,868 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 22:26:16,868 INFO L130 BoogieDeclarations]: Found specification of procedure msb_stop [2022-02-20 22:26:16,868 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_stop [2022-02-20 22:26:16,868 INFO L130 BoogieDeclarations]: Found specification of procedure msb_get_zone_from_pba [2022-02-20 22:26:16,868 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_get_zone_from_pba [2022-02-20 22:26:16,869 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2022-02-20 22:26:16,869 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2022-02-20 22:26:16,869 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-02-20 22:26:16,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-02-20 22:26:16,869 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 22:26:16,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 22:26:16,869 INFO L130 BoogieDeclarations]: Found specification of procedure blk_fetch_request [2022-02-20 22:26:16,869 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_fetch_request [2022-02-20 22:26:16,870 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_1 [2022-02-20 22:26:16,870 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_1 [2022-02-20 22:26:16,870 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_irq_restore [2022-02-20 22:26:16,870 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_irq_restore [2022-02-20 22:26:16,870 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-02-20 22:26:16,870 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-02-20 22:26:16,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 22:26:16,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 22:26:16,870 INFO L130 BoogieDeclarations]: Found specification of procedure msb_switch_to_parallel [2022-02-20 22:26:16,871 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_switch_to_parallel [2022-02-20 22:26:16,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 22:26:16,871 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 22:26:16,871 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 22:26:16,871 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 22:26:16,871 INFO L130 BoogieDeclarations]: Found specification of procedure msb_validate_used_block_bitmap [2022-02-20 22:26:16,871 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_validate_used_block_bitmap [2022-02-20 22:26:16,871 INFO L130 BoogieDeclarations]: Found specification of procedure msb_verify_block [2022-02-20 22:26:16,872 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_verify_block [2022-02-20 22:26:16,872 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-02-20 22:26:16,872 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-02-20 22:26:16,872 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_2 [2022-02-20 22:26:16,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_2 [2022-02-20 22:26:16,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 22:26:16,873 INFO L130 BoogieDeclarations]: Found specification of procedure msb_cache_write [2022-02-20 22:26:16,873 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_cache_write [2022-02-20 22:26:16,873 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-02-20 22:26:16,873 INFO L130 BoogieDeclarations]: Found specification of procedure trace_hardirqs_off [2022-02-20 22:26:16,873 INFO L138 BoogieDeclarations]: Found implementation of procedure trace_hardirqs_off [2022-02-20 22:26:16,874 INFO L130 BoogieDeclarations]: Found specification of procedure memstick_set_drvdata [2022-02-20 22:26:16,874 INFO L138 BoogieDeclarations]: Found implementation of procedure memstick_set_drvdata [2022-02-20 22:26:16,874 INFO L130 BoogieDeclarations]: Found specification of procedure __blk_end_request [2022-02-20 22:26:16,874 INFO L138 BoogieDeclarations]: Found implementation of procedure __blk_end_request [2022-02-20 22:26:16,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 22:26:16,875 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_1 [2022-02-20 22:26:16,875 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_1 [2022-02-20 22:26:16,875 INFO L130 BoogieDeclarations]: Found specification of procedure msb_invalidate_reg_window [2022-02-20 22:26:16,876 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_invalidate_reg_window [2022-02-20 22:26:16,876 INFO L130 BoogieDeclarations]: Found specification of procedure msb_io_work [2022-02-20 22:26:16,877 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_io_work [2022-02-20 22:26:16,877 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-02-20 22:26:16,877 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-02-20 22:26:16,878 INFO L130 BoogieDeclarations]: Found specification of procedure sg_init_table [2022-02-20 22:26:16,878 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_init_table [2022-02-20 22:26:16,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 22:26:16,878 INFO L130 BoogieDeclarations]: Found specification of procedure msb_erase_block [2022-02-20 22:26:16,878 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_erase_block [2022-02-20 22:26:16,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 22:26:16,879 INFO L130 BoogieDeclarations]: Found specification of procedure memstick_get_drvdata [2022-02-20 22:26:16,879 INFO L138 BoogieDeclarations]: Found implementation of procedure memstick_get_drvdata [2022-02-20 22:26:16,879 INFO L130 BoogieDeclarations]: Found specification of procedure msb_data_clear [2022-02-20 22:26:16,879 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_data_clear [2022-02-20 22:26:16,879 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work_on [2022-02-20 22:26:16,880 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work_on [2022-02-20 22:26:16,880 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-02-20 22:26:16,880 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-02-20 22:26:16,880 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-02-20 22:26:16,880 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-02-20 22:26:16,880 INFO L130 BoogieDeclarations]: Found specification of procedure msb_read_bad_block_table [2022-02-20 22:26:16,880 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_read_bad_block_table [2022-02-20 22:26:16,881 INFO L130 BoogieDeclarations]: Found specification of procedure msb_update_block [2022-02-20 22:26:16,881 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_update_block [2022-02-20 22:26:16,881 INFO L130 BoogieDeclarations]: Found specification of procedure msb_cache_flush [2022-02-20 22:26:16,881 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_cache_flush [2022-02-20 22:26:16,881 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-02-20 22:26:16,881 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-02-20 22:26:16,882 INFO L130 BoogieDeclarations]: Found specification of procedure sg_miter_next [2022-02-20 22:26:16,882 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_miter_next [2022-02-20 22:26:16,882 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2022-02-20 22:26:16,882 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2022-02-20 22:26:16,882 INFO L130 BoogieDeclarations]: Found specification of procedure sg_miter_start [2022-02-20 22:26:16,883 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_miter_start [2022-02-20 22:26:16,883 INFO L130 BoogieDeclarations]: Found specification of procedure msb_run_state_machine [2022-02-20 22:26:16,883 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_run_state_machine [2022-02-20 22:26:16,884 INFO L130 BoogieDeclarations]: Found specification of procedure msb_sg_copy [2022-02-20 22:26:16,884 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_sg_copy [2022-02-20 22:26:16,884 INFO L130 BoogieDeclarations]: Found specification of procedure sg_page [2022-02-20 22:26:16,885 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_page [2022-02-20 22:26:16,885 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-02-20 22:26:16,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-02-20 22:26:16,885 INFO L130 BoogieDeclarations]: Found specification of procedure find_next_zero_bit [2022-02-20 22:26:16,885 INFO L138 BoogieDeclarations]: Found implementation of procedure find_next_zero_bit [2022-02-20 22:26:16,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 22:26:16,886 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-02-20 22:26:16,886 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-02-20 22:26:16,886 INFO L130 BoogieDeclarations]: Found specification of procedure msb_get_zone_from_lba [2022-02-20 22:26:16,886 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_get_zone_from_lba [2022-02-20 22:26:16,886 INFO L130 BoogieDeclarations]: Found specification of procedure msb_reset [2022-02-20 22:26:16,887 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_reset [2022-02-20 22:26:16,887 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_timer_2 [2022-02-20 22:26:16,887 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_timer_2 [2022-02-20 22:26:16,887 INFO L130 BoogieDeclarations]: Found specification of procedure blk_start_queue [2022-02-20 22:26:16,887 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_start_queue [2022-02-20 22:26:16,887 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 22:26:16,887 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 22:26:16,888 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2022-02-20 22:26:16,888 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2022-02-20 22:26:16,888 INFO L130 BoogieDeclarations]: Found specification of procedure msb_bd_getgeo [2022-02-20 22:26:16,888 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_bd_getgeo [2022-02-20 22:26:16,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 22:26:16,889 INFO L130 BoogieDeclarations]: Found specification of procedure msb_remove [2022-02-20 22:26:16,891 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_remove [2022-02-20 22:26:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 22:26:16,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 22:26:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure sg_next [2022-02-20 22:26:16,893 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_next [2022-02-20 22:26:16,894 INFO L130 BoogieDeclarations]: Found specification of procedure msb_mark_bad [2022-02-20 22:26:16,894 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_mark_bad [2022-02-20 22:26:16,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-02-20 22:26:16,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-02-20 22:26:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 22:26:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_2 [2022-02-20 22:26:16,900 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_2 [2022-02-20 22:26:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-02-20 22:26:16,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-02-20 22:26:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 22:26:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure sg_nents [2022-02-20 22:26:16,901 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_nents [2022-02-20 22:26:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 22:26:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure msb_read_page [2022-02-20 22:26:16,901 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_read_page [2022-02-20 22:26:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure __set_bit [2022-02-20 22:26:16,901 INFO L138 BoogieDeclarations]: Found implementation of procedure __set_bit [2022-02-20 22:26:16,901 INFO L130 BoogieDeclarations]: Found specification of procedure sg_miter_stop [2022-02-20 22:26:16,902 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_miter_stop [2022-02-20 22:26:16,902 INFO L130 BoogieDeclarations]: Found specification of procedure msb_set_overwrite_flag [2022-02-20 22:26:16,902 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_set_overwrite_flag [2022-02-20 22:26:16,902 INFO L130 BoogieDeclarations]: Found specification of procedure blk_rq_bytes [2022-02-20 22:26:16,902 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_rq_bytes [2022-02-20 22:26:16,902 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_1 [2022-02-20 22:26:16,902 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_1 [2022-02-20 22:26:16,902 INFO L130 BoogieDeclarations]: Found specification of procedure msb_disk_release [2022-02-20 22:26:16,902 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_disk_release [2022-02-20 22:26:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure msb_mark_block_used [2022-02-20 22:26:16,903 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_mark_block_used [2022-02-20 22:26:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure msb_cache_discard [2022-02-20 22:26:16,903 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_cache_discard [2022-02-20 22:26:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-02-20 22:26:16,903 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-02-20 22:26:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure msb_start [2022-02-20 22:26:16,903 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_start [2022-02-20 22:26:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-02-20 22:26:16,904 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-02-20 22:26:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2022-02-20 22:26:16,904 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2022-02-20 22:26:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure idr_remove [2022-02-20 22:26:16,904 INFO L138 BoogieDeclarations]: Found implementation of procedure idr_remove [2022-02-20 22:26:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure msb_init_card [2022-02-20 22:26:16,904 INFO L138 BoogieDeclarations]: Found implementation of procedure msb_init_card [2022-02-20 22:26:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure sg_set_page [2022-02-20 22:26:16,905 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_set_page [2022-02-20 22:26:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-02-20 22:26:16,905 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-02-20 22:26:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 22:26:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure sg_init_one [2022-02-20 22:26:16,905 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_init_one [2022-02-20 22:26:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2022-02-20 22:26:16,905 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2022-02-20 22:26:16,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 22:26:16,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 22:26:17,370 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 22:26:17,373 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 22:26:17,867 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 22:26:19,967 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 22:26:19,980 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 22:26:19,981 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 22:26:19,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:26:19 BoogieIcfgContainer [2022-02-20 22:26:19,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 22:26:19,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 22:26:19,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 22:26:19,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 22:26:19,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 10:26:14" (1/3) ... [2022-02-20 22:26:19,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72438166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:26:19, skipping insertion in model container [2022-02-20 22:26:19,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:26:16" (2/3) ... [2022-02-20 22:26:19,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72438166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:26:19, skipping insertion in model container [2022-02-20 22:26:19,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:26:19" (3/3) ... [2022-02-20 22:26:19,989 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-43_2a-drivers--memstick--core--ms_block.ko-entry_point.cil.out.i [2022-02-20 22:26:19,992 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 22:26:19,993 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 22:26:20,026 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 22:26:20,031 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 22:26:20,031 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 22:26:20,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 1398 states, 999 states have (on average 1.3853853853853855) internal successors, (1384), 1035 states have internal predecessors, (1384), 315 states have call successors, (315), 83 states have call predecessors, (315), 82 states have return successors, (309), 303 states have call predecessors, (309), 309 states have call successors, (309) [2022-02-20 22:26:20,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-20 22:26:20,071 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:26:20,072 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:26:20,072 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:26:20,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:26:20,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1115719995, now seen corresponding path program 1 times [2022-02-20 22:26:20,082 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:26:20,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651026290] [2022-02-20 22:26:20,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:26:20,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:26:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:20,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:26:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:20,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:26:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:20,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {1466#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1401#true} is VALID [2022-02-20 22:26:20,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {1401#true} assume true; {1401#true} is VALID [2022-02-20 22:26:20,572 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1401#true} {1401#true} #3620#return; {1401#true} is VALID [2022-02-20 22:26:20,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:26:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:20,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {1401#true} ~cond := #in~cond; {1401#true} is VALID [2022-02-20 22:26:20,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {1401#true} assume 0 == ~cond;assume false; {1402#false} is VALID [2022-02-20 22:26:20,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {1402#false} assume true; {1402#false} is VALID [2022-02-20 22:26:20,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1402#false} {1401#true} #3622#return; {1402#false} is VALID [2022-02-20 22:26:20,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {1458#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~3.base, ~tmp~3.offset;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~size); {1401#true} is VALID [2022-02-20 22:26:20,586 INFO L272 TraceCheckUtils]: 1: Hoare triple {1401#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~size, ~size); {1466#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:26:20,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {1466#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1401#true} is VALID [2022-02-20 22:26:20,587 INFO L290 TraceCheckUtils]: 3: Hoare triple {1401#true} assume true; {1401#true} is VALID [2022-02-20 22:26:20,587 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1401#true} {1401#true} #3620#return; {1401#true} is VALID [2022-02-20 22:26:20,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {1401#true} ~tmp~3.base, ~tmp~3.offset := #t~malloc18.base, #t~malloc18.offset;~p~2.base, ~p~2.offset := ~tmp~3.base, ~tmp~3.offset; {1401#true} is VALID [2022-02-20 22:26:20,587 INFO L272 TraceCheckUtils]: 6: Hoare triple {1401#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1401#true} is VALID [2022-02-20 22:26:20,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {1401#true} ~cond := #in~cond; {1401#true} is VALID [2022-02-20 22:26:20,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {1401#true} assume 0 == ~cond;assume false; {1402#false} is VALID [2022-02-20 22:26:20,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {1402#false} assume true; {1402#false} is VALID [2022-02-20 22:26:20,588 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1402#false} {1401#true} #3622#return; {1402#false} is VALID [2022-02-20 22:26:20,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {1402#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1402#false} is VALID [2022-02-20 22:26:20,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {1402#false} assume true; {1402#false} is VALID [2022-02-20 22:26:20,589 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1402#false} {1401#true} #3640#return; {1402#false} is VALID [2022-02-20 22:26:20,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:26:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:20,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:26:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:20,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {1466#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1401#true} is VALID [2022-02-20 22:26:20,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {1401#true} assume true; {1401#true} is VALID [2022-02-20 22:26:20,629 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1401#true} {1401#true} #3620#return; {1401#true} is VALID [2022-02-20 22:26:20,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:26:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:20,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {1401#true} ~cond := #in~cond; {1401#true} is VALID [2022-02-20 22:26:20,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {1401#true} assume 0 == ~cond;assume false; {1402#false} is VALID [2022-02-20 22:26:20,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {1402#false} assume true; {1402#false} is VALID [2022-02-20 22:26:20,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1402#false} {1401#true} #3622#return; {1402#false} is VALID [2022-02-20 22:26:20,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {1458#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~3.base, ~tmp~3.offset;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~size); {1401#true} is VALID [2022-02-20 22:26:20,641 INFO L272 TraceCheckUtils]: 1: Hoare triple {1401#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~size, ~size); {1466#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:26:20,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {1466#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1401#true} is VALID [2022-02-20 22:26:20,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {1401#true} assume true; {1401#true} is VALID [2022-02-20 22:26:20,643 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1401#true} {1401#true} #3620#return; {1401#true} is VALID [2022-02-20 22:26:20,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {1401#true} ~tmp~3.base, ~tmp~3.offset := #t~malloc18.base, #t~malloc18.offset;~p~2.base, ~p~2.offset := ~tmp~3.base, ~tmp~3.offset; {1401#true} is VALID [2022-02-20 22:26:20,643 INFO L272 TraceCheckUtils]: 6: Hoare triple {1401#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1401#true} is VALID [2022-02-20 22:26:20,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {1401#true} ~cond := #in~cond; {1401#true} is VALID [2022-02-20 22:26:20,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {1401#true} assume 0 == ~cond;assume false; {1402#false} is VALID [2022-02-20 22:26:20,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {1402#false} assume true; {1402#false} is VALID [2022-02-20 22:26:20,644 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1402#false} {1401#true} #3622#return; {1402#false} is VALID [2022-02-20 22:26:20,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {1402#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1402#false} is VALID [2022-02-20 22:26:20,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {1402#false} assume true; {1402#false} is VALID [2022-02-20 22:26:20,645 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1402#false} {1402#false} #3642#return; {1402#false} is VALID [2022-02-20 22:26:20,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-20 22:26:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:20,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:26:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:20,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1059 := 0; {1401#true} is VALID [2022-02-20 22:26:20,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {1401#true} assume !(#t~loopctr1059 % 18446744073709551616 < #amount % 18446744073709551616); {1401#true} is VALID [2022-02-20 22:26:20,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {1401#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1401#true} is VALID [2022-02-20 22:26:20,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1401#true} {1401#true} #3766#return; {1401#true} is VALID [2022-02-20 22:26:20,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~4.base, ~tmp~4.offset; {1401#true} is VALID [2022-02-20 22:26:20,681 INFO L272 TraceCheckUtils]: 1: Hoare triple {1401#true} call #t~memset~res19.base, #t~memset~res19.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:26:20,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1059 := 0; {1401#true} is VALID [2022-02-20 22:26:20,682 INFO L290 TraceCheckUtils]: 3: Hoare triple {1401#true} assume !(#t~loopctr1059 % 18446744073709551616 < #amount % 18446744073709551616); {1401#true} is VALID [2022-02-20 22:26:20,683 INFO L290 TraceCheckUtils]: 4: Hoare triple {1401#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1401#true} is VALID [2022-02-20 22:26:20,683 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1401#true} {1401#true} #3766#return; {1401#true} is VALID [2022-02-20 22:26:20,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {1401#true} ~tmp~4.base, ~tmp~4.offset := ~s.base, ~s.offset;havoc #t~memset~res19.base, #t~memset~res19.offset;#res.base, #res.offset := ~tmp~4.base, ~tmp~4.offset; {1401#true} is VALID [2022-02-20 22:26:20,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {1401#true} assume true; {1401#true} is VALID [2022-02-20 22:26:20,683 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1401#true} {1402#false} #3644#return; {1402#false} is VALID [2022-02-20 22:26:20,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 22:26:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:20,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:26:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:20,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1059 := 0; {1401#true} is VALID [2022-02-20 22:26:20,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {1401#true} assume !(#t~loopctr1059 % 18446744073709551616 < #amount % 18446744073709551616); {1401#true} is VALID [2022-02-20 22:26:20,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {1401#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1401#true} is VALID [2022-02-20 22:26:20,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1401#true} {1401#true} #3766#return; {1401#true} is VALID [2022-02-20 22:26:20,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~4.base, ~tmp~4.offset; {1401#true} is VALID [2022-02-20 22:26:20,707 INFO L272 TraceCheckUtils]: 1: Hoare triple {1401#true} call #t~memset~res19.base, #t~memset~res19.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:26:20,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1059 := 0; {1401#true} is VALID [2022-02-20 22:26:20,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {1401#true} assume !(#t~loopctr1059 % 18446744073709551616 < #amount % 18446744073709551616); {1401#true} is VALID [2022-02-20 22:26:20,707 INFO L290 TraceCheckUtils]: 4: Hoare triple {1401#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1401#true} is VALID [2022-02-20 22:26:20,708 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1401#true} {1401#true} #3766#return; {1401#true} is VALID [2022-02-20 22:26:20,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {1401#true} ~tmp~4.base, ~tmp~4.offset := ~s.base, ~s.offset;havoc #t~memset~res19.base, #t~memset~res19.offset;#res.base, #res.offset := ~tmp~4.base, ~tmp~4.offset; {1401#true} is VALID [2022-02-20 22:26:20,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {1401#true} assume true; {1401#true} is VALID [2022-02-20 22:26:20,708 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1401#true} {1402#false} #3646#return; {1402#false} is VALID [2022-02-20 22:26:20,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-20 22:26:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:20,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:26:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:20,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1059 := 0; {1401#true} is VALID [2022-02-20 22:26:20,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {1401#true} assume !(#t~loopctr1059 % 18446744073709551616 < #amount % 18446744073709551616); {1401#true} is VALID [2022-02-20 22:26:20,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {1401#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1401#true} is VALID [2022-02-20 22:26:20,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1401#true} {1401#true} #3766#return; {1401#true} is VALID [2022-02-20 22:26:20,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~4.base, ~tmp~4.offset; {1401#true} is VALID [2022-02-20 22:26:20,733 INFO L272 TraceCheckUtils]: 1: Hoare triple {1401#true} call #t~memset~res19.base, #t~memset~res19.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:26:20,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1059 := 0; {1401#true} is VALID [2022-02-20 22:26:20,734 INFO L290 TraceCheckUtils]: 3: Hoare triple {1401#true} assume !(#t~loopctr1059 % 18446744073709551616 < #amount % 18446744073709551616); {1401#true} is VALID [2022-02-20 22:26:20,734 INFO L290 TraceCheckUtils]: 4: Hoare triple {1401#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1401#true} is VALID [2022-02-20 22:26:20,734 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1401#true} {1401#true} #3766#return; {1401#true} is VALID [2022-02-20 22:26:20,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {1401#true} ~tmp~4.base, ~tmp~4.offset := ~s.base, ~s.offset;havoc #t~memset~res19.base, #t~memset~res19.offset;#res.base, #res.offset := ~tmp~4.base, ~tmp~4.offset; {1401#true} is VALID [2022-02-20 22:26:20,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {1401#true} assume true; {1401#true} is VALID [2022-02-20 22:26:20,735 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1401#true} {1402#false} #3648#return; {1402#false} is VALID [2022-02-20 22:26:20,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {1401#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(86, 2);call #Ultimate.allocInit(57, 3);call #Ultimate.allocInit(60, 4);call #Ultimate.allocInit(64, 5);call #Ultimate.allocInit(211, 6);call #Ultimate.allocInit(211, 7);call #Ultimate.allocInit(211, 8);call #Ultimate.allocInit(211, 9);call #Ultimate.allocInit(37, 10);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(41, 12);call #Ultimate.allocInit(59, 13);call #Ultimate.allocInit(40, 14);call #Ultimate.allocInit(35, 15);call #Ultimate.allocInit(48, 16);call #Ultimate.allocInit(37, 17);call #Ultimate.allocInit(37, 18);call #Ultimate.allocInit(67, 19);call #Ultimate.allocInit(33, 20);call #Ultimate.allocInit(45, 21);call #Ultimate.allocInit(27, 22);call #Ultimate.allocInit(47, 23);call #Ultimate.allocInit(52, 24);call #Ultimate.allocInit(49, 25);call #Ultimate.allocInit(69, 26);call #Ultimate.allocInit(48, 27);call #Ultimate.allocInit(58, 28);call #Ultimate.allocInit(56, 29);call #Ultimate.allocInit(65, 30);call #Ultimate.allocInit(48, 31);call #Ultimate.allocInit(63, 32);call #Ultimate.allocInit(65, 33);call #Ultimate.allocInit(41, 34);call #Ultimate.allocInit(56, 35);call #Ultimate.allocInit(52, 36);call #Ultimate.allocInit(103, 37);call #Ultimate.allocInit(70, 38);call #Ultimate.allocInit(51, 39);call #Ultimate.allocInit(38, 40);call #Ultimate.allocInit(38, 41);call #Ultimate.allocInit(55, 42);call #Ultimate.allocInit(49, 43);call #Ultimate.allocInit(62, 44);call #Ultimate.allocInit(48, 45);call #Ultimate.allocInit(69, 46);call #Ultimate.allocInit(48, 47);call #Ultimate.allocInit(41, 48);call #Ultimate.allocInit(58, 49);call #Ultimate.allocInit(55, 50);call #Ultimate.allocInit(55, 51);call #Ultimate.allocInit(40, 52);call #Ultimate.allocInit(72, 53);call #Ultimate.allocInit(57, 54);call #Ultimate.allocInit(54, 55);call #Ultimate.allocInit(48, 56);call #Ultimate.allocInit(46, 57);call #Ultimate.allocInit(82, 58);call #Ultimate.allocInit(36, 59);call #Ultimate.allocInit(37, 60);call #Ultimate.allocInit(38, 61);call #Ultimate.allocInit(55, 62);call #Ultimate.allocInit(64, 63);call #Ultimate.allocInit(30, 64);call #Ultimate.allocInit(55, 65);call #Ultimate.allocInit(50, 66);call #Ultimate.allocInit(31, 67);call #Ultimate.allocInit(51, 68);call #Ultimate.allocInit(35, 69);call #Ultimate.allocInit(47, 70);call #Ultimate.allocInit(46, 71);call #Ultimate.allocInit(46, 72);call #Ultimate.allocInit(95, 73);call #Ultimate.allocInit(34, 74);call #Ultimate.allocInit(39, 75);call #Ultimate.allocInit(56, 76);call #Ultimate.allocInit(60, 77);call #Ultimate.allocInit(62, 78);call #Ultimate.allocInit(37, 79);call #Ultimate.allocInit(55, 80);call #Ultimate.allocInit(34, 81);call #Ultimate.allocInit(46, 82);call #Ultimate.allocInit(57, 83);call #Ultimate.allocInit(58, 84);call #Ultimate.allocInit(48, 85);call #Ultimate.allocInit(35, 86);call #Ultimate.allocInit(44, 87);call #Ultimate.allocInit(33, 88);call #Ultimate.allocInit(40, 89);call #Ultimate.allocInit(26, 90);call #Ultimate.allocInit(87, 91);call #Ultimate.allocInit(32, 92);call #Ultimate.allocInit(33, 93);call #Ultimate.allocInit(29, 94);call #Ultimate.allocInit(41, 95);call #Ultimate.allocInit(39, 96);call #Ultimate.allocInit(60, 97);call #Ultimate.allocInit(38, 98);call #Ultimate.allocInit(18, 99);call #Ultimate.allocInit(24, 100);call #Ultimate.allocInit(14, 101);call #Ultimate.allocInit(30, 102);call #Ultimate.allocInit(33, 103);call #Ultimate.allocInit(23, 104);call #Ultimate.allocInit(27, 105);call #Ultimate.allocInit(46, 106);call #Ultimate.allocInit(211, 107);call #Ultimate.allocInit(36, 108);call #Ultimate.allocInit(37, 109);call #Ultimate.allocInit(8, 110);call #Ultimate.allocInit(47, 111);call #Ultimate.allocInit(11, 112);call #Ultimate.allocInit(9, 113);call #Ultimate.allocInit(16, 114);call #Ultimate.allocInit(23, 115);call #Ultimate.allocInit(23, 116);call #Ultimate.allocInit(37, 117);call #Ultimate.allocInit(27, 118);call #Ultimate.allocInit(53, 119);call #Ultimate.allocInit(9, 120);call #Ultimate.allocInit(9, 121);call #Ultimate.allocInit(48, 122);call #Ultimate.allocInit(9, 123);call #Ultimate.allocInit(58, 124);call #Ultimate.allocInit(9, 125);~ldv_work_struct_1_0~0.base, ~ldv_work_struct_1_0~0.offset := 0, 0;~ldv_work_struct_1_1~0.base, ~ldv_work_struct_1_1~0.offset := 0, 0;~ldv_timer_list_2_0~0.base, ~ldv_timer_list_2_0~0.offset := 0, 0;~ldv_work_struct_1_3~0.base, ~ldv_work_struct_1_3~0.offset := 0, 0;~ldv_timer_list_2_1~0.base, ~ldv_timer_list_2_1~0.offset := 0, 0;~ldv_work_1_3~0 := 0;~ldv_timer_2_1~0 := 0;~ldv_state_variable_0~0 := 0;~ldv_timer_2_0~0 := 0;~msb_driver_group0~0.base, ~msb_driver_group0~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ldv_work_1_1~0 := 0;~ldv_timer_2_2~0 := 0;~ldv_work_1_2~0 := 0;~ldv_timer_2_3~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_work_struct_1_2~0.base, ~ldv_work_struct_1_2~0.offset := 0, 0;~ldv_state_variable_3~0 := 0;~msb_bdops_group0~0.base, ~msb_bdops_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_timer_list_2_3~0.base, ~ldv_timer_list_2_3~0.offset := 0, 0;~ldv_work_1_0~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_timer_list_2_2~0.base, ~ldv_timer_list_2_2~0.offset := 0, 0;~ldv_state_variable_4~0 := 0;~debug~0 := 0;~cache_flush_timeout~0 := 1000;~verify_writes~0 := 0;~#chs_table~0.base, ~#chs_table~0.offset := 126, 0;call #Ultimate.allocInit(84, 126);call write~init~int(4, ~#chs_table~0.base, ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 8 + ~#chs_table~0.offset, 1);call write~init~int(247, ~#chs_table~0.base, 9 + ~#chs_table~0.offset, 2);call write~init~int(2, ~#chs_table~0.base, 11 + ~#chs_table~0.offset, 1);call write~init~int(8, ~#chs_table~0.base, 12 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 20 + ~#chs_table~0.offset, 1);call write~init~int(495, ~#chs_table~0.base, 21 + ~#chs_table~0.offset, 2);call write~init~int(2, ~#chs_table~0.base, 23 + ~#chs_table~0.offset, 1);call write~init~int(16, ~#chs_table~0.base, 24 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 32 + ~#chs_table~0.offset, 1);call write~init~int(495, ~#chs_table~0.base, 33 + ~#chs_table~0.offset, 2);call write~init~int(4, ~#chs_table~0.base, 35 + ~#chs_table~0.offset, 1);call write~init~int(32, ~#chs_table~0.base, 36 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 44 + ~#chs_table~0.offset, 1);call write~init~int(991, ~#chs_table~0.base, 45 + ~#chs_table~0.offset, 2);call write~init~int(4, ~#chs_table~0.base, 47 + ~#chs_table~0.offset, 1);call write~init~int(64, ~#chs_table~0.base, 48 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 56 + ~#chs_table~0.offset, 1);call write~init~int(991, ~#chs_table~0.base, 57 + ~#chs_table~0.offset, 2);call write~init~int(8, ~#chs_table~0.base, 59 + ~#chs_table~0.offset, 1);call write~init~int(128, ~#chs_table~0.base, 60 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 68 + ~#chs_table~0.offset, 1);call write~init~int(991, ~#chs_table~0.base, 69 + ~#chs_table~0.offset, 2);call write~init~int(16, ~#chs_table~0.base, 71 + ~#chs_table~0.offset, 1);call write~init~int(0, ~#chs_table~0.base, 72 + ~#chs_table~0.offset, 8);call write~init~int(0, ~#chs_table~0.base, 80 + ~#chs_table~0.offset, 1);call write~init~int(0, ~#chs_table~0.base, 81 + ~#chs_table~0.offset, 2);call write~init~int(0, ~#chs_table~0.base, 83 + ~#chs_table~0.offset, 1);~#msb_disk_idr~0.base, ~#msb_disk_idr~0.offset := 127, 0;call #Ultimate.allocInit(104, 127);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 8 + ~#msb_disk_idr~0.offset, 8);call write~init~int(0, ~#msb_disk_idr~0.base, 16 + ~#msb_disk_idr~0.offset, 4);call write~init~int(0, ~#msb_disk_idr~0.base, 20 + ~#msb_disk_idr~0.offset, 4);call write~init~int(0, ~#msb_disk_idr~0.base, 24 + ~#msb_disk_idr~0.offset, 4);call write~init~int(3735899821, ~#msb_disk_idr~0.base, 28 + ~#msb_disk_idr~0.offset, 4);call write~init~int(4294967295, ~#msb_disk_idr~0.base, 32 + ~#msb_disk_idr~0.offset, 4);call write~init~$Pointer$(0, -1, ~#msb_disk_idr~0.base, 36 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 44 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 52 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 60 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(99, 0, ~#msb_disk_idr~0.base, 68 + ~#msb_disk_idr~0.offset, 8);call write~init~int(0, ~#msb_disk_idr~0.base, 76 + ~#msb_disk_idr~0.offset, 4);call write~init~int(0, ~#msb_disk_idr~0.base, 80 + ~#msb_disk_idr~0.offset, 8);call write~init~int(0, ~#msb_disk_idr~0.base, 92 + ~#msb_disk_idr~0.offset, 4);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 96 + ~#msb_disk_idr~0.offset, 8);~#msb_disk_lock~0.base, ~#msb_disk_lock~0.offset := 128, 0;call #Ultimate.allocInit(148, 128);call write~init~int(1, ~#msb_disk_lock~0.base, ~#msb_disk_lock~0.offset, 4);call write~init~int(0, ~#msb_disk_lock~0.base, 4 + ~#msb_disk_lock~0.offset, 4);call write~init~int(3735899821, ~#msb_disk_lock~0.base, 8 + ~#msb_disk_lock~0.offset, 4);call write~init~int(4294967295, ~#msb_disk_lock~0.base, 12 + ~#msb_disk_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#msb_disk_lock~0.base, 16 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 24 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 32 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 40 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(100, 0, ~#msb_disk_lock~0.base, 48 + ~#msb_disk_lock~0.offset, 8);call write~init~int(0, ~#msb_disk_lock~0.base, 56 + ~#msb_disk_lock~0.offset, 4);call write~init~int(0, ~#msb_disk_lock~0.base, 60 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(~#msb_disk_lock~0.base, 72 + ~#msb_disk_lock~0.offset, ~#msb_disk_lock~0.base, 72 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(~#msb_disk_lock~0.base, 72 + ~#msb_disk_lock~0.offset, ~#msb_disk_lock~0.base, 80 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 88 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(~#msb_disk_lock~0.base, ~#msb_disk_lock~0.offset, ~#msb_disk_lock~0.base, 96 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 104 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 112 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 120 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(101, 0, ~#msb_disk_lock~0.base, 128 + ~#msb_disk_lock~0.offset, 8);call write~init~int(0, ~#msb_disk_lock~0.base, 136 + ~#msb_disk_lock~0.offset, 4);call write~init~int(0, ~#msb_disk_lock~0.base, 140 + ~#msb_disk_lock~0.offset, 8);~#msb_bdops~0.base, ~#msb_bdops~0.offset := 129, 0;call #Ultimate.allocInit(104, 129);call write~init~$Pointer$(#funAddr~msb_bd_open.base, #funAddr~msb_bd_open.offset, ~#msb_bdops~0.base, ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_bd_release.base, #funAddr~msb_bd_release.offset, ~#msb_bdops~0.base, 8 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 16 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 24 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 32 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 40 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 48 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 56 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 64 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 72 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_bd_getgeo.base, #funAddr~msb_bd_getgeo.offset, ~#msb_bdops~0.base, 80 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 88 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#msb_bdops~0.base, 96 + ~#msb_bdops~0.offset, 8);~#msb_id_tbl~0.base, ~#msb_id_tbl~0.offset := 130, 0;call #Ultimate.allocInit(24, 130);call write~init~int(1, ~#msb_id_tbl~0.base, ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 1 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 2 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 3 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 4 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 5 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 6 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 7 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 8 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 9 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 10 + ~#msb_id_tbl~0.offset, 1);call write~init~int(2, ~#msb_id_tbl~0.base, 11 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 12 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 13 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 14 + ~#msb_id_tbl~0.offset, 1);call write~init~int(3, ~#msb_id_tbl~0.base, 15 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 16 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 17 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 18 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 19 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 20 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 21 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 22 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 23 + ~#msb_id_tbl~0.offset, 1);~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[5 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[5 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[5 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[5 := 0];~#msb_driver~0.base, ~#msb_driver~0.offset := 131, 0;call #Ultimate.allocInit(157, 131);call write~init~$Pointer$(~#msb_id_tbl~0.base, ~#msb_id_tbl~0.offset, ~#msb_driver~0.base, ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_probe.base, #funAddr~msb_probe.offset, ~#msb_driver~0.base, 8 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_remove.base, #funAddr~msb_remove.offset, ~#msb_driver~0.base, 16 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_suspend.base, #funAddr~msb_suspend.offset, ~#msb_driver~0.base, 24 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_resume.base, #funAddr~msb_resume.offset, ~#msb_driver~0.base, 32 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(120, 0, ~#msb_driver~0.base, 40 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 48 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#msb_driver~0.base, 56 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 64 + ~#msb_driver~0.offset, 8);call write~init~int(0, ~#msb_driver~0.base, 72 + ~#msb_driver~0.offset, 1);call write~init~int(0, ~#msb_driver~0.base, 73 + ~#msb_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 77 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 85 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 93 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 101 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 109 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 117 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 125 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 133 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 141 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 149 + ~#msb_driver~0.offset, 8);~major~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~ldv_retval_2~0 := 0;~ldv_spin~0 := 0; {1401#true} is VALID [2022-02-20 22:26:20,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {1401#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret1000#1.base, main_#t~ret1000#1.offset, main_#t~ret1001#1.base, main_#t~ret1001#1.offset, main_#t~ret1002#1.base, main_#t~ret1002#1.offset, main_#t~ret1003#1.base, main_#t~ret1003#1.offset, main_#t~ret1004#1.base, main_#t~ret1004#1.offset, main_#t~nondet1005#1, main_#t~switch1006#1, main_#t~nondet1007#1, main_#t~switch1008#1, main_#t~mem1009#1, main_#t~ret1010#1, main_#t~ret1011#1, main_#t~mem1012#1, main_#t~ret1013#1, main_#t~nondet1014#1, main_#t~switch1015#1, main_#t~ret1016#1, main_#t~nondet1017#1, main_#t~switch1018#1, main_#t~ret1019#1, main_#t~mem1020#1, main_#t~ret1021#1, main_#t~ret1022#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~62#1.base, main_~tmp~62#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___0~36#1.base, main_~tmp___0~36#1.offset, main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset, main_~tmp___1~20#1, main_~tmp___2~13#1, main_~tmp___3~10#1, main_~tmp___4~7#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~62#1.base, main_~tmp~62#1.offset;call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___0~36#1.base, main_~tmp___0~36#1.offset;call main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___1~20#1;havoc main_~tmp___2~13#1;havoc main_~tmp___3~10#1;havoc main_~tmp___4~7#1; {1401#true} is VALID [2022-02-20 22:26:20,743 INFO L272 TraceCheckUtils]: 2: Hoare triple {1401#true} call main_#t~ret1000#1.base, main_#t~ret1000#1.offset := ldv_init_zalloc(16); {1458#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:26:20,743 INFO L290 TraceCheckUtils]: 3: Hoare triple {1458#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~3.base, ~tmp~3.offset;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~size); {1401#true} is VALID [2022-02-20 22:26:20,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {1401#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~size, ~size); {1466#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:26:20,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {1466#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1401#true} is VALID [2022-02-20 22:26:20,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {1401#true} assume true; {1401#true} is VALID [2022-02-20 22:26:20,744 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1401#true} {1401#true} #3620#return; {1401#true} is VALID [2022-02-20 22:26:20,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {1401#true} ~tmp~3.base, ~tmp~3.offset := #t~malloc18.base, #t~malloc18.offset;~p~2.base, ~p~2.offset := ~tmp~3.base, ~tmp~3.offset; {1401#true} is VALID [2022-02-20 22:26:20,745 INFO L272 TraceCheckUtils]: 9: Hoare triple {1401#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1401#true} is VALID [2022-02-20 22:26:20,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {1401#true} ~cond := #in~cond; {1401#true} is VALID [2022-02-20 22:26:20,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {1401#true} assume 0 == ~cond;assume false; {1402#false} is VALID [2022-02-20 22:26:20,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {1402#false} assume true; {1402#false} is VALID [2022-02-20 22:26:20,746 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1402#false} {1401#true} #3622#return; {1402#false} is VALID [2022-02-20 22:26:20,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {1402#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1402#false} is VALID [2022-02-20 22:26:20,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {1402#false} assume true; {1402#false} is VALID [2022-02-20 22:26:20,746 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1402#false} {1401#true} #3640#return; {1402#false} is VALID [2022-02-20 22:26:20,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {1402#false} main_~tmp~62#1.base, main_~tmp~62#1.offset := main_#t~ret1000#1.base, main_#t~ret1000#1.offset;havoc main_#t~ret1000#1.base, main_#t~ret1000#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~62#1.base, main_~tmp~62#1.offset; {1402#false} is VALID [2022-02-20 22:26:20,748 INFO L272 TraceCheckUtils]: 18: Hoare triple {1402#false} call main_#t~ret1001#1.base, main_#t~ret1001#1.offset := ldv_init_zalloc(1744); {1458#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:26:20,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {1458#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~3.base, ~tmp~3.offset;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~size); {1401#true} is VALID [2022-02-20 22:26:20,750 INFO L272 TraceCheckUtils]: 20: Hoare triple {1401#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~size, ~size); {1466#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:26:20,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {1466#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1401#true} is VALID [2022-02-20 22:26:20,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {1401#true} assume true; {1401#true} is VALID [2022-02-20 22:26:20,750 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1401#true} {1401#true} #3620#return; {1401#true} is VALID [2022-02-20 22:26:20,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {1401#true} ~tmp~3.base, ~tmp~3.offset := #t~malloc18.base, #t~malloc18.offset;~p~2.base, ~p~2.offset := ~tmp~3.base, ~tmp~3.offset; {1401#true} is VALID [2022-02-20 22:26:20,751 INFO L272 TraceCheckUtils]: 25: Hoare triple {1401#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1401#true} is VALID [2022-02-20 22:26:20,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {1401#true} ~cond := #in~cond; {1401#true} is VALID [2022-02-20 22:26:20,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {1401#true} assume 0 == ~cond;assume false; {1402#false} is VALID [2022-02-20 22:26:20,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {1402#false} assume true; {1402#false} is VALID [2022-02-20 22:26:20,753 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1402#false} {1401#true} #3622#return; {1402#false} is VALID [2022-02-20 22:26:20,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {1402#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1402#false} is VALID [2022-02-20 22:26:20,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {1402#false} assume true; {1402#false} is VALID [2022-02-20 22:26:20,760 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1402#false} {1402#false} #3642#return; {1402#false} is VALID [2022-02-20 22:26:20,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {1402#false} main_~tmp___0~36#1.base, main_~tmp___0~36#1.offset := main_#t~ret1001#1.base, main_#t~ret1001#1.offset;havoc main_#t~ret1001#1.base, main_#t~ret1001#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___0~36#1.base, main_~tmp___0~36#1.offset;assume { :begin_inline_ldv_initialize } true; {1402#false} is VALID [2022-02-20 22:26:20,763 INFO L290 TraceCheckUtils]: 34: Hoare triple {1402#false} assume { :end_inline_ldv_initialize } true; {1402#false} is VALID [2022-02-20 22:26:20,763 INFO L272 TraceCheckUtils]: 35: Hoare triple {1402#false} call main_#t~ret1002#1.base, main_#t~ret1002#1.offset := ldv_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 4); {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:26:20,763 INFO L290 TraceCheckUtils]: 36: Hoare triple {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~4.base, ~tmp~4.offset; {1401#true} is VALID [2022-02-20 22:26:20,765 INFO L272 TraceCheckUtils]: 37: Hoare triple {1401#true} call #t~memset~res19.base, #t~memset~res19.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:26:20,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1059 := 0; {1401#true} is VALID [2022-02-20 22:26:20,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {1401#true} assume !(#t~loopctr1059 % 18446744073709551616 < #amount % 18446744073709551616); {1401#true} is VALID [2022-02-20 22:26:20,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {1401#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1401#true} is VALID [2022-02-20 22:26:20,765 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1401#true} {1401#true} #3766#return; {1401#true} is VALID [2022-02-20 22:26:20,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {1401#true} ~tmp~4.base, ~tmp~4.offset := ~s.base, ~s.offset;havoc #t~memset~res19.base, #t~memset~res19.offset;#res.base, #res.offset := ~tmp~4.base, ~tmp~4.offset; {1401#true} is VALID [2022-02-20 22:26:20,766 INFO L290 TraceCheckUtils]: 43: Hoare triple {1401#true} assume true; {1401#true} is VALID [2022-02-20 22:26:20,766 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1401#true} {1402#false} #3644#return; {1402#false} is VALID [2022-02-20 22:26:20,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {1402#false} havoc main_#t~ret1002#1.base, main_#t~ret1002#1.offset; {1402#false} is VALID [2022-02-20 22:26:20,766 INFO L272 TraceCheckUtils]: 46: Hoare triple {1402#false} call main_#t~ret1003#1.base, main_#t~ret1003#1.offset := ldv_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:26:20,766 INFO L290 TraceCheckUtils]: 47: Hoare triple {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~4.base, ~tmp~4.offset; {1401#true} is VALID [2022-02-20 22:26:20,767 INFO L272 TraceCheckUtils]: 48: Hoare triple {1401#true} call #t~memset~res19.base, #t~memset~res19.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:26:20,768 INFO L290 TraceCheckUtils]: 49: Hoare triple {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1059 := 0; {1401#true} is VALID [2022-02-20 22:26:20,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {1401#true} assume !(#t~loopctr1059 % 18446744073709551616 < #amount % 18446744073709551616); {1401#true} is VALID [2022-02-20 22:26:20,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {1401#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1401#true} is VALID [2022-02-20 22:26:20,768 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1401#true} {1401#true} #3766#return; {1401#true} is VALID [2022-02-20 22:26:20,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {1401#true} ~tmp~4.base, ~tmp~4.offset := ~s.base, ~s.offset;havoc #t~memset~res19.base, #t~memset~res19.offset;#res.base, #res.offset := ~tmp~4.base, ~tmp~4.offset; {1401#true} is VALID [2022-02-20 22:26:20,768 INFO L290 TraceCheckUtils]: 54: Hoare triple {1401#true} assume true; {1401#true} is VALID [2022-02-20 22:26:20,769 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {1401#true} {1402#false} #3646#return; {1402#false} is VALID [2022-02-20 22:26:20,769 INFO L290 TraceCheckUtils]: 56: Hoare triple {1402#false} havoc main_#t~ret1003#1.base, main_#t~ret1003#1.offset; {1402#false} is VALID [2022-02-20 22:26:20,769 INFO L272 TraceCheckUtils]: 57: Hoare triple {1402#false} call main_#t~ret1004#1.base, main_#t~ret1004#1.offset := ldv_memset(main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset, 0, 4); {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:26:20,769 INFO L290 TraceCheckUtils]: 58: Hoare triple {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~4.base, ~tmp~4.offset; {1401#true} is VALID [2022-02-20 22:26:20,770 INFO L272 TraceCheckUtils]: 59: Hoare triple {1401#true} call #t~memset~res19.base, #t~memset~res19.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:26:20,770 INFO L290 TraceCheckUtils]: 60: Hoare triple {1474#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1059 := 0; {1401#true} is VALID [2022-02-20 22:26:20,770 INFO L290 TraceCheckUtils]: 61: Hoare triple {1401#true} assume !(#t~loopctr1059 % 18446744073709551616 < #amount % 18446744073709551616); {1401#true} is VALID [2022-02-20 22:26:20,771 INFO L290 TraceCheckUtils]: 62: Hoare triple {1401#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1401#true} is VALID [2022-02-20 22:26:20,771 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {1401#true} {1401#true} #3766#return; {1401#true} is VALID [2022-02-20 22:26:20,771 INFO L290 TraceCheckUtils]: 64: Hoare triple {1401#true} ~tmp~4.base, ~tmp~4.offset := ~s.base, ~s.offset;havoc #t~memset~res19.base, #t~memset~res19.offset;#res.base, #res.offset := ~tmp~4.base, ~tmp~4.offset; {1401#true} is VALID [2022-02-20 22:26:20,783 INFO L290 TraceCheckUtils]: 65: Hoare triple {1401#true} assume true; {1401#true} is VALID [2022-02-20 22:26:20,783 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {1401#true} {1402#false} #3648#return; {1402#false} is VALID [2022-02-20 22:26:20,784 INFO L290 TraceCheckUtils]: 67: Hoare triple {1402#false} havoc main_#t~ret1004#1.base, main_#t~ret1004#1.offset;~ldv_state_variable_4~0 := 0;assume { :begin_inline_work_init_1 } true;~ldv_work_1_0~0 := 0;~ldv_work_1_1~0 := 0;~ldv_work_1_2~0 := 0;~ldv_work_1_3~0 := 0; {1402#false} is VALID [2022-02-20 22:26:20,784 INFO L290 TraceCheckUtils]: 68: Hoare triple {1402#false} assume { :end_inline_work_init_1 } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;assume { :begin_inline_timer_init_2 } true;~ldv_timer_2_0~0 := 0;~ldv_timer_2_1~0 := 0;~ldv_timer_2_2~0 := 0;~ldv_timer_2_3~0 := 0; {1402#false} is VALID [2022-02-20 22:26:20,784 INFO L290 TraceCheckUtils]: 69: Hoare triple {1402#false} assume { :end_inline_timer_init_2 } true;~ldv_state_variable_2~0 := 1; {1402#false} is VALID [2022-02-20 22:26:20,784 INFO L290 TraceCheckUtils]: 70: Hoare triple {1402#false} assume -2147483648 <= main_#t~nondet1005#1 && main_#t~nondet1005#1 <= 2147483647;main_~tmp___1~20#1 := main_#t~nondet1005#1;havoc main_#t~nondet1005#1;main_#t~switch1006#1 := 0 == main_~tmp___1~20#1; {1402#false} is VALID [2022-02-20 22:26:20,785 INFO L290 TraceCheckUtils]: 71: Hoare triple {1402#false} assume !main_#t~switch1006#1;main_#t~switch1006#1 := main_#t~switch1006#1 || 1 == main_~tmp___1~20#1; {1402#false} is VALID [2022-02-20 22:26:20,785 INFO L290 TraceCheckUtils]: 72: Hoare triple {1402#false} assume !main_#t~switch1006#1;main_#t~switch1006#1 := main_#t~switch1006#1 || 2 == main_~tmp___1~20#1; {1402#false} is VALID [2022-02-20 22:26:20,785 INFO L290 TraceCheckUtils]: 73: Hoare triple {1402#false} assume !main_#t~switch1006#1;main_#t~switch1006#1 := main_#t~switch1006#1 || 3 == main_~tmp___1~20#1; {1402#false} is VALID [2022-02-20 22:26:20,785 INFO L290 TraceCheckUtils]: 74: Hoare triple {1402#false} assume main_#t~switch1006#1; {1402#false} is VALID [2022-02-20 22:26:20,785 INFO L290 TraceCheckUtils]: 75: Hoare triple {1402#false} assume 0 != ~ldv_state_variable_3~0;assume -2147483648 <= main_#t~nondet1017#1 && main_#t~nondet1017#1 <= 2147483647;main_~tmp___4~7#1 := main_#t~nondet1017#1;havoc main_#t~nondet1017#1;main_#t~switch1018#1 := 0 == main_~tmp___4~7#1; {1402#false} is VALID [2022-02-20 22:26:20,785 INFO L290 TraceCheckUtils]: 76: Hoare triple {1402#false} assume main_#t~switch1018#1; {1402#false} is VALID [2022-02-20 22:26:20,788 INFO L290 TraceCheckUtils]: 77: Hoare triple {1402#false} assume 1 == ~ldv_state_variable_3~0;assume { :begin_inline_msb_probe } true;msb_probe_#in~card#1.base, msb_probe_#in~card#1.offset := ~msb_driver_group0~0.base, ~msb_driver_group0~0.offset;havoc msb_probe_#res#1;havoc msb_probe_#t~ret953#1.base, msb_probe_#t~ret953#1.offset, msb_probe_#t~ret954#1.base, msb_probe_#t~ret954#1.offset, msb_probe_#t~ret955#1, msb_probe_#t~ret956#1, msb_probe_~card#1.base, msb_probe_~card#1.offset, msb_probe_~msb~16#1.base, msb_probe_~msb~16#1.offset, msb_probe_~rc~1#1, msb_probe_~tmp~54#1.base, msb_probe_~tmp~54#1.offset, msb_probe_~#__key~1#1.base, msb_probe_~#__key~1#1.offset;msb_probe_~card#1.base, msb_probe_~card#1.offset := msb_probe_#in~card#1.base, msb_probe_#in~card#1.offset;havoc msb_probe_~msb~16#1.base, msb_probe_~msb~16#1.offset;havoc msb_probe_~rc~1#1;havoc msb_probe_~tmp~54#1.base, msb_probe_~tmp~54#1.offset;call msb_probe_~#__key~1#1.base, msb_probe_~#__key~1#1.offset := #Ultimate.allocOnStack(8);msb_probe_~rc~1#1 := 0; {1402#false} is VALID [2022-02-20 22:26:20,788 INFO L272 TraceCheckUtils]: 78: Hoare triple {1402#false} call msb_probe_#t~ret953#1.base, msb_probe_#t~ret953#1.offset := kmalloc(1960, 208); {1402#false} is VALID [2022-02-20 22:26:20,789 INFO L290 TraceCheckUtils]: 79: Hoare triple {1402#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp~67#1.base, ~tmp~67#1.offset;assume { :begin_inline_ldv_check_alloc_flags } true;ldv_check_alloc_flags_#in~flags#1 := ~flags#1;havoc ldv_check_alloc_flags_~flags#1;ldv_check_alloc_flags_~flags#1 := ldv_check_alloc_flags_#in~flags#1; {1402#false} is VALID [2022-02-20 22:26:20,789 INFO L290 TraceCheckUtils]: 80: Hoare triple {1402#false} assume 0 != ~ldv_spin~0 && 0 != (if 0 == ldv_check_alloc_flags_~flags#1 then 0 else (if 1 == ldv_check_alloc_flags_~flags#1 then 0 else ~bitwiseAnd(ldv_check_alloc_flags_~flags#1, 16))) % 4294967296; {1402#false} is VALID [2022-02-20 22:26:20,789 INFO L272 TraceCheckUtils]: 81: Hoare triple {1402#false} call ldv_error(); {1402#false} is VALID [2022-02-20 22:26:20,789 INFO L290 TraceCheckUtils]: 82: Hoare triple {1402#false} assume !false; {1402#false} is VALID [2022-02-20 22:26:20,790 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-02-20 22:26:20,791 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:26:20,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651026290] [2022-02-20 22:26:20,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651026290] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:26:20,792 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:26:20,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 22:26:20,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951086657] [2022-02-20 22:26:20,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:26:20,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2022-02-20 22:26:20,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:26:20,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:26:20,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:26:20,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 22:26:20,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:26:20,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 22:26:20,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 22:26:20,895 INFO L87 Difference]: Start difference. First operand has 1398 states, 999 states have (on average 1.3853853853853855) internal successors, (1384), 1035 states have internal predecessors, (1384), 315 states have call successors, (315), 83 states have call predecessors, (315), 82 states have return successors, (309), 303 states have call predecessors, (309), 309 states have call successors, (309) Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:26:41,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:26:41,858 INFO L93 Difference]: Finished difference Result 3095 states and 4634 transitions. [2022-02-20 22:26:41,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 22:26:41,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2022-02-20 22:26:41,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:26:41,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:26:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4634 transitions. [2022-02-20 22:26:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:26:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4634 transitions. [2022-02-20 22:26:42,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 4634 transitions. [2022-02-20 22:26:45,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4634 edges. 4634 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:26:46,333 INFO L225 Difference]: With dead ends: 3095 [2022-02-20 22:26:46,334 INFO L226 Difference]: Without dead ends: 1669 [2022-02-20 22:26:46,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:26:46,347 INFO L933 BasicCegarLoop]: 1874 mSDtfsCounter, 893 mSDsluCounter, 2564 mSDsCounter, 0 mSdLazyCounter, 1972 mSolverCounterSat, 883 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 4438 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 883 IncrementalHoareTripleChecker+Valid, 1972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-02-20 22:26:46,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [938 Valid, 4438 Invalid, 2855 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [883 Valid, 1972 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-02-20 22:26:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2022-02-20 22:26:46,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1367. [2022-02-20 22:26:46,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:26:46,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1669 states. Second operand has 1367 states, 977 states have (on average 1.3694984646878199) internal successors, (1338), 1005 states have internal predecessors, (1338), 308 states have call successors, (308), 82 states have call predecessors, (308), 81 states have return successors, (307), 301 states have call predecessors, (307), 307 states have call successors, (307) [2022-02-20 22:26:46,467 INFO L74 IsIncluded]: Start isIncluded. First operand 1669 states. Second operand has 1367 states, 977 states have (on average 1.3694984646878199) internal successors, (1338), 1005 states have internal predecessors, (1338), 308 states have call successors, (308), 82 states have call predecessors, (308), 81 states have return successors, (307), 301 states have call predecessors, (307), 307 states have call successors, (307) [2022-02-20 22:26:46,470 INFO L87 Difference]: Start difference. First operand 1669 states. Second operand has 1367 states, 977 states have (on average 1.3694984646878199) internal successors, (1338), 1005 states have internal predecessors, (1338), 308 states have call successors, (308), 82 states have call predecessors, (308), 81 states have return successors, (307), 301 states have call predecessors, (307), 307 states have call successors, (307) [2022-02-20 22:26:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:26:46,600 INFO L93 Difference]: Finished difference Result 1669 states and 2501 transitions. [2022-02-20 22:26:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2501 transitions. [2022-02-20 22:26:46,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:26:46,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:26:46,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 1367 states, 977 states have (on average 1.3694984646878199) internal successors, (1338), 1005 states have internal predecessors, (1338), 308 states have call successors, (308), 82 states have call predecessors, (308), 81 states have return successors, (307), 301 states have call predecessors, (307), 307 states have call successors, (307) Second operand 1669 states. [2022-02-20 22:26:46,634 INFO L87 Difference]: Start difference. First operand has 1367 states, 977 states have (on average 1.3694984646878199) internal successors, (1338), 1005 states have internal predecessors, (1338), 308 states have call successors, (308), 82 states have call predecessors, (308), 81 states have return successors, (307), 301 states have call predecessors, (307), 307 states have call successors, (307) Second operand 1669 states. [2022-02-20 22:26:46,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:26:46,779 INFO L93 Difference]: Finished difference Result 1669 states and 2501 transitions. [2022-02-20 22:26:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2501 transitions. [2022-02-20 22:26:46,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:26:46,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:26:46,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:26:46,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:26:46,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 977 states have (on average 1.3694984646878199) internal successors, (1338), 1005 states have internal predecessors, (1338), 308 states have call successors, (308), 82 states have call predecessors, (308), 81 states have return successors, (307), 301 states have call predecessors, (307), 307 states have call successors, (307) [2022-02-20 22:26:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1953 transitions. [2022-02-20 22:26:46,921 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1953 transitions. Word has length 83 [2022-02-20 22:26:46,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:26:46,922 INFO L470 AbstractCegarLoop]: Abstraction has 1367 states and 1953 transitions. [2022-02-20 22:26:46,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:26:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1953 transitions. [2022-02-20 22:26:46,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-20 22:26:46,926 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:26:46,926 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:26:46,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 22:26:46,927 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:26:46,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:26:46,927 INFO L85 PathProgramCache]: Analyzing trace with hash -998144447, now seen corresponding path program 1 times [2022-02-20 22:26:46,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:26:46,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342835075] [2022-02-20 22:26:46,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:26:46,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:26:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:47,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:26:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:47,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:26:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:47,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {11107#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11041#true} is VALID [2022-02-20 22:26:47,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11041#true} {11041#true} #3620#return; {11041#true} is VALID [2022-02-20 22:26:47,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:26:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:47,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {11041#true} ~cond := #in~cond; {11041#true} is VALID [2022-02-20 22:26:47,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {11041#true} assume !(0 == ~cond); {11041#true} is VALID [2022-02-20 22:26:47,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11041#true} {11041#true} #3622#return; {11041#true} is VALID [2022-02-20 22:26:47,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {11099#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~3.base, ~tmp~3.offset;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~size); {11041#true} is VALID [2022-02-20 22:26:47,128 INFO L272 TraceCheckUtils]: 1: Hoare triple {11041#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~size, ~size); {11107#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:26:47,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {11107#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11041#true} is VALID [2022-02-20 22:26:47,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,129 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11041#true} {11041#true} #3620#return; {11041#true} is VALID [2022-02-20 22:26:47,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {11041#true} ~tmp~3.base, ~tmp~3.offset := #t~malloc18.base, #t~malloc18.offset;~p~2.base, ~p~2.offset := ~tmp~3.base, ~tmp~3.offset; {11041#true} is VALID [2022-02-20 22:26:47,129 INFO L272 TraceCheckUtils]: 6: Hoare triple {11041#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {11041#true} is VALID [2022-02-20 22:26:47,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {11041#true} ~cond := #in~cond; {11041#true} is VALID [2022-02-20 22:26:47,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {11041#true} assume !(0 == ~cond); {11041#true} is VALID [2022-02-20 22:26:47,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,130 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11041#true} {11041#true} #3622#return; {11041#true} is VALID [2022-02-20 22:26:47,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {11041#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {11041#true} is VALID [2022-02-20 22:26:47,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,130 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11041#true} {11041#true} #3640#return; {11041#true} is VALID [2022-02-20 22:26:47,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:26:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:47,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:26:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:47,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {11107#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11041#true} is VALID [2022-02-20 22:26:47,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11041#true} {11041#true} #3620#return; {11041#true} is VALID [2022-02-20 22:26:47,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:26:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:47,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {11041#true} ~cond := #in~cond; {11041#true} is VALID [2022-02-20 22:26:47,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {11041#true} assume !(0 == ~cond); {11041#true} is VALID [2022-02-20 22:26:47,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11041#true} {11041#true} #3622#return; {11041#true} is VALID [2022-02-20 22:26:47,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {11099#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~3.base, ~tmp~3.offset;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~size); {11041#true} is VALID [2022-02-20 22:26:47,162 INFO L272 TraceCheckUtils]: 1: Hoare triple {11041#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~size, ~size); {11107#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:26:47,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {11107#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11041#true} is VALID [2022-02-20 22:26:47,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,163 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11041#true} {11041#true} #3620#return; {11041#true} is VALID [2022-02-20 22:26:47,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {11041#true} ~tmp~3.base, ~tmp~3.offset := #t~malloc18.base, #t~malloc18.offset;~p~2.base, ~p~2.offset := ~tmp~3.base, ~tmp~3.offset; {11041#true} is VALID [2022-02-20 22:26:47,163 INFO L272 TraceCheckUtils]: 6: Hoare triple {11041#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {11041#true} is VALID [2022-02-20 22:26:47,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {11041#true} ~cond := #in~cond; {11041#true} is VALID [2022-02-20 22:26:47,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {11041#true} assume !(0 == ~cond); {11041#true} is VALID [2022-02-20 22:26:47,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,164 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11041#true} {11041#true} #3622#return; {11041#true} is VALID [2022-02-20 22:26:47,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {11041#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {11041#true} is VALID [2022-02-20 22:26:47,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,165 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11041#true} {11041#true} #3642#return; {11041#true} is VALID [2022-02-20 22:26:47,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-20 22:26:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:47,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:26:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:47,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1059 := 0; {11041#true} is VALID [2022-02-20 22:26:47,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {11041#true} assume !(#t~loopctr1059 % 18446744073709551616 < #amount % 18446744073709551616); {11041#true} is VALID [2022-02-20 22:26:47,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {11041#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11041#true} is VALID [2022-02-20 22:26:47,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11041#true} {11041#true} #3766#return; {11041#true} is VALID [2022-02-20 22:26:47,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~4.base, ~tmp~4.offset; {11041#true} is VALID [2022-02-20 22:26:47,210 INFO L272 TraceCheckUtils]: 1: Hoare triple {11041#true} call #t~memset~res19.base, #t~memset~res19.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:26:47,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1059 := 0; {11041#true} is VALID [2022-02-20 22:26:47,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {11041#true} assume !(#t~loopctr1059 % 18446744073709551616 < #amount % 18446744073709551616); {11041#true} is VALID [2022-02-20 22:26:47,210 INFO L290 TraceCheckUtils]: 4: Hoare triple {11041#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11041#true} is VALID [2022-02-20 22:26:47,211 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11041#true} {11041#true} #3766#return; {11041#true} is VALID [2022-02-20 22:26:47,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {11041#true} ~tmp~4.base, ~tmp~4.offset := ~s.base, ~s.offset;havoc #t~memset~res19.base, #t~memset~res19.offset;#res.base, #res.offset := ~tmp~4.base, ~tmp~4.offset; {11041#true} is VALID [2022-02-20 22:26:47,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,211 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {11041#true} {11041#true} #3644#return; {11041#true} is VALID [2022-02-20 22:26:47,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 22:26:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:47,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:26:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:47,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1059 := 0; {11041#true} is VALID [2022-02-20 22:26:47,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {11041#true} assume !(#t~loopctr1059 % 18446744073709551616 < #amount % 18446744073709551616); {11041#true} is VALID [2022-02-20 22:26:47,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {11041#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11041#true} is VALID [2022-02-20 22:26:47,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11041#true} {11041#true} #3766#return; {11041#true} is VALID [2022-02-20 22:26:47,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~4.base, ~tmp~4.offset; {11041#true} is VALID [2022-02-20 22:26:47,233 INFO L272 TraceCheckUtils]: 1: Hoare triple {11041#true} call #t~memset~res19.base, #t~memset~res19.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:26:47,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1059 := 0; {11041#true} is VALID [2022-02-20 22:26:47,233 INFO L290 TraceCheckUtils]: 3: Hoare triple {11041#true} assume !(#t~loopctr1059 % 18446744073709551616 < #amount % 18446744073709551616); {11041#true} is VALID [2022-02-20 22:26:47,233 INFO L290 TraceCheckUtils]: 4: Hoare triple {11041#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11041#true} is VALID [2022-02-20 22:26:47,234 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11041#true} {11041#true} #3766#return; {11041#true} is VALID [2022-02-20 22:26:47,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {11041#true} ~tmp~4.base, ~tmp~4.offset := ~s.base, ~s.offset;havoc #t~memset~res19.base, #t~memset~res19.offset;#res.base, #res.offset := ~tmp~4.base, ~tmp~4.offset; {11041#true} is VALID [2022-02-20 22:26:47,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,234 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {11041#true} {11041#true} #3646#return; {11041#true} is VALID [2022-02-20 22:26:47,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-20 22:26:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:47,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:26:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:26:47,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1059 := 0; {11041#true} is VALID [2022-02-20 22:26:47,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {11041#true} assume !(#t~loopctr1059 % 18446744073709551616 < #amount % 18446744073709551616); {11041#true} is VALID [2022-02-20 22:26:47,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {11041#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11041#true} is VALID [2022-02-20 22:26:47,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11041#true} {11041#true} #3766#return; {11041#true} is VALID [2022-02-20 22:26:47,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~4.base, ~tmp~4.offset; {11041#true} is VALID [2022-02-20 22:26:47,270 INFO L272 TraceCheckUtils]: 1: Hoare triple {11041#true} call #t~memset~res19.base, #t~memset~res19.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:26:47,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1059 := 0; {11041#true} is VALID [2022-02-20 22:26:47,270 INFO L290 TraceCheckUtils]: 3: Hoare triple {11041#true} assume !(#t~loopctr1059 % 18446744073709551616 < #amount % 18446744073709551616); {11041#true} is VALID [2022-02-20 22:26:47,270 INFO L290 TraceCheckUtils]: 4: Hoare triple {11041#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11041#true} is VALID [2022-02-20 22:26:47,270 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11041#true} {11041#true} #3766#return; {11041#true} is VALID [2022-02-20 22:26:47,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {11041#true} ~tmp~4.base, ~tmp~4.offset := ~s.base, ~s.offset;havoc #t~memset~res19.base, #t~memset~res19.offset;#res.base, #res.offset := ~tmp~4.base, ~tmp~4.offset; {11041#true} is VALID [2022-02-20 22:26:47,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,271 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {11041#true} {11041#true} #3648#return; {11041#true} is VALID [2022-02-20 22:26:47,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {11041#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(86, 2);call #Ultimate.allocInit(57, 3);call #Ultimate.allocInit(60, 4);call #Ultimate.allocInit(64, 5);call #Ultimate.allocInit(211, 6);call #Ultimate.allocInit(211, 7);call #Ultimate.allocInit(211, 8);call #Ultimate.allocInit(211, 9);call #Ultimate.allocInit(37, 10);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(41, 12);call #Ultimate.allocInit(59, 13);call #Ultimate.allocInit(40, 14);call #Ultimate.allocInit(35, 15);call #Ultimate.allocInit(48, 16);call #Ultimate.allocInit(37, 17);call #Ultimate.allocInit(37, 18);call #Ultimate.allocInit(67, 19);call #Ultimate.allocInit(33, 20);call #Ultimate.allocInit(45, 21);call #Ultimate.allocInit(27, 22);call #Ultimate.allocInit(47, 23);call #Ultimate.allocInit(52, 24);call #Ultimate.allocInit(49, 25);call #Ultimate.allocInit(69, 26);call #Ultimate.allocInit(48, 27);call #Ultimate.allocInit(58, 28);call #Ultimate.allocInit(56, 29);call #Ultimate.allocInit(65, 30);call #Ultimate.allocInit(48, 31);call #Ultimate.allocInit(63, 32);call #Ultimate.allocInit(65, 33);call #Ultimate.allocInit(41, 34);call #Ultimate.allocInit(56, 35);call #Ultimate.allocInit(52, 36);call #Ultimate.allocInit(103, 37);call #Ultimate.allocInit(70, 38);call #Ultimate.allocInit(51, 39);call #Ultimate.allocInit(38, 40);call #Ultimate.allocInit(38, 41);call #Ultimate.allocInit(55, 42);call #Ultimate.allocInit(49, 43);call #Ultimate.allocInit(62, 44);call #Ultimate.allocInit(48, 45);call #Ultimate.allocInit(69, 46);call #Ultimate.allocInit(48, 47);call #Ultimate.allocInit(41, 48);call #Ultimate.allocInit(58, 49);call #Ultimate.allocInit(55, 50);call #Ultimate.allocInit(55, 51);call #Ultimate.allocInit(40, 52);call #Ultimate.allocInit(72, 53);call #Ultimate.allocInit(57, 54);call #Ultimate.allocInit(54, 55);call #Ultimate.allocInit(48, 56);call #Ultimate.allocInit(46, 57);call #Ultimate.allocInit(82, 58);call #Ultimate.allocInit(36, 59);call #Ultimate.allocInit(37, 60);call #Ultimate.allocInit(38, 61);call #Ultimate.allocInit(55, 62);call #Ultimate.allocInit(64, 63);call #Ultimate.allocInit(30, 64);call #Ultimate.allocInit(55, 65);call #Ultimate.allocInit(50, 66);call #Ultimate.allocInit(31, 67);call #Ultimate.allocInit(51, 68);call #Ultimate.allocInit(35, 69);call #Ultimate.allocInit(47, 70);call #Ultimate.allocInit(46, 71);call #Ultimate.allocInit(46, 72);call #Ultimate.allocInit(95, 73);call #Ultimate.allocInit(34, 74);call #Ultimate.allocInit(39, 75);call #Ultimate.allocInit(56, 76);call #Ultimate.allocInit(60, 77);call #Ultimate.allocInit(62, 78);call #Ultimate.allocInit(37, 79);call #Ultimate.allocInit(55, 80);call #Ultimate.allocInit(34, 81);call #Ultimate.allocInit(46, 82);call #Ultimate.allocInit(57, 83);call #Ultimate.allocInit(58, 84);call #Ultimate.allocInit(48, 85);call #Ultimate.allocInit(35, 86);call #Ultimate.allocInit(44, 87);call #Ultimate.allocInit(33, 88);call #Ultimate.allocInit(40, 89);call #Ultimate.allocInit(26, 90);call #Ultimate.allocInit(87, 91);call #Ultimate.allocInit(32, 92);call #Ultimate.allocInit(33, 93);call #Ultimate.allocInit(29, 94);call #Ultimate.allocInit(41, 95);call #Ultimate.allocInit(39, 96);call #Ultimate.allocInit(60, 97);call #Ultimate.allocInit(38, 98);call #Ultimate.allocInit(18, 99);call #Ultimate.allocInit(24, 100);call #Ultimate.allocInit(14, 101);call #Ultimate.allocInit(30, 102);call #Ultimate.allocInit(33, 103);call #Ultimate.allocInit(23, 104);call #Ultimate.allocInit(27, 105);call #Ultimate.allocInit(46, 106);call #Ultimate.allocInit(211, 107);call #Ultimate.allocInit(36, 108);call #Ultimate.allocInit(37, 109);call #Ultimate.allocInit(8, 110);call #Ultimate.allocInit(47, 111);call #Ultimate.allocInit(11, 112);call #Ultimate.allocInit(9, 113);call #Ultimate.allocInit(16, 114);call #Ultimate.allocInit(23, 115);call #Ultimate.allocInit(23, 116);call #Ultimate.allocInit(37, 117);call #Ultimate.allocInit(27, 118);call #Ultimate.allocInit(53, 119);call #Ultimate.allocInit(9, 120);call #Ultimate.allocInit(9, 121);call #Ultimate.allocInit(48, 122);call #Ultimate.allocInit(9, 123);call #Ultimate.allocInit(58, 124);call #Ultimate.allocInit(9, 125);~ldv_work_struct_1_0~0.base, ~ldv_work_struct_1_0~0.offset := 0, 0;~ldv_work_struct_1_1~0.base, ~ldv_work_struct_1_1~0.offset := 0, 0;~ldv_timer_list_2_0~0.base, ~ldv_timer_list_2_0~0.offset := 0, 0;~ldv_work_struct_1_3~0.base, ~ldv_work_struct_1_3~0.offset := 0, 0;~ldv_timer_list_2_1~0.base, ~ldv_timer_list_2_1~0.offset := 0, 0;~ldv_work_1_3~0 := 0;~ldv_timer_2_1~0 := 0;~ldv_state_variable_0~0 := 0;~ldv_timer_2_0~0 := 0;~msb_driver_group0~0.base, ~msb_driver_group0~0.offset := 0, 0;~ldv_state_variable_2~0 := 0;~ldv_work_1_1~0 := 0;~ldv_timer_2_2~0 := 0;~ldv_work_1_2~0 := 0;~ldv_timer_2_3~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_work_struct_1_2~0.base, ~ldv_work_struct_1_2~0.offset := 0, 0;~ldv_state_variable_3~0 := 0;~msb_bdops_group0~0.base, ~msb_bdops_group0~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_timer_list_2_3~0.base, ~ldv_timer_list_2_3~0.offset := 0, 0;~ldv_work_1_0~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_timer_list_2_2~0.base, ~ldv_timer_list_2_2~0.offset := 0, 0;~ldv_state_variable_4~0 := 0;~debug~0 := 0;~cache_flush_timeout~0 := 1000;~verify_writes~0 := 0;~#chs_table~0.base, ~#chs_table~0.offset := 126, 0;call #Ultimate.allocInit(84, 126);call write~init~int(4, ~#chs_table~0.base, ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 8 + ~#chs_table~0.offset, 1);call write~init~int(247, ~#chs_table~0.base, 9 + ~#chs_table~0.offset, 2);call write~init~int(2, ~#chs_table~0.base, 11 + ~#chs_table~0.offset, 1);call write~init~int(8, ~#chs_table~0.base, 12 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 20 + ~#chs_table~0.offset, 1);call write~init~int(495, ~#chs_table~0.base, 21 + ~#chs_table~0.offset, 2);call write~init~int(2, ~#chs_table~0.base, 23 + ~#chs_table~0.offset, 1);call write~init~int(16, ~#chs_table~0.base, 24 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 32 + ~#chs_table~0.offset, 1);call write~init~int(495, ~#chs_table~0.base, 33 + ~#chs_table~0.offset, 2);call write~init~int(4, ~#chs_table~0.base, 35 + ~#chs_table~0.offset, 1);call write~init~int(32, ~#chs_table~0.base, 36 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 44 + ~#chs_table~0.offset, 1);call write~init~int(991, ~#chs_table~0.base, 45 + ~#chs_table~0.offset, 2);call write~init~int(4, ~#chs_table~0.base, 47 + ~#chs_table~0.offset, 1);call write~init~int(64, ~#chs_table~0.base, 48 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 56 + ~#chs_table~0.offset, 1);call write~init~int(991, ~#chs_table~0.base, 57 + ~#chs_table~0.offset, 2);call write~init~int(8, ~#chs_table~0.base, 59 + ~#chs_table~0.offset, 1);call write~init~int(128, ~#chs_table~0.base, 60 + ~#chs_table~0.offset, 8);call write~init~int(16, ~#chs_table~0.base, 68 + ~#chs_table~0.offset, 1);call write~init~int(991, ~#chs_table~0.base, 69 + ~#chs_table~0.offset, 2);call write~init~int(16, ~#chs_table~0.base, 71 + ~#chs_table~0.offset, 1);call write~init~int(0, ~#chs_table~0.base, 72 + ~#chs_table~0.offset, 8);call write~init~int(0, ~#chs_table~0.base, 80 + ~#chs_table~0.offset, 1);call write~init~int(0, ~#chs_table~0.base, 81 + ~#chs_table~0.offset, 2);call write~init~int(0, ~#chs_table~0.base, 83 + ~#chs_table~0.offset, 1);~#msb_disk_idr~0.base, ~#msb_disk_idr~0.offset := 127, 0;call #Ultimate.allocInit(104, 127);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 8 + ~#msb_disk_idr~0.offset, 8);call write~init~int(0, ~#msb_disk_idr~0.base, 16 + ~#msb_disk_idr~0.offset, 4);call write~init~int(0, ~#msb_disk_idr~0.base, 20 + ~#msb_disk_idr~0.offset, 4);call write~init~int(0, ~#msb_disk_idr~0.base, 24 + ~#msb_disk_idr~0.offset, 4);call write~init~int(3735899821, ~#msb_disk_idr~0.base, 28 + ~#msb_disk_idr~0.offset, 4);call write~init~int(4294967295, ~#msb_disk_idr~0.base, 32 + ~#msb_disk_idr~0.offset, 4);call write~init~$Pointer$(0, -1, ~#msb_disk_idr~0.base, 36 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 44 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 52 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 60 + ~#msb_disk_idr~0.offset, 8);call write~init~$Pointer$(99, 0, ~#msb_disk_idr~0.base, 68 + ~#msb_disk_idr~0.offset, 8);call write~init~int(0, ~#msb_disk_idr~0.base, 76 + ~#msb_disk_idr~0.offset, 4);call write~init~int(0, ~#msb_disk_idr~0.base, 80 + ~#msb_disk_idr~0.offset, 8);call write~init~int(0, ~#msb_disk_idr~0.base, 92 + ~#msb_disk_idr~0.offset, 4);call write~init~$Pointer$(0, 0, ~#msb_disk_idr~0.base, 96 + ~#msb_disk_idr~0.offset, 8);~#msb_disk_lock~0.base, ~#msb_disk_lock~0.offset := 128, 0;call #Ultimate.allocInit(148, 128);call write~init~int(1, ~#msb_disk_lock~0.base, ~#msb_disk_lock~0.offset, 4);call write~init~int(0, ~#msb_disk_lock~0.base, 4 + ~#msb_disk_lock~0.offset, 4);call write~init~int(3735899821, ~#msb_disk_lock~0.base, 8 + ~#msb_disk_lock~0.offset, 4);call write~init~int(4294967295, ~#msb_disk_lock~0.base, 12 + ~#msb_disk_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#msb_disk_lock~0.base, 16 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 24 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 32 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 40 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(100, 0, ~#msb_disk_lock~0.base, 48 + ~#msb_disk_lock~0.offset, 8);call write~init~int(0, ~#msb_disk_lock~0.base, 56 + ~#msb_disk_lock~0.offset, 4);call write~init~int(0, ~#msb_disk_lock~0.base, 60 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(~#msb_disk_lock~0.base, 72 + ~#msb_disk_lock~0.offset, ~#msb_disk_lock~0.base, 72 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(~#msb_disk_lock~0.base, 72 + ~#msb_disk_lock~0.offset, ~#msb_disk_lock~0.base, 80 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 88 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(~#msb_disk_lock~0.base, ~#msb_disk_lock~0.offset, ~#msb_disk_lock~0.base, 96 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 104 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 112 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_disk_lock~0.base, 120 + ~#msb_disk_lock~0.offset, 8);call write~init~$Pointer$(101, 0, ~#msb_disk_lock~0.base, 128 + ~#msb_disk_lock~0.offset, 8);call write~init~int(0, ~#msb_disk_lock~0.base, 136 + ~#msb_disk_lock~0.offset, 4);call write~init~int(0, ~#msb_disk_lock~0.base, 140 + ~#msb_disk_lock~0.offset, 8);~#msb_bdops~0.base, ~#msb_bdops~0.offset := 129, 0;call #Ultimate.allocInit(104, 129);call write~init~$Pointer$(#funAddr~msb_bd_open.base, #funAddr~msb_bd_open.offset, ~#msb_bdops~0.base, ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_bd_release.base, #funAddr~msb_bd_release.offset, ~#msb_bdops~0.base, 8 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 16 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 24 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 32 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 40 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 48 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 56 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 64 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 72 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_bd_getgeo.base, #funAddr~msb_bd_getgeo.offset, ~#msb_bdops~0.base, 80 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_bdops~0.base, 88 + ~#msb_bdops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#msb_bdops~0.base, 96 + ~#msb_bdops~0.offset, 8);~#msb_id_tbl~0.base, ~#msb_id_tbl~0.offset := 130, 0;call #Ultimate.allocInit(24, 130);call write~init~int(1, ~#msb_id_tbl~0.base, ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 1 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 2 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 3 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 4 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 5 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 6 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 7 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 8 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 9 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 10 + ~#msb_id_tbl~0.offset, 1);call write~init~int(2, ~#msb_id_tbl~0.base, 11 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 12 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 13 + ~#msb_id_tbl~0.offset, 1);call write~init~int(255, ~#msb_id_tbl~0.base, 14 + ~#msb_id_tbl~0.offset, 1);call write~init~int(3, ~#msb_id_tbl~0.base, 15 + ~#msb_id_tbl~0.offset, 1);call write~init~int(1, ~#msb_id_tbl~0.base, 16 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 17 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 18 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 19 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 20 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 21 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 22 + ~#msb_id_tbl~0.offset, 1);call write~init~int(0, ~#msb_id_tbl~0.base, 23 + ~#msb_id_tbl~0.offset, 1);~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[0 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[1 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[2 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[3 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[4 := 0];~__mod_memstick__msb_id_tbl_device_table~0.match_flags := ~__mod_memstick__msb_id_tbl_device_table~0.match_flags[5 := 0];~__mod_memstick__msb_id_tbl_device_table~0.type := ~__mod_memstick__msb_id_tbl_device_table~0.type[5 := 0];~__mod_memstick__msb_id_tbl_device_table~0.category := ~__mod_memstick__msb_id_tbl_device_table~0.category[5 := 0];~__mod_memstick__msb_id_tbl_device_table~0.class := ~__mod_memstick__msb_id_tbl_device_table~0.class[5 := 0];~#msb_driver~0.base, ~#msb_driver~0.offset := 131, 0;call #Ultimate.allocInit(157, 131);call write~init~$Pointer$(~#msb_id_tbl~0.base, ~#msb_id_tbl~0.offset, ~#msb_driver~0.base, ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_probe.base, #funAddr~msb_probe.offset, ~#msb_driver~0.base, 8 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_remove.base, #funAddr~msb_remove.offset, ~#msb_driver~0.base, 16 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_suspend.base, #funAddr~msb_suspend.offset, ~#msb_driver~0.base, 24 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~msb_resume.base, #funAddr~msb_resume.offset, ~#msb_driver~0.base, 32 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(120, 0, ~#msb_driver~0.base, 40 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 48 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#msb_driver~0.base, 56 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 64 + ~#msb_driver~0.offset, 8);call write~init~int(0, ~#msb_driver~0.base, 72 + ~#msb_driver~0.offset, 1);call write~init~int(0, ~#msb_driver~0.base, 73 + ~#msb_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 77 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 85 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 93 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 101 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 109 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 117 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 125 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 133 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 141 + ~#msb_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#msb_driver~0.base, 149 + ~#msb_driver~0.offset, 8);~major~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~ldv_retval_2~0 := 0;~ldv_spin~0 := 0; {11041#true} is VALID [2022-02-20 22:26:47,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {11041#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret1000#1.base, main_#t~ret1000#1.offset, main_#t~ret1001#1.base, main_#t~ret1001#1.offset, main_#t~ret1002#1.base, main_#t~ret1002#1.offset, main_#t~ret1003#1.base, main_#t~ret1003#1.offset, main_#t~ret1004#1.base, main_#t~ret1004#1.offset, main_#t~nondet1005#1, main_#t~switch1006#1, main_#t~nondet1007#1, main_#t~switch1008#1, main_#t~mem1009#1, main_#t~ret1010#1, main_#t~ret1011#1, main_#t~mem1012#1, main_#t~ret1013#1, main_#t~nondet1014#1, main_#t~switch1015#1, main_#t~ret1016#1, main_#t~nondet1017#1, main_#t~switch1018#1, main_#t~ret1019#1, main_#t~mem1020#1, main_#t~ret1021#1, main_#t~ret1022#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~62#1.base, main_~tmp~62#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___0~36#1.base, main_~tmp___0~36#1.offset, main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset, main_~tmp___1~20#1, main_~tmp___2~13#1, main_~tmp___3~10#1, main_~tmp___4~7#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~62#1.base, main_~tmp~62#1.offset;call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___0~36#1.base, main_~tmp___0~36#1.offset;call main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___1~20#1;havoc main_~tmp___2~13#1;havoc main_~tmp___3~10#1;havoc main_~tmp___4~7#1; {11041#true} is VALID [2022-02-20 22:26:47,272 INFO L272 TraceCheckUtils]: 2: Hoare triple {11041#true} call main_#t~ret1000#1.base, main_#t~ret1000#1.offset := ldv_init_zalloc(16); {11099#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:26:47,272 INFO L290 TraceCheckUtils]: 3: Hoare triple {11099#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~3.base, ~tmp~3.offset;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~size); {11041#true} is VALID [2022-02-20 22:26:47,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {11041#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~size, ~size); {11107#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:26:47,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {11107#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11041#true} is VALID [2022-02-20 22:26:47,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,274 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11041#true} {11041#true} #3620#return; {11041#true} is VALID [2022-02-20 22:26:47,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {11041#true} ~tmp~3.base, ~tmp~3.offset := #t~malloc18.base, #t~malloc18.offset;~p~2.base, ~p~2.offset := ~tmp~3.base, ~tmp~3.offset; {11041#true} is VALID [2022-02-20 22:26:47,274 INFO L272 TraceCheckUtils]: 9: Hoare triple {11041#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {11041#true} is VALID [2022-02-20 22:26:47,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {11041#true} ~cond := #in~cond; {11041#true} is VALID [2022-02-20 22:26:47,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {11041#true} assume !(0 == ~cond); {11041#true} is VALID [2022-02-20 22:26:47,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,274 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11041#true} {11041#true} #3622#return; {11041#true} is VALID [2022-02-20 22:26:47,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {11041#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {11041#true} is VALID [2022-02-20 22:26:47,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,275 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11041#true} {11041#true} #3640#return; {11041#true} is VALID [2022-02-20 22:26:47,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {11041#true} main_~tmp~62#1.base, main_~tmp~62#1.offset := main_#t~ret1000#1.base, main_#t~ret1000#1.offset;havoc main_#t~ret1000#1.base, main_#t~ret1000#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~62#1.base, main_~tmp~62#1.offset; {11041#true} is VALID [2022-02-20 22:26:47,276 INFO L272 TraceCheckUtils]: 18: Hoare triple {11041#true} call main_#t~ret1001#1.base, main_#t~ret1001#1.offset := ldv_init_zalloc(1744); {11099#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:26:47,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {11099#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~3.base, ~tmp~3.offset;call #t~malloc18.base, #t~malloc18.offset := #Ultimate.allocOnHeap(~size); {11041#true} is VALID [2022-02-20 22:26:47,277 INFO L272 TraceCheckUtils]: 20: Hoare triple {11041#true} call #Ultimate.meminit(#t~malloc18.base, #t~malloc18.offset, 1, ~size, ~size); {11107#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:26:47,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {11107#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11041#true} is VALID [2022-02-20 22:26:47,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,278 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11041#true} {11041#true} #3620#return; {11041#true} is VALID [2022-02-20 22:26:47,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {11041#true} ~tmp~3.base, ~tmp~3.offset := #t~malloc18.base, #t~malloc18.offset;~p~2.base, ~p~2.offset := ~tmp~3.base, ~tmp~3.offset; {11041#true} is VALID [2022-02-20 22:26:47,278 INFO L272 TraceCheckUtils]: 25: Hoare triple {11041#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {11041#true} is VALID [2022-02-20 22:26:47,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {11041#true} ~cond := #in~cond; {11041#true} is VALID [2022-02-20 22:26:47,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {11041#true} assume !(0 == ~cond); {11041#true} is VALID [2022-02-20 22:26:47,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,284 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {11041#true} {11041#true} #3622#return; {11041#true} is VALID [2022-02-20 22:26:47,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {11041#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {11041#true} is VALID [2022-02-20 22:26:47,285 INFO L290 TraceCheckUtils]: 31: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,285 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11041#true} {11041#true} #3642#return; {11041#true} is VALID [2022-02-20 22:26:47,285 INFO L290 TraceCheckUtils]: 33: Hoare triple {11041#true} main_~tmp___0~36#1.base, main_~tmp___0~36#1.offset := main_#t~ret1001#1.base, main_#t~ret1001#1.offset;havoc main_#t~ret1001#1.base, main_#t~ret1001#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___0~36#1.base, main_~tmp___0~36#1.offset;assume { :begin_inline_ldv_initialize } true; {11041#true} is VALID [2022-02-20 22:26:47,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {11041#true} assume { :end_inline_ldv_initialize } true; {11041#true} is VALID [2022-02-20 22:26:47,287 INFO L272 TraceCheckUtils]: 35: Hoare triple {11041#true} call main_#t~ret1002#1.base, main_#t~ret1002#1.offset := ldv_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 4); {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:26:47,287 INFO L290 TraceCheckUtils]: 36: Hoare triple {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~4.base, ~tmp~4.offset; {11041#true} is VALID [2022-02-20 22:26:47,288 INFO L272 TraceCheckUtils]: 37: Hoare triple {11041#true} call #t~memset~res19.base, #t~memset~res19.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:26:47,288 INFO L290 TraceCheckUtils]: 38: Hoare triple {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1059 := 0; {11041#true} is VALID [2022-02-20 22:26:47,288 INFO L290 TraceCheckUtils]: 39: Hoare triple {11041#true} assume !(#t~loopctr1059 % 18446744073709551616 < #amount % 18446744073709551616); {11041#true} is VALID [2022-02-20 22:26:47,289 INFO L290 TraceCheckUtils]: 40: Hoare triple {11041#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11041#true} is VALID [2022-02-20 22:26:47,289 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11041#true} {11041#true} #3766#return; {11041#true} is VALID [2022-02-20 22:26:47,289 INFO L290 TraceCheckUtils]: 42: Hoare triple {11041#true} ~tmp~4.base, ~tmp~4.offset := ~s.base, ~s.offset;havoc #t~memset~res19.base, #t~memset~res19.offset;#res.base, #res.offset := ~tmp~4.base, ~tmp~4.offset; {11041#true} is VALID [2022-02-20 22:26:47,289 INFO L290 TraceCheckUtils]: 43: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,289 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {11041#true} {11041#true} #3644#return; {11041#true} is VALID [2022-02-20 22:26:47,290 INFO L290 TraceCheckUtils]: 45: Hoare triple {11041#true} havoc main_#t~ret1002#1.base, main_#t~ret1002#1.offset; {11041#true} is VALID [2022-02-20 22:26:47,290 INFO L272 TraceCheckUtils]: 46: Hoare triple {11041#true} call main_#t~ret1003#1.base, main_#t~ret1003#1.offset := ldv_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:26:47,291 INFO L290 TraceCheckUtils]: 47: Hoare triple {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~4.base, ~tmp~4.offset; {11041#true} is VALID [2022-02-20 22:26:47,292 INFO L272 TraceCheckUtils]: 48: Hoare triple {11041#true} call #t~memset~res19.base, #t~memset~res19.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:26:47,292 INFO L290 TraceCheckUtils]: 49: Hoare triple {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1059 := 0; {11041#true} is VALID [2022-02-20 22:26:47,292 INFO L290 TraceCheckUtils]: 50: Hoare triple {11041#true} assume !(#t~loopctr1059 % 18446744073709551616 < #amount % 18446744073709551616); {11041#true} is VALID [2022-02-20 22:26:47,292 INFO L290 TraceCheckUtils]: 51: Hoare triple {11041#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11041#true} is VALID [2022-02-20 22:26:47,292 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11041#true} {11041#true} #3766#return; {11041#true} is VALID [2022-02-20 22:26:47,293 INFO L290 TraceCheckUtils]: 53: Hoare triple {11041#true} ~tmp~4.base, ~tmp~4.offset := ~s.base, ~s.offset;havoc #t~memset~res19.base, #t~memset~res19.offset;#res.base, #res.offset := ~tmp~4.base, ~tmp~4.offset; {11041#true} is VALID [2022-02-20 22:26:47,293 INFO L290 TraceCheckUtils]: 54: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,293 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11041#true} {11041#true} #3646#return; {11041#true} is VALID [2022-02-20 22:26:47,293 INFO L290 TraceCheckUtils]: 56: Hoare triple {11041#true} havoc main_#t~ret1003#1.base, main_#t~ret1003#1.offset; {11041#true} is VALID [2022-02-20 22:26:47,294 INFO L272 TraceCheckUtils]: 57: Hoare triple {11041#true} call main_#t~ret1004#1.base, main_#t~ret1004#1.offset := ldv_memset(main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset, 0, 4); {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:26:47,294 INFO L290 TraceCheckUtils]: 58: Hoare triple {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~4.base, ~tmp~4.offset; {11041#true} is VALID [2022-02-20 22:26:47,295 INFO L272 TraceCheckUtils]: 59: Hoare triple {11041#true} call #t~memset~res19.base, #t~memset~res19.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 22:26:47,295 INFO L290 TraceCheckUtils]: 60: Hoare triple {11115#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1059 := 0; {11041#true} is VALID [2022-02-20 22:26:47,295 INFO L290 TraceCheckUtils]: 61: Hoare triple {11041#true} assume !(#t~loopctr1059 % 18446744073709551616 < #amount % 18446744073709551616); {11041#true} is VALID [2022-02-20 22:26:47,296 INFO L290 TraceCheckUtils]: 62: Hoare triple {11041#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11041#true} is VALID [2022-02-20 22:26:47,296 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11041#true} {11041#true} #3766#return; {11041#true} is VALID [2022-02-20 22:26:47,296 INFO L290 TraceCheckUtils]: 64: Hoare triple {11041#true} ~tmp~4.base, ~tmp~4.offset := ~s.base, ~s.offset;havoc #t~memset~res19.base, #t~memset~res19.offset;#res.base, #res.offset := ~tmp~4.base, ~tmp~4.offset; {11041#true} is VALID [2022-02-20 22:26:47,296 INFO L290 TraceCheckUtils]: 65: Hoare triple {11041#true} assume true; {11041#true} is VALID [2022-02-20 22:26:47,296 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {11041#true} {11041#true} #3648#return; {11041#true} is VALID [2022-02-20 22:26:47,296 INFO L290 TraceCheckUtils]: 67: Hoare triple {11041#true} havoc main_#t~ret1004#1.base, main_#t~ret1004#1.offset;~ldv_state_variable_4~0 := 0;assume { :begin_inline_work_init_1 } true;~ldv_work_1_0~0 := 0;~ldv_work_1_1~0 := 0;~ldv_work_1_2~0 := 0;~ldv_work_1_3~0 := 0; {11041#true} is VALID [2022-02-20 22:26:47,297 INFO L290 TraceCheckUtils]: 68: Hoare triple {11041#true} assume { :end_inline_work_init_1 } true;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;assume { :begin_inline_timer_init_2 } true;~ldv_timer_2_0~0 := 0;~ldv_timer_2_1~0 := 0;~ldv_timer_2_2~0 := 0;~ldv_timer_2_3~0 := 0; {11098#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 22:26:47,297 INFO L290 TraceCheckUtils]: 69: Hoare triple {11098#(= ~ldv_state_variable_3~0 0)} assume { :end_inline_timer_init_2 } true;~ldv_state_variable_2~0 := 1; {11098#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 22:26:47,297 INFO L290 TraceCheckUtils]: 70: Hoare triple {11098#(= ~ldv_state_variable_3~0 0)} assume -2147483648 <= main_#t~nondet1005#1 && main_#t~nondet1005#1 <= 2147483647;main_~tmp___1~20#1 := main_#t~nondet1005#1;havoc main_#t~nondet1005#1;main_#t~switch1006#1 := 0 == main_~tmp___1~20#1; {11098#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 22:26:47,298 INFO L290 TraceCheckUtils]: 71: Hoare triple {11098#(= ~ldv_state_variable_3~0 0)} assume !main_#t~switch1006#1;main_#t~switch1006#1 := main_#t~switch1006#1 || 1 == main_~tmp___1~20#1; {11098#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 22:26:47,298 INFO L290 TraceCheckUtils]: 72: Hoare triple {11098#(= ~ldv_state_variable_3~0 0)} assume !main_#t~switch1006#1;main_#t~switch1006#1 := main_#t~switch1006#1 || 2 == main_~tmp___1~20#1; {11098#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 22:26:47,298 INFO L290 TraceCheckUtils]: 73: Hoare triple {11098#(= ~ldv_state_variable_3~0 0)} assume !main_#t~switch1006#1;main_#t~switch1006#1 := main_#t~switch1006#1 || 3 == main_~tmp___1~20#1; {11098#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 22:26:47,299 INFO L290 TraceCheckUtils]: 74: Hoare triple {11098#(= ~ldv_state_variable_3~0 0)} assume main_#t~switch1006#1; {11098#(= ~ldv_state_variable_3~0 0)} is VALID [2022-02-20 22:26:47,299 INFO L290 TraceCheckUtils]: 75: Hoare triple {11098#(= ~ldv_state_variable_3~0 0)} assume 0 != ~ldv_state_variable_3~0;assume -2147483648 <= main_#t~nondet1017#1 && main_#t~nondet1017#1 <= 2147483647;main_~tmp___4~7#1 := main_#t~nondet1017#1;havoc main_#t~nondet1017#1;main_#t~switch1018#1 := 0 == main_~tmp___4~7#1; {11042#false} is VALID [2022-02-20 22:26:47,299 INFO L290 TraceCheckUtils]: 76: Hoare triple {11042#false} assume main_#t~switch1018#1; {11042#false} is VALID [2022-02-20 22:26:47,299 INFO L290 TraceCheckUtils]: 77: Hoare triple {11042#false} assume 1 == ~ldv_state_variable_3~0;assume { :begin_inline_msb_probe } true;msb_probe_#in~card#1.base, msb_probe_#in~card#1.offset := ~msb_driver_group0~0.base, ~msb_driver_group0~0.offset;havoc msb_probe_#res#1;havoc msb_probe_#t~ret953#1.base, msb_probe_#t~ret953#1.offset, msb_probe_#t~ret954#1.base, msb_probe_#t~ret954#1.offset, msb_probe_#t~ret955#1, msb_probe_#t~ret956#1, msb_probe_~card#1.base, msb_probe_~card#1.offset, msb_probe_~msb~16#1.base, msb_probe_~msb~16#1.offset, msb_probe_~rc~1#1, msb_probe_~tmp~54#1.base, msb_probe_~tmp~54#1.offset, msb_probe_~#__key~1#1.base, msb_probe_~#__key~1#1.offset;msb_probe_~card#1.base, msb_probe_~card#1.offset := msb_probe_#in~card#1.base, msb_probe_#in~card#1.offset;havoc msb_probe_~msb~16#1.base, msb_probe_~msb~16#1.offset;havoc msb_probe_~rc~1#1;havoc msb_probe_~tmp~54#1.base, msb_probe_~tmp~54#1.offset;call msb_probe_~#__key~1#1.base, msb_probe_~#__key~1#1.offset := #Ultimate.allocOnStack(8);msb_probe_~rc~1#1 := 0; {11042#false} is VALID [2022-02-20 22:26:47,300 INFO L272 TraceCheckUtils]: 78: Hoare triple {11042#false} call msb_probe_#t~ret953#1.base, msb_probe_#t~ret953#1.offset := kmalloc(1960, 208); {11042#false} is VALID [2022-02-20 22:26:47,300 INFO L290 TraceCheckUtils]: 79: Hoare triple {11042#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp~67#1.base, ~tmp~67#1.offset;assume { :begin_inline_ldv_check_alloc_flags } true;ldv_check_alloc_flags_#in~flags#1 := ~flags#1;havoc ldv_check_alloc_flags_~flags#1;ldv_check_alloc_flags_~flags#1 := ldv_check_alloc_flags_#in~flags#1; {11042#false} is VALID [2022-02-20 22:26:47,300 INFO L290 TraceCheckUtils]: 80: Hoare triple {11042#false} assume 0 != ~ldv_spin~0 && 0 != (if 0 == ldv_check_alloc_flags_~flags#1 then 0 else (if 1 == ldv_check_alloc_flags_~flags#1 then 0 else ~bitwiseAnd(ldv_check_alloc_flags_~flags#1, 16))) % 4294967296; {11042#false} is VALID [2022-02-20 22:26:47,300 INFO L272 TraceCheckUtils]: 81: Hoare triple {11042#false} call ldv_error(); {11042#false} is VALID [2022-02-20 22:26:47,300 INFO L290 TraceCheckUtils]: 82: Hoare triple {11042#false} assume !false; {11042#false} is VALID [2022-02-20 22:26:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-02-20 22:26:47,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:26:47,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342835075] [2022-02-20 22:26:47,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342835075] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:26:47,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:26:47,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:26:47,302 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672794146] [2022-02-20 22:26:47,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:26:47,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 83 [2022-02-20 22:26:47,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:26:47,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 22:26:47,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:26:47,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:26:47,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:26:47,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:26:47,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:26:47,365 INFO L87 Difference]: Start difference. First operand 1367 states and 1953 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 22:26:52,380 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 22:26:58,623 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 22:27:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:27:12,165 INFO L93 Difference]: Finished difference Result 4094 states and 5985 transitions. [2022-02-20 22:27:12,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 22:27:12,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 83 [2022-02-20 22:27:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:27:12,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 22:27:12,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5985 transitions. [2022-02-20 22:27:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 22:27:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 5985 transitions. [2022-02-20 22:27:12,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 5985 transitions.