./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.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-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.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 c0e62a2f55ddaeb08563a2d9bb0bfed8d8d740037b0faa92e9ebf8fe89adc120 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:02:39,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:02:39,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:02:39,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:02:39,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:02:39,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:02:39,325 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:02:39,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:02:39,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:02:39,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:02:39,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:02:39,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:02:39,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:02:39,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:02:39,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:02:39,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:02:39,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:02:39,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:02:39,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:02:39,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:02:39,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:02:39,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:02:39,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:02:39,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:02:39,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:02:39,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:02:39,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:02:39,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:02:39,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:02:39,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:02:39,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:02:39,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:02:39,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:02:39,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:02:39,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:02:39,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:02:39,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:02:39,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:02:39,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:02:39,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:02:39,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:02:39,387 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:02:39,422 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:02:39,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:02:39,423 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:02:39,424 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:02:39,425 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:02:39,426 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:02:39,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:02:39,426 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:02:39,426 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:02:39,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:02:39,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 22:02:39,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:02:39,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:02:39,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:02:39,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:02:39,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:02:39,429 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:02:39,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:02:39,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:02:39,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:02:39,429 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:02:39,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:02:39,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:02:39,430 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:02:39,430 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:02:39,430 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 22:02:39,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 22:02:39,432 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:02:39,432 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:02:39,432 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:02:39,432 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 -> c0e62a2f55ddaeb08563a2d9bb0bfed8d8d740037b0faa92e9ebf8fe89adc120 [2022-02-20 22:02:39,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:02:39,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:02:39,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:02:39,718 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:02:39,719 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:02:39,720 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2022-02-20 22:02:39,783 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b691e054f/220ef8df0135471aa1a490bd4cec56fc/FLAG70e16eb6d [2022-02-20 22:02:40,359 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:02:40,360 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2022-02-20 22:02:40,400 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b691e054f/220ef8df0135471aa1a490bd4cec56fc/FLAG70e16eb6d [2022-02-20 22:02:40,585 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b691e054f/220ef8df0135471aa1a490bd4cec56fc [2022-02-20 22:02:40,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:02:40,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:02:40,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:02:40,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:02:40,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:02:40,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:02:40" (1/1) ... [2022-02-20 22:02:40,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373266c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:02:40, skipping insertion in model container [2022-02-20 22:02:40,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:02:40" (1/1) ... [2022-02-20 22:02:40,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:02:40,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:02:40,970 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2022-02-20 22:02:40,971 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2022-02-20 22:02:41,109 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-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2022-02-20 22:02:41,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:02:41,371 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:02:41,426 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2022-02-20 22:02:41,427 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2022-02-20 22:02:41,445 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-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2022-02-20 22:02:41,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:02:41,559 INFO L208 MainTranslator]: Completed translation [2022-02-20 22:02:41,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:02:41 WrapperNode [2022-02-20 22:02:41,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 22:02:41,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 22:02:41,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 22:02:41,561 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 22:02:41,568 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:02:41" (1/1) ... [2022-02-20 22:02:41,594 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:02:41" (1/1) ... [2022-02-20 22:02:41,648 INFO L137 Inliner]: procedures = 114, calls = 288, calls flagged for inlining = 49, calls inlined = 38, statements flattened = 878 [2022-02-20 22:02:41,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 22:02:41,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 22:02:41,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 22:02:41,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 22:02:41,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:02:41" (1/1) ... [2022-02-20 22:02:41,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:02:41" (1/1) ... [2022-02-20 22:02:41,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:02:41" (1/1) ... [2022-02-20 22:02:41,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:02:41" (1/1) ... [2022-02-20 22:02:41,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:02:41" (1/1) ... [2022-02-20 22:02:41,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:02:41" (1/1) ... [2022-02-20 22:02:41,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:02:41" (1/1) ... [2022-02-20 22:02:41,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 22:02:41,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 22:02:41,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 22:02:41,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 22:02:41,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:02:41" (1/1) ... [2022-02-20 22:02:41,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:02:41,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:02:41,777 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:02:41,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 22:02:41,819 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2022-02-20 22:02:41,820 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2022-02-20 22:02:41,820 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2022-02-20 22:02:41,821 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2022-02-20 22:02:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 22:02:41,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 22:02:41,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 22:02:41,825 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2022-02-20 22:02:41,825 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2022-02-20 22:02:41,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-02-20 22:02:41,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-02-20 22:02:41,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 22:02:41,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 22:02:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2022-02-20 22:02:41,826 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2022-02-20 22:02:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2022-02-20 22:02:41,826 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2022-02-20 22:02:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-02-20 22:02:41,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-02-20 22:02:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 22:02:41,826 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 22:02:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2022-02-20 22:02:41,826 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2022-02-20 22:02:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 22:02:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 22:02:41,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 22:02:41,826 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2022-02-20 22:02:41,827 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2022-02-20 22:02:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2022-02-20 22:02:41,827 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2022-02-20 22:02:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2022-02-20 22:02:41,827 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2022-02-20 22:02:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 22:02:41,827 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 22:02:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 22:02:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2022-02-20 22:02:41,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2022-02-20 22:02:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 22:02:41,827 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-02-20 22:02:41,828 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-02-20 22:02:41,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 22:02:41,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 22:02:41,828 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2022-02-20 22:02:41,828 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2022-02-20 22:02:41,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 22:02:41,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2022-02-20 22:02:41,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2022-02-20 22:02:41,828 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2022-02-20 22:02:41,828 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2022-02-20 22:02:41,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 22:02:41,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 22:02:41,829 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2022-02-20 22:02:41,829 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2022-02-20 22:02:41,829 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-02-20 22:02:41,829 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-02-20 22:02:41,829 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2022-02-20 22:02:41,829 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2022-02-20 22:02:41,829 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2022-02-20 22:02:41,830 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2022-02-20 22:02:41,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 22:02:41,830 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 22:02:41,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 22:02:41,830 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2022-02-20 22:02:41,830 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2022-02-20 22:02:41,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 22:02:41,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 22:02:42,105 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 22:02:42,108 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 22:02:42,280 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 22:02:42,956 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 22:02:42,965 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 22:02:42,966 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 22:02:42,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:02:42 BoogieIcfgContainer [2022-02-20 22:02:42,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 22:02:42,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 22:02:42,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 22:02:42,972 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 22:02:42,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 10:02:40" (1/3) ... [2022-02-20 22:02:42,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dff52dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:02:42, skipping insertion in model container [2022-02-20 22:02:42,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:02:41" (2/3) ... [2022-02-20 22:02:42,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dff52dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:02:42, skipping insertion in model container [2022-02-20 22:02:42,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:02:42" (3/3) ... [2022-02-20 22:02:42,975 INFO L111 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2022-02-20 22:02:42,979 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 22:02:42,980 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 22:02:43,019 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 22:02:43,025 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:02:43,025 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 22:02:43,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 347 states, 258 states have (on average 1.4108527131782946) internal successors, (364), 274 states have internal predecessors, (364), 61 states have call successors, (61), 27 states have call predecessors, (61), 26 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2022-02-20 22:02:43,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 22:02:43,136 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:02:43,137 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:02:43,137 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:02:43,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:02:43,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1909877325, now seen corresponding path program 1 times [2022-02-20 22:02:43,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:02:43,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259961738] [2022-02-20 22:02:43,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:02:43,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:02:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:43,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:02:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:43,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {368#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {350#true} is VALID [2022-02-20 22:02:43,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {350#true} is VALID [2022-02-20 22:02:43,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {350#true} assume true; {350#true} is VALID [2022-02-20 22:02:43,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {350#true} {350#true} #910#return; {350#true} is VALID [2022-02-20 22:02:43,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:02:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:43,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {368#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {350#true} is VALID [2022-02-20 22:02:43,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {350#true} is VALID [2022-02-20 22:02:43,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {350#true} assume true; {350#true} is VALID [2022-02-20 22:02:43,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {350#true} {350#true} #912#return; {350#true} is VALID [2022-02-20 22:02:43,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:02:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:43,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {368#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {350#true} is VALID [2022-02-20 22:02:43,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {350#true} is VALID [2022-02-20 22:02:43,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {350#true} assume true; {350#true} is VALID [2022-02-20 22:02:43,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {350#true} {350#true} #914#return; {350#true} is VALID [2022-02-20 22:02:43,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-20 22:02:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:43,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {350#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset; {350#true} is VALID [2022-02-20 22:02:43,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#true} assume true; {350#true} is VALID [2022-02-20 22:02:43,595 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {350#true} {351#false} #882#return; {351#false} is VALID [2022-02-20 22:02:43,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {350#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(100, 2);call #Ultimate.allocInit(10, 3);call #Ultimate.allocInit(12, 4);call #Ultimate.allocInit(17, 5);call #Ultimate.allocInit(10, 6);call #Ultimate.allocInit(14, 7);call #Ultimate.allocInit(17, 8);call #Ultimate.allocInit(33, 9);call #Ultimate.allocInit(216, 10);call #Ultimate.allocInit(20, 11);call #Ultimate.allocInit(20, 12);call #Ultimate.allocInit(6, 13);call write~init~int(37, 13, 0, 1);call write~init~int(115, 13, 1, 1);call write~init~int(37, 13, 2, 1);call write~init~int(115, 13, 3, 1);call write~init~int(32, 13, 4, 1);call write~init~int(0, 13, 5, 1);call #Ultimate.allocInit(10, 14);call #Ultimate.allocInit(56, 15);call #Ultimate.allocInit(4, 16);call write~init~int(63, 16, 0, 1);call write~init~int(63, 16, 1, 1);call write~init~int(63, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(1, 17);call write~init~int(0, 17, 0, 1);call #Ultimate.allocInit(4, 18);call write~init~int(33, 18, 0, 1);call write~init~int(33, 18, 1, 1);call write~init~int(33, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(1, 19);call write~init~int(0, 19, 0, 1);call #Ultimate.allocInit(51, 20);call #Ultimate.allocInit(4, 21);call write~init~int(9, 21, 0, 1);call write~init~int(37, 21, 1, 1);call write~init~int(115, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(32, 23);call #Ultimate.allocInit(19, 24);call #Ultimate.allocInit(19, 25);call #Ultimate.allocInit(151, 26);call #Ultimate.allocInit(34, 27);call #Ultimate.allocInit(33, 28);call #Ultimate.allocInit(21, 29);call #Ultimate.allocInit(26, 30);call #Ultimate.allocInit(21, 31);call #Ultimate.allocInit(43, 32);call #Ultimate.allocInit(21, 33);call #Ultimate.allocInit(5, 34);call write~init~int(9, 34, 0, 1);call write~init~int(32, 34, 1, 1);call write~init~int(37, 34, 2, 1);call write~init~int(115, 34, 3, 1);call write~init~int(0, 34, 4, 1);call #Ultimate.allocInit(3, 35);call write~init~int(9, 35, 0, 1);call write~init~int(10, 35, 1, 1);call write~init~int(0, 35, 2, 1);call #Ultimate.allocInit(14, 36);call #Ultimate.allocInit(17, 37);call #Ultimate.allocInit(20, 38);call #Ultimate.allocInit(20, 39);call #Ultimate.allocInit(28, 40);call #Ultimate.allocInit(20, 41);call #Ultimate.allocInit(34, 42);call #Ultimate.allocInit(37, 43);call #Ultimate.allocInit(19, 44);call #Ultimate.allocInit(33, 45);call #Ultimate.allocInit(36, 46);~ldv_state_variable_3~0 := 0;~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~nwriters_stress~0 := -1;~onoff_holdoff~0 := 0;~onoff_interval~0 := 0;~shuffle_interval~0 := 3;~shutdown_secs~0 := 0;~stat_interval~0 := 60;~stutter~0 := 5;~verbose~0 := 1;~torture_type~0.base, ~torture_type~0.offset := 3, 0;~#n_lock_torture_errors~0.base, ~#n_lock_torture_errors~0.offset := 47, 0;call #Ultimate.allocInit(4, 47);call write~init~int(0, ~#n_lock_torture_errors~0.base, ~#n_lock_torture_errors~0.offset, 4);~#stats_task~0.base, ~#stats_task~0.offset := 48, 0;call #Ultimate.allocInit(8, 48);call write~init~$Pointer$(0, 0, ~#stats_task~0.base, ~#stats_task~0.offset, 8);~writer_tasks~0.base, ~writer_tasks~0.offset := 0, 0;~nrealwriters_stress~0 := 0;~lock_is_write_held~0 := 0;~lwsa~0.base, ~lwsa~0.offset := 0, 0;~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset := 49, 0;call #Ultimate.allocInit(4, 49);call write~init~int(1, ~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset, 4);~cur_ops~0.base, ~cur_ops~0.offset := 0, 0;~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset := 50, 0;call #Ultimate.allocInit(48, 50);call write~init~$Pointer$(0, 0, ~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_lock.base, #funAddr~torture_lock_busted_write_lock.offset, ~#lock_busted_ops~0.base, 8 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_delay.base, #funAddr~torture_lock_busted_write_delay.offset, ~#lock_busted_ops~0.base, 16 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_unlock.base, #funAddr~torture_lock_busted_write_unlock.offset, ~#lock_busted_ops~0.base, 24 + ~#lock_busted_ops~0.offset, 8);call write~init~int(0, ~#lock_busted_ops~0.base, 32 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(4, 0, ~#lock_busted_ops~0.base, 40 + ~#lock_busted_ops~0.offset, 8);~#torture_spinlock~0.base, ~#torture_spinlock~0.offset := 51, 0;call #Ultimate.allocInit(68, 51);call write~init~int(0, ~#torture_spinlock~0.base, ~#torture_spinlock~0.offset, 4);call write~init~int(3735899821, ~#torture_spinlock~0.base, 4 + ~#torture_spinlock~0.offset, 4);call write~init~int(4294967295, ~#torture_spinlock~0.base, 8 + ~#torture_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#torture_spinlock~0.base, 12 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 20 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 28 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 36 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(5, 0, ~#torture_spinlock~0.base, 44 + ~#torture_spinlock~0.offset, 8);call write~init~int(0, ~#torture_spinlock~0.base, 52 + ~#torture_spinlock~0.offset, 4);call write~init~int(0, ~#torture_spinlock~0.base, 56 + ~#torture_spinlock~0.offset, 8);~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset := 52, 0;call #Ultimate.allocInit(48, 52);call write~init~$Pointer$(0, 0, ~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_lock.base, #funAddr~torture_spin_lock_write_lock.offset, ~#spin_lock_ops~0.base, 8 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_delay.base, #funAddr~torture_spin_lock_write_delay.offset, ~#spin_lock_ops~0.base, 16 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_unlock.base, #funAddr~torture_spin_lock_write_unlock.offset, ~#spin_lock_ops~0.base, 24 + ~#spin_lock_ops~0.offset, 8);call write~init~int(0, ~#spin_lock_ops~0.base, 32 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(6, 0, ~#spin_lock_ops~0.base, 40 + ~#spin_lock_ops~0.offset, 8);~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset := 53, 0;call #Ultimate.allocInit(48, 53);call write~init~$Pointer$(0, 0, ~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_lock_irq.base, #funAddr~torture_spin_lock_write_lock_irq.offset, ~#spin_lock_irq_ops~0.base, 8 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_delay.base, #funAddr~torture_spin_lock_write_delay.offset, ~#spin_lock_irq_ops~0.base, 16 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_spin_write_unlock_irq.base, #funAddr~torture_lock_spin_write_unlock_irq.offset, ~#spin_lock_irq_ops~0.base, 24 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~int(0, ~#spin_lock_irq_ops~0.base, 32 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(7, 0, ~#spin_lock_irq_ops~0.base, 40 + ~#spin_lock_irq_ops~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_spin~0 := 0; {350#true} is VALID [2022-02-20 22:02:43,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret125#1.base, main_#t~ret125#1.offset, main_#t~ret126#1.base, main_#t~ret126#1.offset, main_#t~ret127#1.base, main_#t~ret127#1.offset, main_#t~nondet128#1, main_#t~switch129#1, main_#t~nondet130#1, main_#t~switch131#1, main_#t~ret132#1, main_#t~ret133#1, main_#t~ret134#1, main_#t~nondet135#1, main_#t~switch136#1, main_#t~ret137#1, main_#t~nondet138#1, main_#t~switch139#1, main_#t~ret140#1, main_#t~ret141#1, main_#t~ret142#1, main_#t~nondet143#1, main_#t~switch144#1, main_#t~ret145#1, main_#t~ret146#1, main_#t~ret147#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~13#1.base, main_~tmp~13#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset, main_~tmp___2~3#1, main_~tmp___3~2#1, main_~tmp___4~2#1, main_~tmp___5~1#1, main_~tmp___6~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~13#1.base, main_~tmp~13#1.offset;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;havoc main_~tmp___2~3#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1;havoc main_~tmp___5~1#1;havoc main_~tmp___6~1#1; {350#true} is VALID [2022-02-20 22:02:43,598 INFO L272 TraceCheckUtils]: 2: Hoare triple {350#true} call main_#t~ret125#1.base, main_#t~ret125#1.offset := ldv_zalloc(16); {368#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:43,598 INFO L290 TraceCheckUtils]: 3: Hoare triple {368#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {350#true} is VALID [2022-02-20 22:02:43,598 INFO L290 TraceCheckUtils]: 4: Hoare triple {350#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {350#true} is VALID [2022-02-20 22:02:43,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {350#true} assume true; {350#true} is VALID [2022-02-20 22:02:43,599 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {350#true} {350#true} #910#return; {350#true} is VALID [2022-02-20 22:02:43,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {350#true} main_~tmp~13#1.base, main_~tmp~13#1.offset := main_#t~ret125#1.base, main_#t~ret125#1.offset;havoc main_#t~ret125#1.base, main_#t~ret125#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~13#1.base, main_~tmp~13#1.offset; {350#true} is VALID [2022-02-20 22:02:43,600 INFO L272 TraceCheckUtils]: 8: Hoare triple {350#true} call main_#t~ret126#1.base, main_#t~ret126#1.offset := ldv_zalloc(16); {368#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:43,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {350#true} is VALID [2022-02-20 22:02:43,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {350#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {350#true} is VALID [2022-02-20 22:02:43,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {350#true} assume true; {350#true} is VALID [2022-02-20 22:02:43,601 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {350#true} {350#true} #912#return; {350#true} is VALID [2022-02-20 22:02:43,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {350#true} main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset := main_#t~ret126#1.base, main_#t~ret126#1.offset;havoc main_#t~ret126#1.base, main_#t~ret126#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset; {350#true} is VALID [2022-02-20 22:02:43,602 INFO L272 TraceCheckUtils]: 14: Hoare triple {350#true} call main_#t~ret127#1.base, main_#t~ret127#1.offset := ldv_zalloc(16); {368#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:43,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {368#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {350#true} is VALID [2022-02-20 22:02:43,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {350#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {350#true} is VALID [2022-02-20 22:02:43,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {350#true} assume true; {350#true} is VALID [2022-02-20 22:02:43,603 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {350#true} {350#true} #914#return; {350#true} is VALID [2022-02-20 22:02:43,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {350#true} main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset := main_#t~ret127#1.base, main_#t~ret127#1.offset;havoc main_#t~ret127#1.base, main_#t~ret127#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;assume { :begin_inline_ldv_initialize } true; {350#true} is VALID [2022-02-20 22:02:43,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {350#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {364#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:02:43,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {364#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet128#1 && main_#t~nondet128#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet128#1;havoc main_#t~nondet128#1;main_#t~switch129#1 := 0 == main_~tmp___2~3#1; {364#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:02:43,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {364#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch129#1;main_#t~switch129#1 := main_#t~switch129#1 || 1 == main_~tmp___2~3#1; {364#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:02:43,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {364#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch129#1; {364#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:02:43,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {364#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet135#1 && main_#t~nondet135#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet135#1;havoc main_#t~nondet135#1;main_#t~switch136#1 := 0 == main_~tmp___4~2#1; {364#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:02:43,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {364#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch136#1; {364#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:02:43,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {364#(= ~ldv_state_variable_0~0 1)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0; {351#false} is VALID [2022-02-20 22:02:43,608 INFO L272 TraceCheckUtils]: 27: Hoare triple {351#false} call lock_torture_cleanup(); {351#false} is VALID [2022-02-20 22:02:43,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {351#false} havoc ~i~1#1;havoc ~tmp~11#1;havoc ~tmp___0~8#1;havoc ~tmp___1~2#1;assume { :begin_inline_torture_cleanup } true;havoc torture_cleanup_#res#1;havoc torture_cleanup_#t~nondet164#1;torture_cleanup_#res#1 := torture_cleanup_#t~nondet164#1;havoc torture_cleanup_#t~nondet164#1; {351#false} is VALID [2022-02-20 22:02:43,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {351#false} #t~ret98#1 := torture_cleanup_#res#1;assume { :end_inline_torture_cleanup } true;~tmp~11#1 := #t~ret98#1;havoc #t~ret98#1; {351#false} is VALID [2022-02-20 22:02:43,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {351#false} assume !(0 != ~tmp~11#1 % 256); {351#false} is VALID [2022-02-20 22:02:43,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {351#false} assume !(0 != (~writer_tasks~0.base + ~writer_tasks~0.offset) % 18446744073709551616); {351#false} is VALID [2022-02-20 22:02:43,610 INFO L272 TraceCheckUtils]: 32: Hoare triple {351#false} call _torture_stop_kthread(28, 0, ~#stats_task~0.base, ~#stats_task~0.offset); {350#true} is VALID [2022-02-20 22:02:43,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {350#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset; {350#true} is VALID [2022-02-20 22:02:43,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {350#true} assume true; {350#true} is VALID [2022-02-20 22:02:43,610 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {350#true} {351#false} #882#return; {351#false} is VALID [2022-02-20 22:02:43,611 INFO L272 TraceCheckUtils]: 36: Hoare triple {351#false} call lock_torture_stats_print(); {351#false} is VALID [2022-02-20 22:02:43,611 INFO L290 TraceCheckUtils]: 37: Hoare triple {351#false} havoc ~size~0#1;havoc ~buf~0#1.base, ~buf~0#1.offset;havoc ~tmp~9#1.base, ~tmp~9#1.offset;~size~0#1 := 8192 + 200 * ~nrealwriters_stress~0; {351#false} is VALID [2022-02-20 22:02:43,611 INFO L272 TraceCheckUtils]: 38: Hoare triple {351#false} call #t~ret91#1.base, #t~ret91#1.offset := kmalloc(~size~0#1, 208); {351#false} is VALID [2022-02-20 22:02:43,611 INFO L290 TraceCheckUtils]: 39: Hoare triple {351#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1; {351#false} is VALID [2022-02-20 22:02:43,612 INFO L272 TraceCheckUtils]: 40: Hoare triple {351#false} call ldv_check_alloc_flags(~flags#1); {351#false} is VALID [2022-02-20 22:02:43,612 INFO L290 TraceCheckUtils]: 41: Hoare triple {351#false} ~flags := #in~flags; {351#false} is VALID [2022-02-20 22:02:43,612 INFO L290 TraceCheckUtils]: 42: Hoare triple {351#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {351#false} is VALID [2022-02-20 22:02:43,613 INFO L272 TraceCheckUtils]: 43: Hoare triple {351#false} call ldv_error(); {351#false} is VALID [2022-02-20 22:02:43,613 INFO L290 TraceCheckUtils]: 44: Hoare triple {351#false} assume !false; {351#false} is VALID [2022-02-20 22:02:43,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 22:02:43,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:02:43,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259961738] [2022-02-20 22:02:43,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259961738] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:02:43,615 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:02:43,616 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 22:02:43,617 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289828500] [2022-02-20 22:02:43,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:02:43,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-02-20 22:02:43,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:02:43,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:02:43,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:02:43,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 22:02:43,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:02:43,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 22:02:43,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 22:02:43,712 INFO L87 Difference]: Start difference. First operand has 347 states, 258 states have (on average 1.4108527131782946) internal successors, (364), 274 states have internal predecessors, (364), 61 states have call successors, (61), 27 states have call predecessors, (61), 26 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:02:46,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:02:46,110 INFO L93 Difference]: Finished difference Result 1016 states and 1435 transitions. [2022-02-20 22:02:46,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 22:02:46,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-02-20 22:02:46,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:02:46,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:02:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1435 transitions. [2022-02-20 22:02:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:02:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1435 transitions. [2022-02-20 22:02:46,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1435 transitions. [2022-02-20 22:02:47,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1435 edges. 1435 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:02:47,490 INFO L225 Difference]: With dead ends: 1016 [2022-02-20 22:02:47,491 INFO L226 Difference]: Without dead ends: 571 [2022-02-20 22:02:47,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 22:02:47,499 INFO L933 BasicCegarLoop]: 540 mSDtfsCounter, 595 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 22:02:47,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [639 Valid, 938 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 22:02:47,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-02-20 22:02:47,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 524. [2022-02-20 22:02:47,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:02:47,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 571 states. Second operand has 524 states, 397 states have (on average 1.3778337531486147) internal successors, (547), 408 states have internal predecessors, (547), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-02-20 22:02:47,570 INFO L74 IsIncluded]: Start isIncluded. First operand 571 states. Second operand has 524 states, 397 states have (on average 1.3778337531486147) internal successors, (547), 408 states have internal predecessors, (547), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-02-20 22:02:47,573 INFO L87 Difference]: Start difference. First operand 571 states. Second operand has 524 states, 397 states have (on average 1.3778337531486147) internal successors, (547), 408 states have internal predecessors, (547), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-02-20 22:02:47,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:02:47,604 INFO L93 Difference]: Finished difference Result 571 states and 782 transitions. [2022-02-20 22:02:47,604 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 782 transitions. [2022-02-20 22:02:47,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:02:47,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:02:47,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 524 states, 397 states have (on average 1.3778337531486147) internal successors, (547), 408 states have internal predecessors, (547), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) Second operand 571 states. [2022-02-20 22:02:47,613 INFO L87 Difference]: Start difference. First operand has 524 states, 397 states have (on average 1.3778337531486147) internal successors, (547), 408 states have internal predecessors, (547), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) Second operand 571 states. [2022-02-20 22:02:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:02:47,654 INFO L93 Difference]: Finished difference Result 571 states and 782 transitions. [2022-02-20 22:02:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 782 transitions. [2022-02-20 22:02:47,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:02:47,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:02:47,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:02:47,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:02:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 397 states have (on average 1.3778337531486147) internal successors, (547), 408 states have internal predecessors, (547), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-02-20 22:02:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 714 transitions. [2022-02-20 22:02:47,688 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 714 transitions. Word has length 45 [2022-02-20 22:02:47,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:02:47,689 INFO L470 AbstractCegarLoop]: Abstraction has 524 states and 714 transitions. [2022-02-20 22:02:47,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:02:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 714 transitions. [2022-02-20 22:02:47,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 22:02:47,692 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:02:47,692 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:02:47,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 22:02:47,693 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:02:47,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:02:47,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1822185999, now seen corresponding path program 1 times [2022-02-20 22:02:47,694 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:02:47,694 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068287356] [2022-02-20 22:02:47,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:02:47,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:02:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:47,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:02:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:47,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {3674#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {3655#true} is VALID [2022-02-20 22:02:47,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {3655#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {3655#true} is VALID [2022-02-20 22:02:47,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {3655#true} assume true; {3655#true} is VALID [2022-02-20 22:02:47,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3655#true} {3655#true} #910#return; {3655#true} is VALID [2022-02-20 22:02:47,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:02:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:47,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {3674#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {3655#true} is VALID [2022-02-20 22:02:47,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {3655#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {3655#true} is VALID [2022-02-20 22:02:47,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {3655#true} assume true; {3655#true} is VALID [2022-02-20 22:02:47,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3655#true} {3655#true} #912#return; {3655#true} is VALID [2022-02-20 22:02:47,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:02:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:47,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {3674#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {3655#true} is VALID [2022-02-20 22:02:47,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {3655#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {3655#true} is VALID [2022-02-20 22:02:47,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {3655#true} assume true; {3655#true} is VALID [2022-02-20 22:02:47,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3655#true} {3655#true} #914#return; {3655#true} is VALID [2022-02-20 22:02:47,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-20 22:02:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:47,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {3655#true} ~cur_ops___0.base, ~cur_ops___0.offset := #in~cur_ops___0.base, #in~cur_ops___0.offset;~tag.base, ~tag.offset := #in~tag.base, #in~tag.offset;havoc #t~nondet97; {3655#true} is VALID [2022-02-20 22:02:47,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {3655#true} assume true; {3655#true} is VALID [2022-02-20 22:02:47,810 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3655#true} {3656#false} #934#return; {3656#false} is VALID [2022-02-20 22:02:47,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {3655#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(100, 2);call #Ultimate.allocInit(10, 3);call #Ultimate.allocInit(12, 4);call #Ultimate.allocInit(17, 5);call #Ultimate.allocInit(10, 6);call #Ultimate.allocInit(14, 7);call #Ultimate.allocInit(17, 8);call #Ultimate.allocInit(33, 9);call #Ultimate.allocInit(216, 10);call #Ultimate.allocInit(20, 11);call #Ultimate.allocInit(20, 12);call #Ultimate.allocInit(6, 13);call write~init~int(37, 13, 0, 1);call write~init~int(115, 13, 1, 1);call write~init~int(37, 13, 2, 1);call write~init~int(115, 13, 3, 1);call write~init~int(32, 13, 4, 1);call write~init~int(0, 13, 5, 1);call #Ultimate.allocInit(10, 14);call #Ultimate.allocInit(56, 15);call #Ultimate.allocInit(4, 16);call write~init~int(63, 16, 0, 1);call write~init~int(63, 16, 1, 1);call write~init~int(63, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(1, 17);call write~init~int(0, 17, 0, 1);call #Ultimate.allocInit(4, 18);call write~init~int(33, 18, 0, 1);call write~init~int(33, 18, 1, 1);call write~init~int(33, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(1, 19);call write~init~int(0, 19, 0, 1);call #Ultimate.allocInit(51, 20);call #Ultimate.allocInit(4, 21);call write~init~int(9, 21, 0, 1);call write~init~int(37, 21, 1, 1);call write~init~int(115, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(32, 23);call #Ultimate.allocInit(19, 24);call #Ultimate.allocInit(19, 25);call #Ultimate.allocInit(151, 26);call #Ultimate.allocInit(34, 27);call #Ultimate.allocInit(33, 28);call #Ultimate.allocInit(21, 29);call #Ultimate.allocInit(26, 30);call #Ultimate.allocInit(21, 31);call #Ultimate.allocInit(43, 32);call #Ultimate.allocInit(21, 33);call #Ultimate.allocInit(5, 34);call write~init~int(9, 34, 0, 1);call write~init~int(32, 34, 1, 1);call write~init~int(37, 34, 2, 1);call write~init~int(115, 34, 3, 1);call write~init~int(0, 34, 4, 1);call #Ultimate.allocInit(3, 35);call write~init~int(9, 35, 0, 1);call write~init~int(10, 35, 1, 1);call write~init~int(0, 35, 2, 1);call #Ultimate.allocInit(14, 36);call #Ultimate.allocInit(17, 37);call #Ultimate.allocInit(20, 38);call #Ultimate.allocInit(20, 39);call #Ultimate.allocInit(28, 40);call #Ultimate.allocInit(20, 41);call #Ultimate.allocInit(34, 42);call #Ultimate.allocInit(37, 43);call #Ultimate.allocInit(19, 44);call #Ultimate.allocInit(33, 45);call #Ultimate.allocInit(36, 46);~ldv_state_variable_3~0 := 0;~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~nwriters_stress~0 := -1;~onoff_holdoff~0 := 0;~onoff_interval~0 := 0;~shuffle_interval~0 := 3;~shutdown_secs~0 := 0;~stat_interval~0 := 60;~stutter~0 := 5;~verbose~0 := 1;~torture_type~0.base, ~torture_type~0.offset := 3, 0;~#n_lock_torture_errors~0.base, ~#n_lock_torture_errors~0.offset := 47, 0;call #Ultimate.allocInit(4, 47);call write~init~int(0, ~#n_lock_torture_errors~0.base, ~#n_lock_torture_errors~0.offset, 4);~#stats_task~0.base, ~#stats_task~0.offset := 48, 0;call #Ultimate.allocInit(8, 48);call write~init~$Pointer$(0, 0, ~#stats_task~0.base, ~#stats_task~0.offset, 8);~writer_tasks~0.base, ~writer_tasks~0.offset := 0, 0;~nrealwriters_stress~0 := 0;~lock_is_write_held~0 := 0;~lwsa~0.base, ~lwsa~0.offset := 0, 0;~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset := 49, 0;call #Ultimate.allocInit(4, 49);call write~init~int(1, ~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset, 4);~cur_ops~0.base, ~cur_ops~0.offset := 0, 0;~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset := 50, 0;call #Ultimate.allocInit(48, 50);call write~init~$Pointer$(0, 0, ~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_lock.base, #funAddr~torture_lock_busted_write_lock.offset, ~#lock_busted_ops~0.base, 8 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_delay.base, #funAddr~torture_lock_busted_write_delay.offset, ~#lock_busted_ops~0.base, 16 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_unlock.base, #funAddr~torture_lock_busted_write_unlock.offset, ~#lock_busted_ops~0.base, 24 + ~#lock_busted_ops~0.offset, 8);call write~init~int(0, ~#lock_busted_ops~0.base, 32 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(4, 0, ~#lock_busted_ops~0.base, 40 + ~#lock_busted_ops~0.offset, 8);~#torture_spinlock~0.base, ~#torture_spinlock~0.offset := 51, 0;call #Ultimate.allocInit(68, 51);call write~init~int(0, ~#torture_spinlock~0.base, ~#torture_spinlock~0.offset, 4);call write~init~int(3735899821, ~#torture_spinlock~0.base, 4 + ~#torture_spinlock~0.offset, 4);call write~init~int(4294967295, ~#torture_spinlock~0.base, 8 + ~#torture_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#torture_spinlock~0.base, 12 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 20 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 28 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 36 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(5, 0, ~#torture_spinlock~0.base, 44 + ~#torture_spinlock~0.offset, 8);call write~init~int(0, ~#torture_spinlock~0.base, 52 + ~#torture_spinlock~0.offset, 4);call write~init~int(0, ~#torture_spinlock~0.base, 56 + ~#torture_spinlock~0.offset, 8);~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset := 52, 0;call #Ultimate.allocInit(48, 52);call write~init~$Pointer$(0, 0, ~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_lock.base, #funAddr~torture_spin_lock_write_lock.offset, ~#spin_lock_ops~0.base, 8 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_delay.base, #funAddr~torture_spin_lock_write_delay.offset, ~#spin_lock_ops~0.base, 16 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_unlock.base, #funAddr~torture_spin_lock_write_unlock.offset, ~#spin_lock_ops~0.base, 24 + ~#spin_lock_ops~0.offset, 8);call write~init~int(0, ~#spin_lock_ops~0.base, 32 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(6, 0, ~#spin_lock_ops~0.base, 40 + ~#spin_lock_ops~0.offset, 8);~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset := 53, 0;call #Ultimate.allocInit(48, 53);call write~init~$Pointer$(0, 0, ~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_lock_irq.base, #funAddr~torture_spin_lock_write_lock_irq.offset, ~#spin_lock_irq_ops~0.base, 8 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_delay.base, #funAddr~torture_spin_lock_write_delay.offset, ~#spin_lock_irq_ops~0.base, 16 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_spin_write_unlock_irq.base, #funAddr~torture_lock_spin_write_unlock_irq.offset, ~#spin_lock_irq_ops~0.base, 24 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~int(0, ~#spin_lock_irq_ops~0.base, 32 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(7, 0, ~#spin_lock_irq_ops~0.base, 40 + ~#spin_lock_irq_ops~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_spin~0 := 0; {3655#true} is VALID [2022-02-20 22:02:47,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {3655#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret125#1.base, main_#t~ret125#1.offset, main_#t~ret126#1.base, main_#t~ret126#1.offset, main_#t~ret127#1.base, main_#t~ret127#1.offset, main_#t~nondet128#1, main_#t~switch129#1, main_#t~nondet130#1, main_#t~switch131#1, main_#t~ret132#1, main_#t~ret133#1, main_#t~ret134#1, main_#t~nondet135#1, main_#t~switch136#1, main_#t~ret137#1, main_#t~nondet138#1, main_#t~switch139#1, main_#t~ret140#1, main_#t~ret141#1, main_#t~ret142#1, main_#t~nondet143#1, main_#t~switch144#1, main_#t~ret145#1, main_#t~ret146#1, main_#t~ret147#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~13#1.base, main_~tmp~13#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset, main_~tmp___2~3#1, main_~tmp___3~2#1, main_~tmp___4~2#1, main_~tmp___5~1#1, main_~tmp___6~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~13#1.base, main_~tmp~13#1.offset;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;havoc main_~tmp___2~3#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1;havoc main_~tmp___5~1#1;havoc main_~tmp___6~1#1; {3655#true} is VALID [2022-02-20 22:02:47,812 INFO L272 TraceCheckUtils]: 2: Hoare triple {3655#true} call main_#t~ret125#1.base, main_#t~ret125#1.offset := ldv_zalloc(16); {3674#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:47,812 INFO L290 TraceCheckUtils]: 3: Hoare triple {3674#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {3655#true} is VALID [2022-02-20 22:02:47,812 INFO L290 TraceCheckUtils]: 4: Hoare triple {3655#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {3655#true} is VALID [2022-02-20 22:02:47,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {3655#true} assume true; {3655#true} is VALID [2022-02-20 22:02:47,813 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3655#true} {3655#true} #910#return; {3655#true} is VALID [2022-02-20 22:02:47,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {3655#true} main_~tmp~13#1.base, main_~tmp~13#1.offset := main_#t~ret125#1.base, main_#t~ret125#1.offset;havoc main_#t~ret125#1.base, main_#t~ret125#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~13#1.base, main_~tmp~13#1.offset; {3655#true} is VALID [2022-02-20 22:02:47,814 INFO L272 TraceCheckUtils]: 8: Hoare triple {3655#true} call main_#t~ret126#1.base, main_#t~ret126#1.offset := ldv_zalloc(16); {3674#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:47,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {3674#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {3655#true} is VALID [2022-02-20 22:02:47,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {3655#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {3655#true} is VALID [2022-02-20 22:02:47,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {3655#true} assume true; {3655#true} is VALID [2022-02-20 22:02:47,815 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3655#true} {3655#true} #912#return; {3655#true} is VALID [2022-02-20 22:02:47,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {3655#true} main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset := main_#t~ret126#1.base, main_#t~ret126#1.offset;havoc main_#t~ret126#1.base, main_#t~ret126#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset; {3655#true} is VALID [2022-02-20 22:02:47,816 INFO L272 TraceCheckUtils]: 14: Hoare triple {3655#true} call main_#t~ret127#1.base, main_#t~ret127#1.offset := ldv_zalloc(16); {3674#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:47,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {3674#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {3655#true} is VALID [2022-02-20 22:02:47,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {3655#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {3655#true} is VALID [2022-02-20 22:02:47,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {3655#true} assume true; {3655#true} is VALID [2022-02-20 22:02:47,816 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3655#true} {3655#true} #914#return; {3655#true} is VALID [2022-02-20 22:02:47,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {3655#true} main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset := main_#t~ret127#1.base, main_#t~ret127#1.offset;havoc main_#t~ret127#1.base, main_#t~ret127#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;assume { :begin_inline_ldv_initialize } true; {3655#true} is VALID [2022-02-20 22:02:47,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {3655#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {3669#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:02:47,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {3669#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet128#1 && main_#t~nondet128#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet128#1;havoc main_#t~nondet128#1;main_#t~switch129#1 := 0 == main_~tmp___2~3#1; {3669#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:02:47,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {3669#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch129#1;main_#t~switch129#1 := main_#t~switch129#1 || 1 == main_~tmp___2~3#1; {3669#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:02:47,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {3669#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch129#1; {3669#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:02:47,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {3669#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet135#1 && main_#t~nondet135#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet135#1;havoc main_#t~nondet135#1;main_#t~switch136#1 := 0 == main_~tmp___4~2#1; {3655#true} is VALID [2022-02-20 22:02:47,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {3655#true} assume !main_#t~switch136#1;main_#t~switch136#1 := main_#t~switch136#1 || 1 == main_~tmp___4~2#1; {3655#true} is VALID [2022-02-20 22:02:47,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {3655#true} assume main_#t~switch136#1; {3655#true} is VALID [2022-02-20 22:02:47,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {3655#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_lock_torture_init } true;havoc lock_torture_init_#res#1;havoc lock_torture_init_#t~ret101#1, lock_torture_init_#t~mem102#1.base, lock_torture_init_#t~mem102#1.offset, lock_torture_init_#t~mem103#1.base, lock_torture_init_#t~mem103#1.offset, lock_torture_init_#t~nondet104#1, lock_torture_init_#t~nondet105#1, lock_torture_init_#t~nondet106#1, lock_torture_init_#t~nondet107#1, lock_torture_init_#t~mem108#1.base, lock_torture_init_#t~mem108#1.offset, lock_torture_init_#t~mem109#1.base, lock_torture_init_#t~mem109#1.offset, lock_torture_init_#t~nondet110#1, lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset, lock_torture_init_#t~mem113#1.base, lock_torture_init_#t~mem113#1.offset, lock_torture_init_#t~ret114#1, lock_torture_init_#t~ret115#1.base, lock_torture_init_#t~ret115#1.offset, lock_torture_init_#t~nondet116#1, lock_torture_init_#t~ret117#1, lock_torture_init_#t~ret118#1, lock_torture_init_#t~ret119#1, lock_torture_init_#t~ret120#1, lock_torture_init_#t~ret121#1.base, lock_torture_init_#t~ret121#1.offset, lock_torture_init_#t~nondet122#1, lock_torture_init_#t~ret123#1, lock_torture_init_#t~ret124#1, lock_torture_init_~i~2#1, lock_torture_init_~firsterr~0#1, lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset, lock_torture_init_~tmp~12#1, lock_torture_init_~tmp___0~9#1, lock_torture_init_~tmp___1~3#1, lock_torture_init_~tmp___2~2#1, lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset, lock_torture_init_~tmp___4~1#1.base, lock_torture_init_~tmp___4~1#1.offset;havoc lock_torture_init_~i~2#1;havoc lock_torture_init_~firsterr~0#1;call lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset := #Ultimate.allocOnStack(24);havoc lock_torture_init_~tmp~12#1;havoc lock_torture_init_~tmp___0~9#1;havoc lock_torture_init_~tmp___1~3#1;havoc lock_torture_init_~tmp___2~2#1;havoc lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset;havoc lock_torture_init_~tmp___4~1#1.base, lock_torture_init_~tmp___4~1#1.offset;lock_torture_init_~firsterr~0#1 := 0;call write~$Pointer$(~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset, 8);call write~$Pointer$(~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, 8 + lock_torture_init_~#torture_ops~0#1.offset, 8);call write~$Pointer$(~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, 16 + lock_torture_init_~#torture_ops~0#1.offset, 8);assume { :begin_inline_torture_init_begin } true;torture_init_begin_#in~arg0#1.base, torture_init_begin_#in~arg0#1.offset, torture_init_begin_#in~arg1#1, torture_init_begin_#in~arg2#1.base, torture_init_begin_#in~arg2#1.offset := ~torture_type~0.base, ~torture_type~0.offset, (if 0 == ~verbose~0 % 256 then 0 else 1), ~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset;havoc torture_init_begin_#res#1;havoc torture_init_begin_#t~nondet165#1, torture_init_begin_~arg0#1.base, torture_init_begin_~arg0#1.offset, torture_init_begin_~arg1#1, torture_init_begin_~arg2#1.base, torture_init_begin_~arg2#1.offset;torture_init_begin_~arg0#1.base, torture_init_begin_~arg0#1.offset := torture_init_begin_#in~arg0#1.base, torture_init_begin_#in~arg0#1.offset;torture_init_begin_~arg1#1 := torture_init_begin_#in~arg1#1;torture_init_begin_~arg2#1.base, torture_init_begin_~arg2#1.offset := torture_init_begin_#in~arg2#1.base, torture_init_begin_#in~arg2#1.offset;torture_init_begin_#res#1 := torture_init_begin_#t~nondet165#1;havoc torture_init_begin_#t~nondet165#1; {3655#true} is VALID [2022-02-20 22:02:47,820 INFO L290 TraceCheckUtils]: 28: Hoare triple {3655#true} lock_torture_init_#t~ret101#1 := torture_init_begin_#res#1;assume { :end_inline_torture_init_begin } true;lock_torture_init_~tmp~12#1 := lock_torture_init_#t~ret101#1;havoc lock_torture_init_#t~ret101#1; {3655#true} is VALID [2022-02-20 22:02:47,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {3655#true} assume !(0 != lock_torture_init_~tmp~12#1 % 256);lock_torture_init_~tmp___0~9#1 := 1; {3670#(not (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0))} is VALID [2022-02-20 22:02:47,821 INFO L290 TraceCheckUtils]: 30: Hoare triple {3670#(not (= |ULTIMATE.start_lock_torture_init_~tmp___0~9#1| 0))} assume !(0 != lock_torture_init_~tmp___0~9#1);lock_torture_init_~i~2#1 := 0; {3656#false} is VALID [2022-02-20 22:02:47,821 INFO L290 TraceCheckUtils]: 31: Hoare triple {3656#false} assume !(lock_torture_init_~i~2#1 % 4294967296 <= 2); {3656#false} is VALID [2022-02-20 22:02:47,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {3656#false} assume !(3 == lock_torture_init_~i~2#1);call lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset := read~$Pointer$(~cur_ops~0.base, ~cur_ops~0.offset, 8); {3656#false} is VALID [2022-02-20 22:02:47,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {3656#false} assume !(0 != (lock_torture_init_#t~mem111#1.base + lock_torture_init_#t~mem111#1.offset) % 18446744073709551616);havoc lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset; {3656#false} is VALID [2022-02-20 22:02:47,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {3656#false} assume ~nwriters_stress~0 >= 0;~nrealwriters_stress~0 := ~nwriters_stress~0; {3656#false} is VALID [2022-02-20 22:02:47,822 INFO L272 TraceCheckUtils]: 35: Hoare triple {3656#false} call lock_torture_print_module_parms(~cur_ops~0.base, ~cur_ops~0.offset, 36, 0); {3655#true} is VALID [2022-02-20 22:02:47,822 INFO L290 TraceCheckUtils]: 36: Hoare triple {3655#true} ~cur_ops___0.base, ~cur_ops___0.offset := #in~cur_ops___0.base, #in~cur_ops___0.offset;~tag.base, ~tag.offset := #in~tag.base, #in~tag.offset;havoc #t~nondet97; {3655#true} is VALID [2022-02-20 22:02:47,822 INFO L290 TraceCheckUtils]: 37: Hoare triple {3655#true} assume true; {3655#true} is VALID [2022-02-20 22:02:47,823 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3655#true} {3656#false} #934#return; {3656#false} is VALID [2022-02-20 22:02:47,823 INFO L290 TraceCheckUtils]: 39: Hoare triple {3656#false} ~lock_is_write_held~0 := 0; {3656#false} is VALID [2022-02-20 22:02:47,823 INFO L272 TraceCheckUtils]: 40: Hoare triple {3656#false} call lock_torture_init_#t~ret115#1.base, lock_torture_init_#t~ret115#1.offset := kmalloc(16 * ~nrealwriters_stress~0, 208); {3656#false} is VALID [2022-02-20 22:02:47,823 INFO L290 TraceCheckUtils]: 41: Hoare triple {3656#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1; {3656#false} is VALID [2022-02-20 22:02:47,823 INFO L272 TraceCheckUtils]: 42: Hoare triple {3656#false} call ldv_check_alloc_flags(~flags#1); {3656#false} is VALID [2022-02-20 22:02:47,824 INFO L290 TraceCheckUtils]: 43: Hoare triple {3656#false} ~flags := #in~flags; {3656#false} is VALID [2022-02-20 22:02:47,824 INFO L290 TraceCheckUtils]: 44: Hoare triple {3656#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {3656#false} is VALID [2022-02-20 22:02:47,824 INFO L272 TraceCheckUtils]: 45: Hoare triple {3656#false} call ldv_error(); {3656#false} is VALID [2022-02-20 22:02:47,824 INFO L290 TraceCheckUtils]: 46: Hoare triple {3656#false} assume !false; {3656#false} is VALID [2022-02-20 22:02:47,825 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 22:02:47,825 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:02:47,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068287356] [2022-02-20 22:02:47,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068287356] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:02:47,826 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:02:47,826 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 22:02:47,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051243179] [2022-02-20 22:02:47,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:02:47,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-02-20 22:02:47,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:02:47,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:02:47,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:02:47,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 22:02:47,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:02:47,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 22:02:47,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 22:02:47,862 INFO L87 Difference]: Start difference. First operand 524 states and 714 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:02:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:02:50,735 INFO L93 Difference]: Finished difference Result 1271 states and 1794 transitions. [2022-02-20 22:02:50,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 22:02:50,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-02-20 22:02:50,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:02:50,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:02:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1542 transitions. [2022-02-20 22:02:50,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:02:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1542 transitions. [2022-02-20 22:02:50,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1542 transitions. [2022-02-20 22:02:51,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1542 edges. 1542 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:02:51,900 INFO L225 Difference]: With dead ends: 1271 [2022-02-20 22:02:51,900 INFO L226 Difference]: Without dead ends: 767 [2022-02-20 22:02:51,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 22:02:51,903 INFO L933 BasicCegarLoop]: 761 mSDtfsCounter, 721 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 22:02:51,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [776 Valid, 1687 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 22:02:51,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2022-02-20 22:02:51,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 525. [2022-02-20 22:02:51,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:02:51,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 767 states. Second operand has 525 states, 398 states have (on average 1.3768844221105527) internal successors, (548), 409 states have internal predecessors, (548), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-02-20 22:02:51,933 INFO L74 IsIncluded]: Start isIncluded. First operand 767 states. Second operand has 525 states, 398 states have (on average 1.3768844221105527) internal successors, (548), 409 states have internal predecessors, (548), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-02-20 22:02:51,934 INFO L87 Difference]: Start difference. First operand 767 states. Second operand has 525 states, 398 states have (on average 1.3768844221105527) internal successors, (548), 409 states have internal predecessors, (548), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-02-20 22:02:51,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:02:51,970 INFO L93 Difference]: Finished difference Result 767 states and 1102 transitions. [2022-02-20 22:02:51,970 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1102 transitions. [2022-02-20 22:02:51,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:02:51,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:02:51,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 525 states, 398 states have (on average 1.3768844221105527) internal successors, (548), 409 states have internal predecessors, (548), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) Second operand 767 states. [2022-02-20 22:02:51,976 INFO L87 Difference]: Start difference. First operand has 525 states, 398 states have (on average 1.3768844221105527) internal successors, (548), 409 states have internal predecessors, (548), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) Second operand 767 states. [2022-02-20 22:02:52,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:02:52,012 INFO L93 Difference]: Finished difference Result 767 states and 1102 transitions. [2022-02-20 22:02:52,012 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1102 transitions. [2022-02-20 22:02:52,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:02:52,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:02:52,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:02:52,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:02:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 398 states have (on average 1.3768844221105527) internal successors, (548), 409 states have internal predecessors, (548), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-02-20 22:02:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 715 transitions. [2022-02-20 22:02:52,040 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 715 transitions. Word has length 47 [2022-02-20 22:02:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:02:52,041 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 715 transitions. [2022-02-20 22:02:52,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:02:52,042 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 715 transitions. [2022-02-20 22:02:52,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 22:02:52,045 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:02:52,046 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:02:52,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 22:02:52,046 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:02:52,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:02:52,049 INFO L85 PathProgramCache]: Analyzing trace with hash -478636591, now seen corresponding path program 1 times [2022-02-20 22:02:52,049 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:02:52,049 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200188381] [2022-02-20 22:02:52,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:02:52,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:02:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:52,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:02:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:52,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {7688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {7670#true} is VALID [2022-02-20 22:02:52,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {7670#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {7670#true} is VALID [2022-02-20 22:02:52,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {7670#true} assume true; {7670#true} is VALID [2022-02-20 22:02:52,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7670#true} {7672#(<= (+ ~nwriters_stress~0 1) 0)} #910#return; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:02:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:52,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {7688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {7670#true} is VALID [2022-02-20 22:02:52,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {7670#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {7670#true} is VALID [2022-02-20 22:02:52,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {7670#true} assume true; {7670#true} is VALID [2022-02-20 22:02:52,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7670#true} {7672#(<= (+ ~nwriters_stress~0 1) 0)} #912#return; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:02:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:52,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {7688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {7670#true} is VALID [2022-02-20 22:02:52,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {7670#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {7670#true} is VALID [2022-02-20 22:02:52,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {7670#true} assume true; {7670#true} is VALID [2022-02-20 22:02:52,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7670#true} {7672#(<= (+ ~nwriters_stress~0 1) 0)} #914#return; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-20 22:02:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:52,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {7670#true} ~cur_ops___0.base, ~cur_ops___0.offset := #in~cur_ops___0.base, #in~cur_ops___0.offset;~tag.base, ~tag.offset := #in~tag.base, #in~tag.offset;havoc #t~nondet97; {7670#true} is VALID [2022-02-20 22:02:52,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {7670#true} assume true; {7670#true} is VALID [2022-02-20 22:02:52,224 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7670#true} {7671#false} #934#return; {7671#false} is VALID [2022-02-20 22:02:52,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {7670#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(100, 2);call #Ultimate.allocInit(10, 3);call #Ultimate.allocInit(12, 4);call #Ultimate.allocInit(17, 5);call #Ultimate.allocInit(10, 6);call #Ultimate.allocInit(14, 7);call #Ultimate.allocInit(17, 8);call #Ultimate.allocInit(33, 9);call #Ultimate.allocInit(216, 10);call #Ultimate.allocInit(20, 11);call #Ultimate.allocInit(20, 12);call #Ultimate.allocInit(6, 13);call write~init~int(37, 13, 0, 1);call write~init~int(115, 13, 1, 1);call write~init~int(37, 13, 2, 1);call write~init~int(115, 13, 3, 1);call write~init~int(32, 13, 4, 1);call write~init~int(0, 13, 5, 1);call #Ultimate.allocInit(10, 14);call #Ultimate.allocInit(56, 15);call #Ultimate.allocInit(4, 16);call write~init~int(63, 16, 0, 1);call write~init~int(63, 16, 1, 1);call write~init~int(63, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(1, 17);call write~init~int(0, 17, 0, 1);call #Ultimate.allocInit(4, 18);call write~init~int(33, 18, 0, 1);call write~init~int(33, 18, 1, 1);call write~init~int(33, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(1, 19);call write~init~int(0, 19, 0, 1);call #Ultimate.allocInit(51, 20);call #Ultimate.allocInit(4, 21);call write~init~int(9, 21, 0, 1);call write~init~int(37, 21, 1, 1);call write~init~int(115, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(32, 23);call #Ultimate.allocInit(19, 24);call #Ultimate.allocInit(19, 25);call #Ultimate.allocInit(151, 26);call #Ultimate.allocInit(34, 27);call #Ultimate.allocInit(33, 28);call #Ultimate.allocInit(21, 29);call #Ultimate.allocInit(26, 30);call #Ultimate.allocInit(21, 31);call #Ultimate.allocInit(43, 32);call #Ultimate.allocInit(21, 33);call #Ultimate.allocInit(5, 34);call write~init~int(9, 34, 0, 1);call write~init~int(32, 34, 1, 1);call write~init~int(37, 34, 2, 1);call write~init~int(115, 34, 3, 1);call write~init~int(0, 34, 4, 1);call #Ultimate.allocInit(3, 35);call write~init~int(9, 35, 0, 1);call write~init~int(10, 35, 1, 1);call write~init~int(0, 35, 2, 1);call #Ultimate.allocInit(14, 36);call #Ultimate.allocInit(17, 37);call #Ultimate.allocInit(20, 38);call #Ultimate.allocInit(20, 39);call #Ultimate.allocInit(28, 40);call #Ultimate.allocInit(20, 41);call #Ultimate.allocInit(34, 42);call #Ultimate.allocInit(37, 43);call #Ultimate.allocInit(19, 44);call #Ultimate.allocInit(33, 45);call #Ultimate.allocInit(36, 46);~ldv_state_variable_3~0 := 0;~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~nwriters_stress~0 := -1;~onoff_holdoff~0 := 0;~onoff_interval~0 := 0;~shuffle_interval~0 := 3;~shutdown_secs~0 := 0;~stat_interval~0 := 60;~stutter~0 := 5;~verbose~0 := 1;~torture_type~0.base, ~torture_type~0.offset := 3, 0;~#n_lock_torture_errors~0.base, ~#n_lock_torture_errors~0.offset := 47, 0;call #Ultimate.allocInit(4, 47);call write~init~int(0, ~#n_lock_torture_errors~0.base, ~#n_lock_torture_errors~0.offset, 4);~#stats_task~0.base, ~#stats_task~0.offset := 48, 0;call #Ultimate.allocInit(8, 48);call write~init~$Pointer$(0, 0, ~#stats_task~0.base, ~#stats_task~0.offset, 8);~writer_tasks~0.base, ~writer_tasks~0.offset := 0, 0;~nrealwriters_stress~0 := 0;~lock_is_write_held~0 := 0;~lwsa~0.base, ~lwsa~0.offset := 0, 0;~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset := 49, 0;call #Ultimate.allocInit(4, 49);call write~init~int(1, ~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset, 4);~cur_ops~0.base, ~cur_ops~0.offset := 0, 0;~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset := 50, 0;call #Ultimate.allocInit(48, 50);call write~init~$Pointer$(0, 0, ~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_lock.base, #funAddr~torture_lock_busted_write_lock.offset, ~#lock_busted_ops~0.base, 8 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_delay.base, #funAddr~torture_lock_busted_write_delay.offset, ~#lock_busted_ops~0.base, 16 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_unlock.base, #funAddr~torture_lock_busted_write_unlock.offset, ~#lock_busted_ops~0.base, 24 + ~#lock_busted_ops~0.offset, 8);call write~init~int(0, ~#lock_busted_ops~0.base, 32 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(4, 0, ~#lock_busted_ops~0.base, 40 + ~#lock_busted_ops~0.offset, 8);~#torture_spinlock~0.base, ~#torture_spinlock~0.offset := 51, 0;call #Ultimate.allocInit(68, 51);call write~init~int(0, ~#torture_spinlock~0.base, ~#torture_spinlock~0.offset, 4);call write~init~int(3735899821, ~#torture_spinlock~0.base, 4 + ~#torture_spinlock~0.offset, 4);call write~init~int(4294967295, ~#torture_spinlock~0.base, 8 + ~#torture_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#torture_spinlock~0.base, 12 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 20 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 28 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 36 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(5, 0, ~#torture_spinlock~0.base, 44 + ~#torture_spinlock~0.offset, 8);call write~init~int(0, ~#torture_spinlock~0.base, 52 + ~#torture_spinlock~0.offset, 4);call write~init~int(0, ~#torture_spinlock~0.base, 56 + ~#torture_spinlock~0.offset, 8);~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset := 52, 0;call #Ultimate.allocInit(48, 52);call write~init~$Pointer$(0, 0, ~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_lock.base, #funAddr~torture_spin_lock_write_lock.offset, ~#spin_lock_ops~0.base, 8 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_delay.base, #funAddr~torture_spin_lock_write_delay.offset, ~#spin_lock_ops~0.base, 16 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_unlock.base, #funAddr~torture_spin_lock_write_unlock.offset, ~#spin_lock_ops~0.base, 24 + ~#spin_lock_ops~0.offset, 8);call write~init~int(0, ~#spin_lock_ops~0.base, 32 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(6, 0, ~#spin_lock_ops~0.base, 40 + ~#spin_lock_ops~0.offset, 8);~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset := 53, 0;call #Ultimate.allocInit(48, 53);call write~init~$Pointer$(0, 0, ~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_lock_irq.base, #funAddr~torture_spin_lock_write_lock_irq.offset, ~#spin_lock_irq_ops~0.base, 8 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_delay.base, #funAddr~torture_spin_lock_write_delay.offset, ~#spin_lock_irq_ops~0.base, 16 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_spin_write_unlock_irq.base, #funAddr~torture_lock_spin_write_unlock_irq.offset, ~#spin_lock_irq_ops~0.base, 24 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~int(0, ~#spin_lock_irq_ops~0.base, 32 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(7, 0, ~#spin_lock_irq_ops~0.base, 40 + ~#spin_lock_irq_ops~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_spin~0 := 0; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret125#1.base, main_#t~ret125#1.offset, main_#t~ret126#1.base, main_#t~ret126#1.offset, main_#t~ret127#1.base, main_#t~ret127#1.offset, main_#t~nondet128#1, main_#t~switch129#1, main_#t~nondet130#1, main_#t~switch131#1, main_#t~ret132#1, main_#t~ret133#1, main_#t~ret134#1, main_#t~nondet135#1, main_#t~switch136#1, main_#t~ret137#1, main_#t~nondet138#1, main_#t~switch139#1, main_#t~ret140#1, main_#t~ret141#1, main_#t~ret142#1, main_#t~nondet143#1, main_#t~switch144#1, main_#t~ret145#1, main_#t~ret146#1, main_#t~ret147#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~13#1.base, main_~tmp~13#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset, main_~tmp___2~3#1, main_~tmp___3~2#1, main_~tmp___4~2#1, main_~tmp___5~1#1, main_~tmp___6~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~13#1.base, main_~tmp~13#1.offset;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;havoc main_~tmp___2~3#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1;havoc main_~tmp___5~1#1;havoc main_~tmp___6~1#1; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,231 INFO L272 TraceCheckUtils]: 2: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} call main_#t~ret125#1.base, main_#t~ret125#1.offset := ldv_zalloc(16); {7688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:52,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {7688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {7670#true} is VALID [2022-02-20 22:02:52,231 INFO L290 TraceCheckUtils]: 4: Hoare triple {7670#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {7670#true} is VALID [2022-02-20 22:02:52,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {7670#true} assume true; {7670#true} is VALID [2022-02-20 22:02:52,232 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7670#true} {7672#(<= (+ ~nwriters_stress~0 1) 0)} #910#return; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} main_~tmp~13#1.base, main_~tmp~13#1.offset := main_#t~ret125#1.base, main_#t~ret125#1.offset;havoc main_#t~ret125#1.base, main_#t~ret125#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~13#1.base, main_~tmp~13#1.offset; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,233 INFO L272 TraceCheckUtils]: 8: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} call main_#t~ret126#1.base, main_#t~ret126#1.offset := ldv_zalloc(16); {7688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:52,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {7688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {7670#true} is VALID [2022-02-20 22:02:52,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {7670#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {7670#true} is VALID [2022-02-20 22:02:52,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {7670#true} assume true; {7670#true} is VALID [2022-02-20 22:02:52,235 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7670#true} {7672#(<= (+ ~nwriters_stress~0 1) 0)} #912#return; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset := main_#t~ret126#1.base, main_#t~ret126#1.offset;havoc main_#t~ret126#1.base, main_#t~ret126#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,236 INFO L272 TraceCheckUtils]: 14: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} call main_#t~ret127#1.base, main_#t~ret127#1.offset := ldv_zalloc(16); {7688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:52,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {7688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {7670#true} is VALID [2022-02-20 22:02:52,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {7670#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {7670#true} is VALID [2022-02-20 22:02:52,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {7670#true} assume true; {7670#true} is VALID [2022-02-20 22:02:52,237 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7670#true} {7672#(<= (+ ~nwriters_stress~0 1) 0)} #914#return; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset := main_#t~ret127#1.base, main_#t~ret127#1.offset;havoc main_#t~ret127#1.base, main_#t~ret127#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;assume { :begin_inline_ldv_initialize } true; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} assume -2147483648 <= main_#t~nondet128#1 && main_#t~nondet128#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet128#1;havoc main_#t~nondet128#1;main_#t~switch129#1 := 0 == main_~tmp___2~3#1; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} assume !main_#t~switch129#1;main_#t~switch129#1 := main_#t~switch129#1 || 1 == main_~tmp___2~3#1; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} assume main_#t~switch129#1; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet135#1 && main_#t~nondet135#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet135#1;havoc main_#t~nondet135#1;main_#t~switch136#1 := 0 == main_~tmp___4~2#1; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} assume !main_#t~switch136#1;main_#t~switch136#1 := main_#t~switch136#1 || 1 == main_~tmp___4~2#1; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} assume main_#t~switch136#1; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_lock_torture_init } true;havoc lock_torture_init_#res#1;havoc lock_torture_init_#t~ret101#1, lock_torture_init_#t~mem102#1.base, lock_torture_init_#t~mem102#1.offset, lock_torture_init_#t~mem103#1.base, lock_torture_init_#t~mem103#1.offset, lock_torture_init_#t~nondet104#1, lock_torture_init_#t~nondet105#1, lock_torture_init_#t~nondet106#1, lock_torture_init_#t~nondet107#1, lock_torture_init_#t~mem108#1.base, lock_torture_init_#t~mem108#1.offset, lock_torture_init_#t~mem109#1.base, lock_torture_init_#t~mem109#1.offset, lock_torture_init_#t~nondet110#1, lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset, lock_torture_init_#t~mem113#1.base, lock_torture_init_#t~mem113#1.offset, lock_torture_init_#t~ret114#1, lock_torture_init_#t~ret115#1.base, lock_torture_init_#t~ret115#1.offset, lock_torture_init_#t~nondet116#1, lock_torture_init_#t~ret117#1, lock_torture_init_#t~ret118#1, lock_torture_init_#t~ret119#1, lock_torture_init_#t~ret120#1, lock_torture_init_#t~ret121#1.base, lock_torture_init_#t~ret121#1.offset, lock_torture_init_#t~nondet122#1, lock_torture_init_#t~ret123#1, lock_torture_init_#t~ret124#1, lock_torture_init_~i~2#1, lock_torture_init_~firsterr~0#1, lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset, lock_torture_init_~tmp~12#1, lock_torture_init_~tmp___0~9#1, lock_torture_init_~tmp___1~3#1, lock_torture_init_~tmp___2~2#1, lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset, lock_torture_init_~tmp___4~1#1.base, lock_torture_init_~tmp___4~1#1.offset;havoc lock_torture_init_~i~2#1;havoc lock_torture_init_~firsterr~0#1;call lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset := #Ultimate.allocOnStack(24);havoc lock_torture_init_~tmp~12#1;havoc lock_torture_init_~tmp___0~9#1;havoc lock_torture_init_~tmp___1~3#1;havoc lock_torture_init_~tmp___2~2#1;havoc lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset;havoc lock_torture_init_~tmp___4~1#1.base, lock_torture_init_~tmp___4~1#1.offset;lock_torture_init_~firsterr~0#1 := 0;call write~$Pointer$(~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset, 8);call write~$Pointer$(~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, 8 + lock_torture_init_~#torture_ops~0#1.offset, 8);call write~$Pointer$(~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, 16 + lock_torture_init_~#torture_ops~0#1.offset, 8);assume { :begin_inline_torture_init_begin } true;torture_init_begin_#in~arg0#1.base, torture_init_begin_#in~arg0#1.offset, torture_init_begin_#in~arg1#1, torture_init_begin_#in~arg2#1.base, torture_init_begin_#in~arg2#1.offset := ~torture_type~0.base, ~torture_type~0.offset, (if 0 == ~verbose~0 % 256 then 0 else 1), ~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset;havoc torture_init_begin_#res#1;havoc torture_init_begin_#t~nondet165#1, torture_init_begin_~arg0#1.base, torture_init_begin_~arg0#1.offset, torture_init_begin_~arg1#1, torture_init_begin_~arg2#1.base, torture_init_begin_~arg2#1.offset;torture_init_begin_~arg0#1.base, torture_init_begin_~arg0#1.offset := torture_init_begin_#in~arg0#1.base, torture_init_begin_#in~arg0#1.offset;torture_init_begin_~arg1#1 := torture_init_begin_#in~arg1#1;torture_init_begin_~arg2#1.base, torture_init_begin_~arg2#1.offset := torture_init_begin_#in~arg2#1.base, torture_init_begin_#in~arg2#1.offset;torture_init_begin_#res#1 := torture_init_begin_#t~nondet165#1;havoc torture_init_begin_#t~nondet165#1; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} lock_torture_init_#t~ret101#1 := torture_init_begin_#res#1;assume { :end_inline_torture_init_begin } true;lock_torture_init_~tmp~12#1 := lock_torture_init_#t~ret101#1;havoc lock_torture_init_#t~ret101#1; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} assume 0 != lock_torture_init_~tmp~12#1 % 256;lock_torture_init_~tmp___0~9#1 := 0; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} assume !(0 != lock_torture_init_~tmp___0~9#1);lock_torture_init_~i~2#1 := 0; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} assume !(lock_torture_init_~i~2#1 % 4294967296 <= 2); {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} assume !(3 == lock_torture_init_~i~2#1);call lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset := read~$Pointer$(~cur_ops~0.base, ~cur_ops~0.offset, 8); {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} assume !(0 != (lock_torture_init_#t~mem111#1.base + lock_torture_init_#t~mem111#1.offset) % 18446744073709551616);havoc lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset; {7672#(<= (+ ~nwriters_stress~0 1) 0)} is VALID [2022-02-20 22:02:52,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {7672#(<= (+ ~nwriters_stress~0 1) 0)} assume ~nwriters_stress~0 >= 0;~nrealwriters_stress~0 := ~nwriters_stress~0; {7671#false} is VALID [2022-02-20 22:02:52,243 INFO L272 TraceCheckUtils]: 35: Hoare triple {7671#false} call lock_torture_print_module_parms(~cur_ops~0.base, ~cur_ops~0.offset, 36, 0); {7670#true} is VALID [2022-02-20 22:02:52,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {7670#true} ~cur_ops___0.base, ~cur_ops___0.offset := #in~cur_ops___0.base, #in~cur_ops___0.offset;~tag.base, ~tag.offset := #in~tag.base, #in~tag.offset;havoc #t~nondet97; {7670#true} is VALID [2022-02-20 22:02:52,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {7670#true} assume true; {7670#true} is VALID [2022-02-20 22:02:52,244 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7670#true} {7671#false} #934#return; {7671#false} is VALID [2022-02-20 22:02:52,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {7671#false} ~lock_is_write_held~0 := 0; {7671#false} is VALID [2022-02-20 22:02:52,244 INFO L272 TraceCheckUtils]: 40: Hoare triple {7671#false} call lock_torture_init_#t~ret115#1.base, lock_torture_init_#t~ret115#1.offset := kmalloc(16 * ~nrealwriters_stress~0, 208); {7671#false} is VALID [2022-02-20 22:02:52,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {7671#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1; {7671#false} is VALID [2022-02-20 22:02:52,245 INFO L272 TraceCheckUtils]: 42: Hoare triple {7671#false} call ldv_check_alloc_flags(~flags#1); {7671#false} is VALID [2022-02-20 22:02:52,245 INFO L290 TraceCheckUtils]: 43: Hoare triple {7671#false} ~flags := #in~flags; {7671#false} is VALID [2022-02-20 22:02:52,245 INFO L290 TraceCheckUtils]: 44: Hoare triple {7671#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {7671#false} is VALID [2022-02-20 22:02:52,245 INFO L272 TraceCheckUtils]: 45: Hoare triple {7671#false} call ldv_error(); {7671#false} is VALID [2022-02-20 22:02:52,246 INFO L290 TraceCheckUtils]: 46: Hoare triple {7671#false} assume !false; {7671#false} is VALID [2022-02-20 22:02:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 22:02:52,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:02:52,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200188381] [2022-02-20 22:02:52,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200188381] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:02:52,247 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:02:52,247 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 22:02:52,247 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665270468] [2022-02-20 22:02:52,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:02:52,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-02-20 22:02:52,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:02:52,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:02:52,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:02:52,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 22:02:52,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:02:52,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 22:02:52,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 22:02:52,289 INFO L87 Difference]: Start difference. First operand 525 states and 715 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:02:53,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:02:53,566 INFO L93 Difference]: Finished difference Result 1074 states and 1473 transitions. [2022-02-20 22:02:53,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 22:02:53,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-02-20 22:02:53,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:02:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:02:53,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 961 transitions. [2022-02-20 22:02:53,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:02:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 961 transitions. [2022-02-20 22:02:53,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 961 transitions. [2022-02-20 22:02:54,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 961 edges. 961 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:02:54,365 INFO L225 Difference]: With dead ends: 1074 [2022-02-20 22:02:54,365 INFO L226 Difference]: Without dead ends: 569 [2022-02-20 22:02:54,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 22:02:54,367 INFO L933 BasicCegarLoop]: 464 mSDtfsCounter, 509 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 22:02:54,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [539 Valid, 671 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 22:02:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-02-20 22:02:54,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 525. [2022-02-20 22:02:54,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:02:54,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 569 states. Second operand has 525 states, 398 states have (on average 1.3743718592964824) internal successors, (547), 409 states have internal predecessors, (547), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-02-20 22:02:54,501 INFO L74 IsIncluded]: Start isIncluded. First operand 569 states. Second operand has 525 states, 398 states have (on average 1.3743718592964824) internal successors, (547), 409 states have internal predecessors, (547), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-02-20 22:02:54,502 INFO L87 Difference]: Start difference. First operand 569 states. Second operand has 525 states, 398 states have (on average 1.3743718592964824) internal successors, (547), 409 states have internal predecessors, (547), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-02-20 22:02:54,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:02:54,523 INFO L93 Difference]: Finished difference Result 569 states and 780 transitions. [2022-02-20 22:02:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 780 transitions. [2022-02-20 22:02:54,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:02:54,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:02:54,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 525 states, 398 states have (on average 1.3743718592964824) internal successors, (547), 409 states have internal predecessors, (547), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) Second operand 569 states. [2022-02-20 22:02:54,528 INFO L87 Difference]: Start difference. First operand has 525 states, 398 states have (on average 1.3743718592964824) internal successors, (547), 409 states have internal predecessors, (547), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) Second operand 569 states. [2022-02-20 22:02:54,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:02:54,550 INFO L93 Difference]: Finished difference Result 569 states and 780 transitions. [2022-02-20 22:02:54,550 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 780 transitions. [2022-02-20 22:02:54,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:02:54,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:02:54,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:02:54,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:02:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 398 states have (on average 1.3743718592964824) internal successors, (547), 409 states have internal predecessors, (547), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-02-20 22:02:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 714 transitions. [2022-02-20 22:02:54,577 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 714 transitions. Word has length 47 [2022-02-20 22:02:54,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:02:54,578 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 714 transitions. [2022-02-20 22:02:54,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 22:02:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 714 transitions. [2022-02-20 22:02:54,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 22:02:54,581 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:02:54,581 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:02:54,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 22:02:54,584 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:02:54,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:02:54,584 INFO L85 PathProgramCache]: Analyzing trace with hash -457513191, now seen corresponding path program 1 times [2022-02-20 22:02:54,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:02:54,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902319528] [2022-02-20 22:02:54,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:02:54,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:02:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:54,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:02:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:54,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {11058#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {11040#true} is VALID [2022-02-20 22:02:54,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {11040#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {11040#true} is VALID [2022-02-20 22:02:54,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {11040#true} assume true; {11040#true} is VALID [2022-02-20 22:02:54,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11040#true} {11042#(= ~ldv_spin~0 0)} #910#return; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:02:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:54,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {11058#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {11040#true} is VALID [2022-02-20 22:02:54,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {11040#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {11040#true} is VALID [2022-02-20 22:02:54,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {11040#true} assume true; {11040#true} is VALID [2022-02-20 22:02:54,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11040#true} {11042#(= ~ldv_spin~0 0)} #912#return; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:02:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:54,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {11058#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {11040#true} is VALID [2022-02-20 22:02:54,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {11040#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {11040#true} is VALID [2022-02-20 22:02:54,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {11040#true} assume true; {11040#true} is VALID [2022-02-20 22:02:54,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11040#true} {11042#(= ~ldv_spin~0 0)} #914#return; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 22:02:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:54,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {11040#true} ~cur_ops___0.base, ~cur_ops___0.offset := #in~cur_ops___0.base, #in~cur_ops___0.offset;~tag.base, ~tag.offset := #in~tag.base, #in~tag.offset;havoc #t~nondet97; {11040#true} is VALID [2022-02-20 22:02:54,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {11040#true} assume true; {11040#true} is VALID [2022-02-20 22:02:54,711 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11040#true} {11042#(= ~ldv_spin~0 0)} #934#return; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {11040#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(100, 2);call #Ultimate.allocInit(10, 3);call #Ultimate.allocInit(12, 4);call #Ultimate.allocInit(17, 5);call #Ultimate.allocInit(10, 6);call #Ultimate.allocInit(14, 7);call #Ultimate.allocInit(17, 8);call #Ultimate.allocInit(33, 9);call #Ultimate.allocInit(216, 10);call #Ultimate.allocInit(20, 11);call #Ultimate.allocInit(20, 12);call #Ultimate.allocInit(6, 13);call write~init~int(37, 13, 0, 1);call write~init~int(115, 13, 1, 1);call write~init~int(37, 13, 2, 1);call write~init~int(115, 13, 3, 1);call write~init~int(32, 13, 4, 1);call write~init~int(0, 13, 5, 1);call #Ultimate.allocInit(10, 14);call #Ultimate.allocInit(56, 15);call #Ultimate.allocInit(4, 16);call write~init~int(63, 16, 0, 1);call write~init~int(63, 16, 1, 1);call write~init~int(63, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(1, 17);call write~init~int(0, 17, 0, 1);call #Ultimate.allocInit(4, 18);call write~init~int(33, 18, 0, 1);call write~init~int(33, 18, 1, 1);call write~init~int(33, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(1, 19);call write~init~int(0, 19, 0, 1);call #Ultimate.allocInit(51, 20);call #Ultimate.allocInit(4, 21);call write~init~int(9, 21, 0, 1);call write~init~int(37, 21, 1, 1);call write~init~int(115, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(32, 23);call #Ultimate.allocInit(19, 24);call #Ultimate.allocInit(19, 25);call #Ultimate.allocInit(151, 26);call #Ultimate.allocInit(34, 27);call #Ultimate.allocInit(33, 28);call #Ultimate.allocInit(21, 29);call #Ultimate.allocInit(26, 30);call #Ultimate.allocInit(21, 31);call #Ultimate.allocInit(43, 32);call #Ultimate.allocInit(21, 33);call #Ultimate.allocInit(5, 34);call write~init~int(9, 34, 0, 1);call write~init~int(32, 34, 1, 1);call write~init~int(37, 34, 2, 1);call write~init~int(115, 34, 3, 1);call write~init~int(0, 34, 4, 1);call #Ultimate.allocInit(3, 35);call write~init~int(9, 35, 0, 1);call write~init~int(10, 35, 1, 1);call write~init~int(0, 35, 2, 1);call #Ultimate.allocInit(14, 36);call #Ultimate.allocInit(17, 37);call #Ultimate.allocInit(20, 38);call #Ultimate.allocInit(20, 39);call #Ultimate.allocInit(28, 40);call #Ultimate.allocInit(20, 41);call #Ultimate.allocInit(34, 42);call #Ultimate.allocInit(37, 43);call #Ultimate.allocInit(19, 44);call #Ultimate.allocInit(33, 45);call #Ultimate.allocInit(36, 46);~ldv_state_variable_3~0 := 0;~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~nwriters_stress~0 := -1;~onoff_holdoff~0 := 0;~onoff_interval~0 := 0;~shuffle_interval~0 := 3;~shutdown_secs~0 := 0;~stat_interval~0 := 60;~stutter~0 := 5;~verbose~0 := 1;~torture_type~0.base, ~torture_type~0.offset := 3, 0;~#n_lock_torture_errors~0.base, ~#n_lock_torture_errors~0.offset := 47, 0;call #Ultimate.allocInit(4, 47);call write~init~int(0, ~#n_lock_torture_errors~0.base, ~#n_lock_torture_errors~0.offset, 4);~#stats_task~0.base, ~#stats_task~0.offset := 48, 0;call #Ultimate.allocInit(8, 48);call write~init~$Pointer$(0, 0, ~#stats_task~0.base, ~#stats_task~0.offset, 8);~writer_tasks~0.base, ~writer_tasks~0.offset := 0, 0;~nrealwriters_stress~0 := 0;~lock_is_write_held~0 := 0;~lwsa~0.base, ~lwsa~0.offset := 0, 0;~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset := 49, 0;call #Ultimate.allocInit(4, 49);call write~init~int(1, ~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset, 4);~cur_ops~0.base, ~cur_ops~0.offset := 0, 0;~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset := 50, 0;call #Ultimate.allocInit(48, 50);call write~init~$Pointer$(0, 0, ~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_lock.base, #funAddr~torture_lock_busted_write_lock.offset, ~#lock_busted_ops~0.base, 8 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_delay.base, #funAddr~torture_lock_busted_write_delay.offset, ~#lock_busted_ops~0.base, 16 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_unlock.base, #funAddr~torture_lock_busted_write_unlock.offset, ~#lock_busted_ops~0.base, 24 + ~#lock_busted_ops~0.offset, 8);call write~init~int(0, ~#lock_busted_ops~0.base, 32 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(4, 0, ~#lock_busted_ops~0.base, 40 + ~#lock_busted_ops~0.offset, 8);~#torture_spinlock~0.base, ~#torture_spinlock~0.offset := 51, 0;call #Ultimate.allocInit(68, 51);call write~init~int(0, ~#torture_spinlock~0.base, ~#torture_spinlock~0.offset, 4);call write~init~int(3735899821, ~#torture_spinlock~0.base, 4 + ~#torture_spinlock~0.offset, 4);call write~init~int(4294967295, ~#torture_spinlock~0.base, 8 + ~#torture_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#torture_spinlock~0.base, 12 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 20 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 28 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 36 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(5, 0, ~#torture_spinlock~0.base, 44 + ~#torture_spinlock~0.offset, 8);call write~init~int(0, ~#torture_spinlock~0.base, 52 + ~#torture_spinlock~0.offset, 4);call write~init~int(0, ~#torture_spinlock~0.base, 56 + ~#torture_spinlock~0.offset, 8);~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset := 52, 0;call #Ultimate.allocInit(48, 52);call write~init~$Pointer$(0, 0, ~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_lock.base, #funAddr~torture_spin_lock_write_lock.offset, ~#spin_lock_ops~0.base, 8 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_delay.base, #funAddr~torture_spin_lock_write_delay.offset, ~#spin_lock_ops~0.base, 16 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_unlock.base, #funAddr~torture_spin_lock_write_unlock.offset, ~#spin_lock_ops~0.base, 24 + ~#spin_lock_ops~0.offset, 8);call write~init~int(0, ~#spin_lock_ops~0.base, 32 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(6, 0, ~#spin_lock_ops~0.base, 40 + ~#spin_lock_ops~0.offset, 8);~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset := 53, 0;call #Ultimate.allocInit(48, 53);call write~init~$Pointer$(0, 0, ~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_lock_irq.base, #funAddr~torture_spin_lock_write_lock_irq.offset, ~#spin_lock_irq_ops~0.base, 8 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_delay.base, #funAddr~torture_spin_lock_write_delay.offset, ~#spin_lock_irq_ops~0.base, 16 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_spin_write_unlock_irq.base, #funAddr~torture_lock_spin_write_unlock_irq.offset, ~#spin_lock_irq_ops~0.base, 24 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~int(0, ~#spin_lock_irq_ops~0.base, 32 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(7, 0, ~#spin_lock_irq_ops~0.base, 40 + ~#spin_lock_irq_ops~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_spin~0 := 0; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {11042#(= ~ldv_spin~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret125#1.base, main_#t~ret125#1.offset, main_#t~ret126#1.base, main_#t~ret126#1.offset, main_#t~ret127#1.base, main_#t~ret127#1.offset, main_#t~nondet128#1, main_#t~switch129#1, main_#t~nondet130#1, main_#t~switch131#1, main_#t~ret132#1, main_#t~ret133#1, main_#t~ret134#1, main_#t~nondet135#1, main_#t~switch136#1, main_#t~ret137#1, main_#t~nondet138#1, main_#t~switch139#1, main_#t~ret140#1, main_#t~ret141#1, main_#t~ret142#1, main_#t~nondet143#1, main_#t~switch144#1, main_#t~ret145#1, main_#t~ret146#1, main_#t~ret147#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~13#1.base, main_~tmp~13#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset, main_~tmp___2~3#1, main_~tmp___3~2#1, main_~tmp___4~2#1, main_~tmp___5~1#1, main_~tmp___6~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~13#1.base, main_~tmp~13#1.offset;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;havoc main_~tmp___2~3#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1;havoc main_~tmp___5~1#1;havoc main_~tmp___6~1#1; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,713 INFO L272 TraceCheckUtils]: 2: Hoare triple {11042#(= ~ldv_spin~0 0)} call main_#t~ret125#1.base, main_#t~ret125#1.offset := ldv_zalloc(16); {11058#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:54,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {11058#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {11040#true} is VALID [2022-02-20 22:02:54,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {11040#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {11040#true} is VALID [2022-02-20 22:02:54,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {11040#true} assume true; {11040#true} is VALID [2022-02-20 22:02:54,714 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {11040#true} {11042#(= ~ldv_spin~0 0)} #910#return; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {11042#(= ~ldv_spin~0 0)} main_~tmp~13#1.base, main_~tmp~13#1.offset := main_#t~ret125#1.base, main_#t~ret125#1.offset;havoc main_#t~ret125#1.base, main_#t~ret125#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~13#1.base, main_~tmp~13#1.offset; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,715 INFO L272 TraceCheckUtils]: 8: Hoare triple {11042#(= ~ldv_spin~0 0)} call main_#t~ret126#1.base, main_#t~ret126#1.offset := ldv_zalloc(16); {11058#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:54,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {11058#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {11040#true} is VALID [2022-02-20 22:02:54,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {11040#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {11040#true} is VALID [2022-02-20 22:02:54,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {11040#true} assume true; {11040#true} is VALID [2022-02-20 22:02:54,716 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11040#true} {11042#(= ~ldv_spin~0 0)} #912#return; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {11042#(= ~ldv_spin~0 0)} main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset := main_#t~ret126#1.base, main_#t~ret126#1.offset;havoc main_#t~ret126#1.base, main_#t~ret126#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,718 INFO L272 TraceCheckUtils]: 14: Hoare triple {11042#(= ~ldv_spin~0 0)} call main_#t~ret127#1.base, main_#t~ret127#1.offset := ldv_zalloc(16); {11058#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:54,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {11058#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {11040#true} is VALID [2022-02-20 22:02:54,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {11040#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {11040#true} is VALID [2022-02-20 22:02:54,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {11040#true} assume true; {11040#true} is VALID [2022-02-20 22:02:54,719 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11040#true} {11042#(= ~ldv_spin~0 0)} #914#return; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {11042#(= ~ldv_spin~0 0)} main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset := main_#t~ret127#1.base, main_#t~ret127#1.offset;havoc main_#t~ret127#1.base, main_#t~ret127#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;assume { :begin_inline_ldv_initialize } true; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {11042#(= ~ldv_spin~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {11042#(= ~ldv_spin~0 0)} assume -2147483648 <= main_#t~nondet128#1 && main_#t~nondet128#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet128#1;havoc main_#t~nondet128#1;main_#t~switch129#1 := 0 == main_~tmp___2~3#1; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {11042#(= ~ldv_spin~0 0)} assume !main_#t~switch129#1;main_#t~switch129#1 := main_#t~switch129#1 || 1 == main_~tmp___2~3#1; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {11042#(= ~ldv_spin~0 0)} assume main_#t~switch129#1; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {11042#(= ~ldv_spin~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet135#1 && main_#t~nondet135#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet135#1;havoc main_#t~nondet135#1;main_#t~switch136#1 := 0 == main_~tmp___4~2#1; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {11042#(= ~ldv_spin~0 0)} assume !main_#t~switch136#1;main_#t~switch136#1 := main_#t~switch136#1 || 1 == main_~tmp___4~2#1; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {11042#(= ~ldv_spin~0 0)} assume main_#t~switch136#1; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {11042#(= ~ldv_spin~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_lock_torture_init } true;havoc lock_torture_init_#res#1;havoc lock_torture_init_#t~ret101#1, lock_torture_init_#t~mem102#1.base, lock_torture_init_#t~mem102#1.offset, lock_torture_init_#t~mem103#1.base, lock_torture_init_#t~mem103#1.offset, lock_torture_init_#t~nondet104#1, lock_torture_init_#t~nondet105#1, lock_torture_init_#t~nondet106#1, lock_torture_init_#t~nondet107#1, lock_torture_init_#t~mem108#1.base, lock_torture_init_#t~mem108#1.offset, lock_torture_init_#t~mem109#1.base, lock_torture_init_#t~mem109#1.offset, lock_torture_init_#t~nondet110#1, lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset, lock_torture_init_#t~mem113#1.base, lock_torture_init_#t~mem113#1.offset, lock_torture_init_#t~ret114#1, lock_torture_init_#t~ret115#1.base, lock_torture_init_#t~ret115#1.offset, lock_torture_init_#t~nondet116#1, lock_torture_init_#t~ret117#1, lock_torture_init_#t~ret118#1, lock_torture_init_#t~ret119#1, lock_torture_init_#t~ret120#1, lock_torture_init_#t~ret121#1.base, lock_torture_init_#t~ret121#1.offset, lock_torture_init_#t~nondet122#1, lock_torture_init_#t~ret123#1, lock_torture_init_#t~ret124#1, lock_torture_init_~i~2#1, lock_torture_init_~firsterr~0#1, lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset, lock_torture_init_~tmp~12#1, lock_torture_init_~tmp___0~9#1, lock_torture_init_~tmp___1~3#1, lock_torture_init_~tmp___2~2#1, lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset, lock_torture_init_~tmp___4~1#1.base, lock_torture_init_~tmp___4~1#1.offset;havoc lock_torture_init_~i~2#1;havoc lock_torture_init_~firsterr~0#1;call lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset := #Ultimate.allocOnStack(24);havoc lock_torture_init_~tmp~12#1;havoc lock_torture_init_~tmp___0~9#1;havoc lock_torture_init_~tmp___1~3#1;havoc lock_torture_init_~tmp___2~2#1;havoc lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset;havoc lock_torture_init_~tmp___4~1#1.base, lock_torture_init_~tmp___4~1#1.offset;lock_torture_init_~firsterr~0#1 := 0;call write~$Pointer$(~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset, 8);call write~$Pointer$(~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, 8 + lock_torture_init_~#torture_ops~0#1.offset, 8);call write~$Pointer$(~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, 16 + lock_torture_init_~#torture_ops~0#1.offset, 8);assume { :begin_inline_torture_init_begin } true;torture_init_begin_#in~arg0#1.base, torture_init_begin_#in~arg0#1.offset, torture_init_begin_#in~arg1#1, torture_init_begin_#in~arg2#1.base, torture_init_begin_#in~arg2#1.offset := ~torture_type~0.base, ~torture_type~0.offset, (if 0 == ~verbose~0 % 256 then 0 else 1), ~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset;havoc torture_init_begin_#res#1;havoc torture_init_begin_#t~nondet165#1, torture_init_begin_~arg0#1.base, torture_init_begin_~arg0#1.offset, torture_init_begin_~arg1#1, torture_init_begin_~arg2#1.base, torture_init_begin_~arg2#1.offset;torture_init_begin_~arg0#1.base, torture_init_begin_~arg0#1.offset := torture_init_begin_#in~arg0#1.base, torture_init_begin_#in~arg0#1.offset;torture_init_begin_~arg1#1 := torture_init_begin_#in~arg1#1;torture_init_begin_~arg2#1.base, torture_init_begin_~arg2#1.offset := torture_init_begin_#in~arg2#1.base, torture_init_begin_#in~arg2#1.offset;torture_init_begin_#res#1 := torture_init_begin_#t~nondet165#1;havoc torture_init_begin_#t~nondet165#1; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {11042#(= ~ldv_spin~0 0)} lock_torture_init_#t~ret101#1 := torture_init_begin_#res#1;assume { :end_inline_torture_init_begin } true;lock_torture_init_~tmp~12#1 := lock_torture_init_#t~ret101#1;havoc lock_torture_init_#t~ret101#1; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {11042#(= ~ldv_spin~0 0)} assume 0 != lock_torture_init_~tmp~12#1 % 256;lock_torture_init_~tmp___0~9#1 := 0; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {11042#(= ~ldv_spin~0 0)} assume !(0 != lock_torture_init_~tmp___0~9#1);lock_torture_init_~i~2#1 := 0; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {11042#(= ~ldv_spin~0 0)} assume !(lock_torture_init_~i~2#1 % 4294967296 <= 2); {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {11042#(= ~ldv_spin~0 0)} assume !(3 == lock_torture_init_~i~2#1);call lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset := read~$Pointer$(~cur_ops~0.base, ~cur_ops~0.offset, 8); {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {11042#(= ~ldv_spin~0 0)} assume !(0 != (lock_torture_init_#t~mem111#1.base + lock_torture_init_#t~mem111#1.offset) % 18446744073709551616);havoc lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,727 INFO L290 TraceCheckUtils]: 34: Hoare triple {11042#(= ~ldv_spin~0 0)} assume !(~nwriters_stress~0 >= 0);assume { :begin_inline_cpumask_weight } true;cpumask_weight_#in~srcp#1.base, cpumask_weight_#in~srcp#1.offset := ~cpu_online_mask~0.base, ~cpu_online_mask~0.offset;havoc cpumask_weight_#res#1;havoc cpumask_weight_#t~ret12#1, cpumask_weight_~srcp#1.base, cpumask_weight_~srcp#1.offset, cpumask_weight_~tmp~0#1;cpumask_weight_~srcp#1.base, cpumask_weight_~srcp#1.offset := cpumask_weight_#in~srcp#1.base, cpumask_weight_#in~srcp#1.offset;havoc cpumask_weight_~tmp~0#1;assume { :begin_inline_bitmap_weight } true;bitmap_weight_#in~src#1.base, bitmap_weight_#in~src#1.offset, bitmap_weight_#in~nbits#1 := cpumask_weight_~srcp#1.base, cpumask_weight_~srcp#1.offset, ~nr_cpu_ids~0;havoc bitmap_weight_#res#1;havoc bitmap_weight_#t~ret11#1, bitmap_weight_~src#1.base, bitmap_weight_~src#1.offset, bitmap_weight_~nbits#1, bitmap_weight_~tmp___0~0#1;bitmap_weight_~src#1.base, bitmap_weight_~src#1.offset := bitmap_weight_#in~src#1.base, bitmap_weight_#in~src#1.offset;bitmap_weight_~nbits#1 := bitmap_weight_#in~nbits#1;havoc bitmap_weight_~tmp___0~0#1;assume { :begin_inline___bitmap_weight } true;__bitmap_weight_#in~arg0#1.base, __bitmap_weight_#in~arg0#1.offset, __bitmap_weight_#in~arg1#1 := bitmap_weight_~src#1.base, bitmap_weight_~src#1.offset, bitmap_weight_~nbits#1;havoc __bitmap_weight_#res#1;havoc __bitmap_weight_#t~nondet151#1, __bitmap_weight_~arg0#1.base, __bitmap_weight_~arg0#1.offset, __bitmap_weight_~arg1#1;__bitmap_weight_~arg0#1.base, __bitmap_weight_~arg0#1.offset := __bitmap_weight_#in~arg0#1.base, __bitmap_weight_#in~arg0#1.offset;__bitmap_weight_~arg1#1 := __bitmap_weight_#in~arg1#1;assume -2147483648 <= __bitmap_weight_#t~nondet151#1 && __bitmap_weight_#t~nondet151#1 <= 2147483647;__bitmap_weight_#res#1 := __bitmap_weight_#t~nondet151#1;havoc __bitmap_weight_#t~nondet151#1; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {11042#(= ~ldv_spin~0 0)} bitmap_weight_#t~ret11#1 := __bitmap_weight_#res#1;assume { :end_inline___bitmap_weight } true;assume -2147483648 <= bitmap_weight_#t~ret11#1 && bitmap_weight_#t~ret11#1 <= 2147483647;bitmap_weight_~tmp___0~0#1 := bitmap_weight_#t~ret11#1;havoc bitmap_weight_#t~ret11#1;bitmap_weight_#res#1 := bitmap_weight_~tmp___0~0#1; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {11042#(= ~ldv_spin~0 0)} cpumask_weight_#t~ret12#1 := bitmap_weight_#res#1;assume { :end_inline_bitmap_weight } true;assume -2147483648 <= cpumask_weight_#t~ret12#1 && cpumask_weight_#t~ret12#1 <= 2147483647;cpumask_weight_~tmp~0#1 := cpumask_weight_#t~ret12#1;havoc cpumask_weight_#t~ret12#1;cpumask_weight_#res#1 := cpumask_weight_~tmp~0#1; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {11042#(= ~ldv_spin~0 0)} lock_torture_init_#t~ret114#1 := cpumask_weight_#res#1;assume { :end_inline_cpumask_weight } true;lock_torture_init_~tmp___2~2#1 := lock_torture_init_#t~ret114#1;havoc lock_torture_init_#t~ret114#1;~nrealwriters_stress~0 := (if 2 * lock_torture_init_~tmp___2~2#1 % 4294967296 % 4294967296 <= 2147483647 then 2 * lock_torture_init_~tmp___2~2#1 % 4294967296 % 4294967296 else 2 * lock_torture_init_~tmp___2~2#1 % 4294967296 % 4294967296 - 4294967296); {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,728 INFO L272 TraceCheckUtils]: 38: Hoare triple {11042#(= ~ldv_spin~0 0)} call lock_torture_print_module_parms(~cur_ops~0.base, ~cur_ops~0.offset, 36, 0); {11040#true} is VALID [2022-02-20 22:02:54,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {11040#true} ~cur_ops___0.base, ~cur_ops___0.offset := #in~cur_ops___0.base, #in~cur_ops___0.offset;~tag.base, ~tag.offset := #in~tag.base, #in~tag.offset;havoc #t~nondet97; {11040#true} is VALID [2022-02-20 22:02:54,729 INFO L290 TraceCheckUtils]: 40: Hoare triple {11040#true} assume true; {11040#true} is VALID [2022-02-20 22:02:54,729 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11040#true} {11042#(= ~ldv_spin~0 0)} #934#return; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {11042#(= ~ldv_spin~0 0)} ~lock_is_write_held~0 := 0; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,730 INFO L272 TraceCheckUtils]: 43: Hoare triple {11042#(= ~ldv_spin~0 0)} call lock_torture_init_#t~ret115#1.base, lock_torture_init_#t~ret115#1.offset := kmalloc(16 * ~nrealwriters_stress~0, 208); {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {11042#(= ~ldv_spin~0 0)} ~size#1 := #in~size#1;~flags#1 := #in~flags#1; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,731 INFO L272 TraceCheckUtils]: 45: Hoare triple {11042#(= ~ldv_spin~0 0)} call ldv_check_alloc_flags(~flags#1); {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {11042#(= ~ldv_spin~0 0)} ~flags := #in~flags; {11042#(= ~ldv_spin~0 0)} is VALID [2022-02-20 22:02:54,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {11042#(= ~ldv_spin~0 0)} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {11041#false} is VALID [2022-02-20 22:02:54,732 INFO L272 TraceCheckUtils]: 48: Hoare triple {11041#false} call ldv_error(); {11041#false} is VALID [2022-02-20 22:02:54,732 INFO L290 TraceCheckUtils]: 49: Hoare triple {11041#false} assume !false; {11041#false} is VALID [2022-02-20 22:02:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 22:02:54,733 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:02:54,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902319528] [2022-02-20 22:02:54,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902319528] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:02:54,733 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:02:54,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 22:02:54,734 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699741380] [2022-02-20 22:02:54,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:02:54,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2022-02-20 22:02:54,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:02:54,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 22:02:54,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:02:54,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 22:02:54,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:02:54,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 22:02:54,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 22:02:54,772 INFO L87 Difference]: Start difference. First operand 525 states and 714 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 22:02:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:02:56,833 INFO L93 Difference]: Finished difference Result 1054 states and 1484 transitions. [2022-02-20 22:02:56,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 22:02:56,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2022-02-20 22:02:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:02:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 22:02:56,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 994 transitions. [2022-02-20 22:02:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 22:02:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 994 transitions. [2022-02-20 22:02:56,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 994 transitions. [2022-02-20 22:02:57,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 994 edges. 994 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:02:57,735 INFO L225 Difference]: With dead ends: 1054 [2022-02-20 22:02:57,735 INFO L226 Difference]: Without dead ends: 1025 [2022-02-20 22:02:57,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 22:02:57,737 INFO L933 BasicCegarLoop]: 472 mSDtfsCounter, 617 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 22:02:57,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [659 Valid, 916 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 22:02:57,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2022-02-20 22:02:57,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 932. [2022-02-20 22:02:57,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:02:57,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1025 states. Second operand has 932 states, 719 states have (on average 1.411682892906815) internal successors, (1015), 743 states have internal predecessors, (1015), 143 states have call successors, (143), 69 states have call predecessors, (143), 69 states have return successors, (147), 131 states have call predecessors, (147), 138 states have call successors, (147) [2022-02-20 22:02:57,942 INFO L74 IsIncluded]: Start isIncluded. First operand 1025 states. Second operand has 932 states, 719 states have (on average 1.411682892906815) internal successors, (1015), 743 states have internal predecessors, (1015), 143 states have call successors, (143), 69 states have call predecessors, (143), 69 states have return successors, (147), 131 states have call predecessors, (147), 138 states have call successors, (147) [2022-02-20 22:02:57,945 INFO L87 Difference]: Start difference. First operand 1025 states. Second operand has 932 states, 719 states have (on average 1.411682892906815) internal successors, (1015), 743 states have internal predecessors, (1015), 143 states have call successors, (143), 69 states have call predecessors, (143), 69 states have return successors, (147), 131 states have call predecessors, (147), 138 states have call successors, (147) [2022-02-20 22:02:58,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:02:58,005 INFO L93 Difference]: Finished difference Result 1025 states and 1450 transitions. [2022-02-20 22:02:58,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1450 transitions. [2022-02-20 22:02:58,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:02:58,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:02:58,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 932 states, 719 states have (on average 1.411682892906815) internal successors, (1015), 743 states have internal predecessors, (1015), 143 states have call successors, (143), 69 states have call predecessors, (143), 69 states have return successors, (147), 131 states have call predecessors, (147), 138 states have call successors, (147) Second operand 1025 states. [2022-02-20 22:02:58,014 INFO L87 Difference]: Start difference. First operand has 932 states, 719 states have (on average 1.411682892906815) internal successors, (1015), 743 states have internal predecessors, (1015), 143 states have call successors, (143), 69 states have call predecessors, (143), 69 states have return successors, (147), 131 states have call predecessors, (147), 138 states have call successors, (147) Second operand 1025 states. [2022-02-20 22:02:58,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:02:58,075 INFO L93 Difference]: Finished difference Result 1025 states and 1450 transitions. [2022-02-20 22:02:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1450 transitions. [2022-02-20 22:02:58,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:02:58,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:02:58,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:02:58,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:02:58,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 719 states have (on average 1.411682892906815) internal successors, (1015), 743 states have internal predecessors, (1015), 143 states have call successors, (143), 69 states have call predecessors, (143), 69 states have return successors, (147), 131 states have call predecessors, (147), 138 states have call successors, (147) [2022-02-20 22:02:58,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1305 transitions. [2022-02-20 22:02:58,166 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1305 transitions. Word has length 50 [2022-02-20 22:02:58,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:02:58,167 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1305 transitions. [2022-02-20 22:02:58,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 22:02:58,167 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1305 transitions. [2022-02-20 22:02:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 22:02:58,170 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:02:58,170 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:58,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 22:02:58,171 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:02:58,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:02:58,171 INFO L85 PathProgramCache]: Analyzing trace with hash 638272764, now seen corresponding path program 1 times [2022-02-20 22:02:58,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:02:58,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301475429] [2022-02-20 22:02:58,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:02:58,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:02:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:58,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:02:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:58,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {15866#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {15840#true} is VALID [2022-02-20 22:02:58,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {15840#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {15840#true} is VALID [2022-02-20 22:02:58,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {15840#true} assume true; {15840#true} is VALID [2022-02-20 22:02:58,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15840#true} {15840#true} #910#return; {15840#true} is VALID [2022-02-20 22:02:58,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:02:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:58,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {15866#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {15840#true} is VALID [2022-02-20 22:02:58,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {15840#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {15840#true} is VALID [2022-02-20 22:02:58,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {15840#true} assume true; {15840#true} is VALID [2022-02-20 22:02:58,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15840#true} {15840#true} #912#return; {15840#true} is VALID [2022-02-20 22:02:58,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:02:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:58,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {15866#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {15840#true} is VALID [2022-02-20 22:02:58,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {15840#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {15840#true} is VALID [2022-02-20 22:02:58,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {15840#true} assume true; {15840#true} is VALID [2022-02-20 22:02:58,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15840#true} {15840#true} #914#return; {15840#true} is VALID [2022-02-20 22:02:58,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 22:02:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:58,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:02:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:58,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {15871#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {15840#true} is VALID [2022-02-20 22:02:58,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {15840#true} assume true; {15840#true} is VALID [2022-02-20 22:02:58,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15840#true} {15840#true} #892#return; {15840#true} is VALID [2022-02-20 22:02:58,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {15867#(and (= ~ldv_spin~0 |old(~ldv_spin~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} havoc ~flags~0; {15840#true} is VALID [2022-02-20 22:02:58,327 INFO L272 TraceCheckUtils]: 1: Hoare triple {15840#true} call ldv_spin_lock(); {15871#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 22:02:58,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {15871#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {15840#true} is VALID [2022-02-20 22:02:58,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {15840#true} assume true; {15840#true} is VALID [2022-02-20 22:02:58,328 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15840#true} {15840#true} #892#return; {15840#true} is VALID [2022-02-20 22:02:58,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {15840#true} call write~int(~flags~0, ~cur_ops~0.base, 32 + ~cur_ops~0.offset, 8);#res := 0; {15840#true} is VALID [2022-02-20 22:02:58,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {15840#true} assume true; {15840#true} is VALID [2022-02-20 22:02:58,328 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15840#true} {15841#false} #916#return; {15841#false} is VALID [2022-02-20 22:02:58,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-20 22:02:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:58,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {15840#true} ~cur_ops___0.base, ~cur_ops___0.offset := #in~cur_ops___0.base, #in~cur_ops___0.offset;~tag.base, ~tag.offset := #in~tag.base, #in~tag.offset;havoc #t~nondet97; {15840#true} is VALID [2022-02-20 22:02:58,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {15840#true} assume true; {15840#true} is VALID [2022-02-20 22:02:58,333 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15840#true} {15841#false} #934#return; {15841#false} is VALID [2022-02-20 22:02:58,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {15840#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(100, 2);call #Ultimate.allocInit(10, 3);call #Ultimate.allocInit(12, 4);call #Ultimate.allocInit(17, 5);call #Ultimate.allocInit(10, 6);call #Ultimate.allocInit(14, 7);call #Ultimate.allocInit(17, 8);call #Ultimate.allocInit(33, 9);call #Ultimate.allocInit(216, 10);call #Ultimate.allocInit(20, 11);call #Ultimate.allocInit(20, 12);call #Ultimate.allocInit(6, 13);call write~init~int(37, 13, 0, 1);call write~init~int(115, 13, 1, 1);call write~init~int(37, 13, 2, 1);call write~init~int(115, 13, 3, 1);call write~init~int(32, 13, 4, 1);call write~init~int(0, 13, 5, 1);call #Ultimate.allocInit(10, 14);call #Ultimate.allocInit(56, 15);call #Ultimate.allocInit(4, 16);call write~init~int(63, 16, 0, 1);call write~init~int(63, 16, 1, 1);call write~init~int(63, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(1, 17);call write~init~int(0, 17, 0, 1);call #Ultimate.allocInit(4, 18);call write~init~int(33, 18, 0, 1);call write~init~int(33, 18, 1, 1);call write~init~int(33, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(1, 19);call write~init~int(0, 19, 0, 1);call #Ultimate.allocInit(51, 20);call #Ultimate.allocInit(4, 21);call write~init~int(9, 21, 0, 1);call write~init~int(37, 21, 1, 1);call write~init~int(115, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(32, 23);call #Ultimate.allocInit(19, 24);call #Ultimate.allocInit(19, 25);call #Ultimate.allocInit(151, 26);call #Ultimate.allocInit(34, 27);call #Ultimate.allocInit(33, 28);call #Ultimate.allocInit(21, 29);call #Ultimate.allocInit(26, 30);call #Ultimate.allocInit(21, 31);call #Ultimate.allocInit(43, 32);call #Ultimate.allocInit(21, 33);call #Ultimate.allocInit(5, 34);call write~init~int(9, 34, 0, 1);call write~init~int(32, 34, 1, 1);call write~init~int(37, 34, 2, 1);call write~init~int(115, 34, 3, 1);call write~init~int(0, 34, 4, 1);call #Ultimate.allocInit(3, 35);call write~init~int(9, 35, 0, 1);call write~init~int(10, 35, 1, 1);call write~init~int(0, 35, 2, 1);call #Ultimate.allocInit(14, 36);call #Ultimate.allocInit(17, 37);call #Ultimate.allocInit(20, 38);call #Ultimate.allocInit(20, 39);call #Ultimate.allocInit(28, 40);call #Ultimate.allocInit(20, 41);call #Ultimate.allocInit(34, 42);call #Ultimate.allocInit(37, 43);call #Ultimate.allocInit(19, 44);call #Ultimate.allocInit(33, 45);call #Ultimate.allocInit(36, 46);~ldv_state_variable_3~0 := 0;~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~nwriters_stress~0 := -1;~onoff_holdoff~0 := 0;~onoff_interval~0 := 0;~shuffle_interval~0 := 3;~shutdown_secs~0 := 0;~stat_interval~0 := 60;~stutter~0 := 5;~verbose~0 := 1;~torture_type~0.base, ~torture_type~0.offset := 3, 0;~#n_lock_torture_errors~0.base, ~#n_lock_torture_errors~0.offset := 47, 0;call #Ultimate.allocInit(4, 47);call write~init~int(0, ~#n_lock_torture_errors~0.base, ~#n_lock_torture_errors~0.offset, 4);~#stats_task~0.base, ~#stats_task~0.offset := 48, 0;call #Ultimate.allocInit(8, 48);call write~init~$Pointer$(0, 0, ~#stats_task~0.base, ~#stats_task~0.offset, 8);~writer_tasks~0.base, ~writer_tasks~0.offset := 0, 0;~nrealwriters_stress~0 := 0;~lock_is_write_held~0 := 0;~lwsa~0.base, ~lwsa~0.offset := 0, 0;~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset := 49, 0;call #Ultimate.allocInit(4, 49);call write~init~int(1, ~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset, 4);~cur_ops~0.base, ~cur_ops~0.offset := 0, 0;~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset := 50, 0;call #Ultimate.allocInit(48, 50);call write~init~$Pointer$(0, 0, ~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_lock.base, #funAddr~torture_lock_busted_write_lock.offset, ~#lock_busted_ops~0.base, 8 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_delay.base, #funAddr~torture_lock_busted_write_delay.offset, ~#lock_busted_ops~0.base, 16 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_unlock.base, #funAddr~torture_lock_busted_write_unlock.offset, ~#lock_busted_ops~0.base, 24 + ~#lock_busted_ops~0.offset, 8);call write~init~int(0, ~#lock_busted_ops~0.base, 32 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(4, 0, ~#lock_busted_ops~0.base, 40 + ~#lock_busted_ops~0.offset, 8);~#torture_spinlock~0.base, ~#torture_spinlock~0.offset := 51, 0;call #Ultimate.allocInit(68, 51);call write~init~int(0, ~#torture_spinlock~0.base, ~#torture_spinlock~0.offset, 4);call write~init~int(3735899821, ~#torture_spinlock~0.base, 4 + ~#torture_spinlock~0.offset, 4);call write~init~int(4294967295, ~#torture_spinlock~0.base, 8 + ~#torture_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#torture_spinlock~0.base, 12 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 20 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 28 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 36 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(5, 0, ~#torture_spinlock~0.base, 44 + ~#torture_spinlock~0.offset, 8);call write~init~int(0, ~#torture_spinlock~0.base, 52 + ~#torture_spinlock~0.offset, 4);call write~init~int(0, ~#torture_spinlock~0.base, 56 + ~#torture_spinlock~0.offset, 8);~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset := 52, 0;call #Ultimate.allocInit(48, 52);call write~init~$Pointer$(0, 0, ~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_lock.base, #funAddr~torture_spin_lock_write_lock.offset, ~#spin_lock_ops~0.base, 8 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_delay.base, #funAddr~torture_spin_lock_write_delay.offset, ~#spin_lock_ops~0.base, 16 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_unlock.base, #funAddr~torture_spin_lock_write_unlock.offset, ~#spin_lock_ops~0.base, 24 + ~#spin_lock_ops~0.offset, 8);call write~init~int(0, ~#spin_lock_ops~0.base, 32 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(6, 0, ~#spin_lock_ops~0.base, 40 + ~#spin_lock_ops~0.offset, 8);~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset := 53, 0;call #Ultimate.allocInit(48, 53);call write~init~$Pointer$(0, 0, ~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_lock_irq.base, #funAddr~torture_spin_lock_write_lock_irq.offset, ~#spin_lock_irq_ops~0.base, 8 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_delay.base, #funAddr~torture_spin_lock_write_delay.offset, ~#spin_lock_irq_ops~0.base, 16 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_spin_write_unlock_irq.base, #funAddr~torture_lock_spin_write_unlock_irq.offset, ~#spin_lock_irq_ops~0.base, 24 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~int(0, ~#spin_lock_irq_ops~0.base, 32 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(7, 0, ~#spin_lock_irq_ops~0.base, 40 + ~#spin_lock_irq_ops~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_spin~0 := 0; {15840#true} is VALID [2022-02-20 22:02:58,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {15840#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret125#1.base, main_#t~ret125#1.offset, main_#t~ret126#1.base, main_#t~ret126#1.offset, main_#t~ret127#1.base, main_#t~ret127#1.offset, main_#t~nondet128#1, main_#t~switch129#1, main_#t~nondet130#1, main_#t~switch131#1, main_#t~ret132#1, main_#t~ret133#1, main_#t~ret134#1, main_#t~nondet135#1, main_#t~switch136#1, main_#t~ret137#1, main_#t~nondet138#1, main_#t~switch139#1, main_#t~ret140#1, main_#t~ret141#1, main_#t~ret142#1, main_#t~nondet143#1, main_#t~switch144#1, main_#t~ret145#1, main_#t~ret146#1, main_#t~ret147#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~13#1.base, main_~tmp~13#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset, main_~tmp___2~3#1, main_~tmp___3~2#1, main_~tmp___4~2#1, main_~tmp___5~1#1, main_~tmp___6~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~13#1.base, main_~tmp~13#1.offset;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;havoc main_~tmp___2~3#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1;havoc main_~tmp___5~1#1;havoc main_~tmp___6~1#1; {15840#true} is VALID [2022-02-20 22:02:58,335 INFO L272 TraceCheckUtils]: 2: Hoare triple {15840#true} call main_#t~ret125#1.base, main_#t~ret125#1.offset := ldv_zalloc(16); {15866#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:58,335 INFO L290 TraceCheckUtils]: 3: Hoare triple {15866#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {15840#true} is VALID [2022-02-20 22:02:58,335 INFO L290 TraceCheckUtils]: 4: Hoare triple {15840#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {15840#true} is VALID [2022-02-20 22:02:58,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {15840#true} assume true; {15840#true} is VALID [2022-02-20 22:02:58,335 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {15840#true} {15840#true} #910#return; {15840#true} is VALID [2022-02-20 22:02:58,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {15840#true} main_~tmp~13#1.base, main_~tmp~13#1.offset := main_#t~ret125#1.base, main_#t~ret125#1.offset;havoc main_#t~ret125#1.base, main_#t~ret125#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~13#1.base, main_~tmp~13#1.offset; {15840#true} is VALID [2022-02-20 22:02:58,336 INFO L272 TraceCheckUtils]: 8: Hoare triple {15840#true} call main_#t~ret126#1.base, main_#t~ret126#1.offset := ldv_zalloc(16); {15866#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:58,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {15866#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {15840#true} is VALID [2022-02-20 22:02:58,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {15840#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {15840#true} is VALID [2022-02-20 22:02:58,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {15840#true} assume true; {15840#true} is VALID [2022-02-20 22:02:58,338 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15840#true} {15840#true} #912#return; {15840#true} is VALID [2022-02-20 22:02:58,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {15840#true} main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset := main_#t~ret126#1.base, main_#t~ret126#1.offset;havoc main_#t~ret126#1.base, main_#t~ret126#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset; {15840#true} is VALID [2022-02-20 22:02:58,339 INFO L272 TraceCheckUtils]: 14: Hoare triple {15840#true} call main_#t~ret127#1.base, main_#t~ret127#1.offset := ldv_zalloc(16); {15866#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:58,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {15866#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {15840#true} is VALID [2022-02-20 22:02:58,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {15840#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {15840#true} is VALID [2022-02-20 22:02:58,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {15840#true} assume true; {15840#true} is VALID [2022-02-20 22:02:58,339 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15840#true} {15840#true} #914#return; {15840#true} is VALID [2022-02-20 22:02:58,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {15840#true} main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset := main_#t~ret127#1.base, main_#t~ret127#1.offset;havoc main_#t~ret127#1.base, main_#t~ret127#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;assume { :begin_inline_ldv_initialize } true; {15840#true} is VALID [2022-02-20 22:02:58,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {15840#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {15854#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 22:02:58,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {15854#(= ~ldv_state_variable_1~0 0)} assume -2147483648 <= main_#t~nondet128#1 && main_#t~nondet128#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet128#1;havoc main_#t~nondet128#1;main_#t~switch129#1 := 0 == main_~tmp___2~3#1; {15854#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 22:02:58,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {15854#(= ~ldv_state_variable_1~0 0)} assume main_#t~switch129#1; {15854#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 22:02:58,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {15854#(= ~ldv_state_variable_1~0 0)} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet130#1 && main_#t~nondet130#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet130#1;havoc main_#t~nondet130#1;main_#t~switch131#1 := 0 == main_~tmp___3~2#1; {15841#false} is VALID [2022-02-20 22:02:58,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {15841#false} assume main_#t~switch131#1; {15841#false} is VALID [2022-02-20 22:02:58,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {15841#false} assume 2 == ~ldv_state_variable_1~0; {15841#false} is VALID [2022-02-20 22:02:58,342 INFO L272 TraceCheckUtils]: 26: Hoare triple {15841#false} call main_#t~ret132#1 := torture_spin_lock_write_lock_irq(); {15867#(and (= ~ldv_spin~0 |old(~ldv_spin~0)|) (= |#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:02:58,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {15867#(and (= ~ldv_spin~0 |old(~ldv_spin~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} havoc ~flags~0; {15840#true} is VALID [2022-02-20 22:02:58,342 INFO L272 TraceCheckUtils]: 28: Hoare triple {15840#true} call ldv_spin_lock(); {15871#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 22:02:58,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {15871#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {15840#true} is VALID [2022-02-20 22:02:58,343 INFO L290 TraceCheckUtils]: 30: Hoare triple {15840#true} assume true; {15840#true} is VALID [2022-02-20 22:02:58,343 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15840#true} {15840#true} #892#return; {15840#true} is VALID [2022-02-20 22:02:58,343 INFO L290 TraceCheckUtils]: 32: Hoare triple {15840#true} call write~int(~flags~0, ~cur_ops~0.base, 32 + ~cur_ops~0.offset, 8);#res := 0; {15840#true} is VALID [2022-02-20 22:02:58,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {15840#true} assume true; {15840#true} is VALID [2022-02-20 22:02:58,343 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15840#true} {15841#false} #916#return; {15841#false} is VALID [2022-02-20 22:02:58,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {15841#false} assume -2147483648 <= main_#t~ret132#1 && main_#t~ret132#1 <= 2147483647;havoc main_#t~ret132#1;~ldv_state_variable_1~0 := 2; {15841#false} is VALID [2022-02-20 22:02:58,345 INFO L290 TraceCheckUtils]: 36: Hoare triple {15841#false} assume -2147483648 <= main_#t~nondet128#1 && main_#t~nondet128#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet128#1;havoc main_#t~nondet128#1;main_#t~switch129#1 := 0 == main_~tmp___2~3#1; {15841#false} is VALID [2022-02-20 22:02:58,345 INFO L290 TraceCheckUtils]: 37: Hoare triple {15841#false} assume !main_#t~switch129#1;main_#t~switch129#1 := main_#t~switch129#1 || 1 == main_~tmp___2~3#1; {15841#false} is VALID [2022-02-20 22:02:58,345 INFO L290 TraceCheckUtils]: 38: Hoare triple {15841#false} assume main_#t~switch129#1; {15841#false} is VALID [2022-02-20 22:02:58,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {15841#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet135#1 && main_#t~nondet135#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet135#1;havoc main_#t~nondet135#1;main_#t~switch136#1 := 0 == main_~tmp___4~2#1; {15841#false} is VALID [2022-02-20 22:02:58,345 INFO L290 TraceCheckUtils]: 40: Hoare triple {15841#false} assume !main_#t~switch136#1;main_#t~switch136#1 := main_#t~switch136#1 || 1 == main_~tmp___4~2#1; {15841#false} is VALID [2022-02-20 22:02:58,346 INFO L290 TraceCheckUtils]: 41: Hoare triple {15841#false} assume main_#t~switch136#1; {15841#false} is VALID [2022-02-20 22:02:58,346 INFO L290 TraceCheckUtils]: 42: Hoare triple {15841#false} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_lock_torture_init } true;havoc lock_torture_init_#res#1;havoc lock_torture_init_#t~ret101#1, lock_torture_init_#t~mem102#1.base, lock_torture_init_#t~mem102#1.offset, lock_torture_init_#t~mem103#1.base, lock_torture_init_#t~mem103#1.offset, lock_torture_init_#t~nondet104#1, lock_torture_init_#t~nondet105#1, lock_torture_init_#t~nondet106#1, lock_torture_init_#t~nondet107#1, lock_torture_init_#t~mem108#1.base, lock_torture_init_#t~mem108#1.offset, lock_torture_init_#t~mem109#1.base, lock_torture_init_#t~mem109#1.offset, lock_torture_init_#t~nondet110#1, lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset, lock_torture_init_#t~mem113#1.base, lock_torture_init_#t~mem113#1.offset, lock_torture_init_#t~ret114#1, lock_torture_init_#t~ret115#1.base, lock_torture_init_#t~ret115#1.offset, lock_torture_init_#t~nondet116#1, lock_torture_init_#t~ret117#1, lock_torture_init_#t~ret118#1, lock_torture_init_#t~ret119#1, lock_torture_init_#t~ret120#1, lock_torture_init_#t~ret121#1.base, lock_torture_init_#t~ret121#1.offset, lock_torture_init_#t~nondet122#1, lock_torture_init_#t~ret123#1, lock_torture_init_#t~ret124#1, lock_torture_init_~i~2#1, lock_torture_init_~firsterr~0#1, lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset, lock_torture_init_~tmp~12#1, lock_torture_init_~tmp___0~9#1, lock_torture_init_~tmp___1~3#1, lock_torture_init_~tmp___2~2#1, lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset, lock_torture_init_~tmp___4~1#1.base, lock_torture_init_~tmp___4~1#1.offset;havoc lock_torture_init_~i~2#1;havoc lock_torture_init_~firsterr~0#1;call lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset := #Ultimate.allocOnStack(24);havoc lock_torture_init_~tmp~12#1;havoc lock_torture_init_~tmp___0~9#1;havoc lock_torture_init_~tmp___1~3#1;havoc lock_torture_init_~tmp___2~2#1;havoc lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset;havoc lock_torture_init_~tmp___4~1#1.base, lock_torture_init_~tmp___4~1#1.offset;lock_torture_init_~firsterr~0#1 := 0;call write~$Pointer$(~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset, 8);call write~$Pointer$(~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, 8 + lock_torture_init_~#torture_ops~0#1.offset, 8);call write~$Pointer$(~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, 16 + lock_torture_init_~#torture_ops~0#1.offset, 8);assume { :begin_inline_torture_init_begin } true;torture_init_begin_#in~arg0#1.base, torture_init_begin_#in~arg0#1.offset, torture_init_begin_#in~arg1#1, torture_init_begin_#in~arg2#1.base, torture_init_begin_#in~arg2#1.offset := ~torture_type~0.base, ~torture_type~0.offset, (if 0 == ~verbose~0 % 256 then 0 else 1), ~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset;havoc torture_init_begin_#res#1;havoc torture_init_begin_#t~nondet165#1, torture_init_begin_~arg0#1.base, torture_init_begin_~arg0#1.offset, torture_init_begin_~arg1#1, torture_init_begin_~arg2#1.base, torture_init_begin_~arg2#1.offset;torture_init_begin_~arg0#1.base, torture_init_begin_~arg0#1.offset := torture_init_begin_#in~arg0#1.base, torture_init_begin_#in~arg0#1.offset;torture_init_begin_~arg1#1 := torture_init_begin_#in~arg1#1;torture_init_begin_~arg2#1.base, torture_init_begin_~arg2#1.offset := torture_init_begin_#in~arg2#1.base, torture_init_begin_#in~arg2#1.offset;torture_init_begin_#res#1 := torture_init_begin_#t~nondet165#1;havoc torture_init_begin_#t~nondet165#1; {15841#false} is VALID [2022-02-20 22:02:58,346 INFO L290 TraceCheckUtils]: 43: Hoare triple {15841#false} lock_torture_init_#t~ret101#1 := torture_init_begin_#res#1;assume { :end_inline_torture_init_begin } true;lock_torture_init_~tmp~12#1 := lock_torture_init_#t~ret101#1;havoc lock_torture_init_#t~ret101#1; {15841#false} is VALID [2022-02-20 22:02:58,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {15841#false} assume 0 != lock_torture_init_~tmp~12#1 % 256;lock_torture_init_~tmp___0~9#1 := 0; {15841#false} is VALID [2022-02-20 22:02:58,346 INFO L290 TraceCheckUtils]: 45: Hoare triple {15841#false} assume !(0 != lock_torture_init_~tmp___0~9#1);lock_torture_init_~i~2#1 := 0; {15841#false} is VALID [2022-02-20 22:02:58,347 INFO L290 TraceCheckUtils]: 46: Hoare triple {15841#false} assume !(lock_torture_init_~i~2#1 % 4294967296 <= 2); {15841#false} is VALID [2022-02-20 22:02:58,347 INFO L290 TraceCheckUtils]: 47: Hoare triple {15841#false} assume !(3 == lock_torture_init_~i~2#1);call lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset := read~$Pointer$(~cur_ops~0.base, ~cur_ops~0.offset, 8); {15841#false} is VALID [2022-02-20 22:02:58,347 INFO L290 TraceCheckUtils]: 48: Hoare triple {15841#false} assume !(0 != (lock_torture_init_#t~mem111#1.base + lock_torture_init_#t~mem111#1.offset) % 18446744073709551616);havoc lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset; {15841#false} is VALID [2022-02-20 22:02:58,347 INFO L290 TraceCheckUtils]: 49: Hoare triple {15841#false} assume !(~nwriters_stress~0 >= 0);assume { :begin_inline_cpumask_weight } true;cpumask_weight_#in~srcp#1.base, cpumask_weight_#in~srcp#1.offset := ~cpu_online_mask~0.base, ~cpu_online_mask~0.offset;havoc cpumask_weight_#res#1;havoc cpumask_weight_#t~ret12#1, cpumask_weight_~srcp#1.base, cpumask_weight_~srcp#1.offset, cpumask_weight_~tmp~0#1;cpumask_weight_~srcp#1.base, cpumask_weight_~srcp#1.offset := cpumask_weight_#in~srcp#1.base, cpumask_weight_#in~srcp#1.offset;havoc cpumask_weight_~tmp~0#1;assume { :begin_inline_bitmap_weight } true;bitmap_weight_#in~src#1.base, bitmap_weight_#in~src#1.offset, bitmap_weight_#in~nbits#1 := cpumask_weight_~srcp#1.base, cpumask_weight_~srcp#1.offset, ~nr_cpu_ids~0;havoc bitmap_weight_#res#1;havoc bitmap_weight_#t~ret11#1, bitmap_weight_~src#1.base, bitmap_weight_~src#1.offset, bitmap_weight_~nbits#1, bitmap_weight_~tmp___0~0#1;bitmap_weight_~src#1.base, bitmap_weight_~src#1.offset := bitmap_weight_#in~src#1.base, bitmap_weight_#in~src#1.offset;bitmap_weight_~nbits#1 := bitmap_weight_#in~nbits#1;havoc bitmap_weight_~tmp___0~0#1;assume { :begin_inline___bitmap_weight } true;__bitmap_weight_#in~arg0#1.base, __bitmap_weight_#in~arg0#1.offset, __bitmap_weight_#in~arg1#1 := bitmap_weight_~src#1.base, bitmap_weight_~src#1.offset, bitmap_weight_~nbits#1;havoc __bitmap_weight_#res#1;havoc __bitmap_weight_#t~nondet151#1, __bitmap_weight_~arg0#1.base, __bitmap_weight_~arg0#1.offset, __bitmap_weight_~arg1#1;__bitmap_weight_~arg0#1.base, __bitmap_weight_~arg0#1.offset := __bitmap_weight_#in~arg0#1.base, __bitmap_weight_#in~arg0#1.offset;__bitmap_weight_~arg1#1 := __bitmap_weight_#in~arg1#1;assume -2147483648 <= __bitmap_weight_#t~nondet151#1 && __bitmap_weight_#t~nondet151#1 <= 2147483647;__bitmap_weight_#res#1 := __bitmap_weight_#t~nondet151#1;havoc __bitmap_weight_#t~nondet151#1; {15841#false} is VALID [2022-02-20 22:02:58,347 INFO L290 TraceCheckUtils]: 50: Hoare triple {15841#false} bitmap_weight_#t~ret11#1 := __bitmap_weight_#res#1;assume { :end_inline___bitmap_weight } true;assume -2147483648 <= bitmap_weight_#t~ret11#1 && bitmap_weight_#t~ret11#1 <= 2147483647;bitmap_weight_~tmp___0~0#1 := bitmap_weight_#t~ret11#1;havoc bitmap_weight_#t~ret11#1;bitmap_weight_#res#1 := bitmap_weight_~tmp___0~0#1; {15841#false} is VALID [2022-02-20 22:02:58,347 INFO L290 TraceCheckUtils]: 51: Hoare triple {15841#false} cpumask_weight_#t~ret12#1 := bitmap_weight_#res#1;assume { :end_inline_bitmap_weight } true;assume -2147483648 <= cpumask_weight_#t~ret12#1 && cpumask_weight_#t~ret12#1 <= 2147483647;cpumask_weight_~tmp~0#1 := cpumask_weight_#t~ret12#1;havoc cpumask_weight_#t~ret12#1;cpumask_weight_#res#1 := cpumask_weight_~tmp~0#1; {15841#false} is VALID [2022-02-20 22:02:58,348 INFO L290 TraceCheckUtils]: 52: Hoare triple {15841#false} lock_torture_init_#t~ret114#1 := cpumask_weight_#res#1;assume { :end_inline_cpumask_weight } true;lock_torture_init_~tmp___2~2#1 := lock_torture_init_#t~ret114#1;havoc lock_torture_init_#t~ret114#1;~nrealwriters_stress~0 := (if 2 * lock_torture_init_~tmp___2~2#1 % 4294967296 % 4294967296 <= 2147483647 then 2 * lock_torture_init_~tmp___2~2#1 % 4294967296 % 4294967296 else 2 * lock_torture_init_~tmp___2~2#1 % 4294967296 % 4294967296 - 4294967296); {15841#false} is VALID [2022-02-20 22:02:58,348 INFO L272 TraceCheckUtils]: 53: Hoare triple {15841#false} call lock_torture_print_module_parms(~cur_ops~0.base, ~cur_ops~0.offset, 36, 0); {15840#true} is VALID [2022-02-20 22:02:58,348 INFO L290 TraceCheckUtils]: 54: Hoare triple {15840#true} ~cur_ops___0.base, ~cur_ops___0.offset := #in~cur_ops___0.base, #in~cur_ops___0.offset;~tag.base, ~tag.offset := #in~tag.base, #in~tag.offset;havoc #t~nondet97; {15840#true} is VALID [2022-02-20 22:02:58,348 INFO L290 TraceCheckUtils]: 55: Hoare triple {15840#true} assume true; {15840#true} is VALID [2022-02-20 22:02:58,353 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {15840#true} {15841#false} #934#return; {15841#false} is VALID [2022-02-20 22:02:58,353 INFO L290 TraceCheckUtils]: 57: Hoare triple {15841#false} ~lock_is_write_held~0 := 0; {15841#false} is VALID [2022-02-20 22:02:58,353 INFO L272 TraceCheckUtils]: 58: Hoare triple {15841#false} call lock_torture_init_#t~ret115#1.base, lock_torture_init_#t~ret115#1.offset := kmalloc(16 * ~nrealwriters_stress~0, 208); {15841#false} is VALID [2022-02-20 22:02:58,354 INFO L290 TraceCheckUtils]: 59: Hoare triple {15841#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1; {15841#false} is VALID [2022-02-20 22:02:58,354 INFO L272 TraceCheckUtils]: 60: Hoare triple {15841#false} call ldv_check_alloc_flags(~flags#1); {15841#false} is VALID [2022-02-20 22:02:58,354 INFO L290 TraceCheckUtils]: 61: Hoare triple {15841#false} ~flags := #in~flags; {15841#false} is VALID [2022-02-20 22:02:58,354 INFO L290 TraceCheckUtils]: 62: Hoare triple {15841#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {15841#false} is VALID [2022-02-20 22:02:58,354 INFO L272 TraceCheckUtils]: 63: Hoare triple {15841#false} call ldv_error(); {15841#false} is VALID [2022-02-20 22:02:58,355 INFO L290 TraceCheckUtils]: 64: Hoare triple {15841#false} assume !false; {15841#false} is VALID [2022-02-20 22:02:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 22:02:58,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:02:58,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301475429] [2022-02-20 22:02:58,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301475429] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:02:58,357 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:02:58,357 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:02:58,357 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392947941] [2022-02-20 22:02:58,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:02:58,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2022-02-20 22:02:58,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:02:58,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:02:58,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:02:58,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:02:58,410 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:02:58,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:02:58,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:02:58,411 INFO L87 Difference]: Start difference. First operand 932 states and 1305 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:03:02,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:03:02,614 INFO L93 Difference]: Finished difference Result 2764 states and 3873 transitions. [2022-02-20 22:03:02,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 22:03:02,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2022-02-20 22:03:02,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:03:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:03:02,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1412 transitions. [2022-02-20 22:03:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:03:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1412 transitions. [2022-02-20 22:03:02,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1412 transitions. [2022-02-20 22:03:03,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1412 edges. 1412 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:03:03,931 INFO L225 Difference]: With dead ends: 2764 [2022-02-20 22:03:03,931 INFO L226 Difference]: Without dead ends: 1852 [2022-02-20 22:03:03,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 22:03:03,935 INFO L933 BasicCegarLoop]: 462 mSDtfsCounter, 1112 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 22:03:03,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1149 Valid, 1098 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 22:03:03,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2022-02-20 22:03:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1659. [2022-02-20 22:03:04,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:03:04,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1852 states. Second operand has 1659 states, 1288 states have (on average 1.4122670807453417) internal successors, (1819), 1328 states have internal predecessors, (1819), 247 states have call successors, (247), 126 states have call predecessors, (247), 123 states have return successors, (246), 228 states have call predecessors, (246), 242 states have call successors, (246) [2022-02-20 22:03:04,341 INFO L74 IsIncluded]: Start isIncluded. First operand 1852 states. Second operand has 1659 states, 1288 states have (on average 1.4122670807453417) internal successors, (1819), 1328 states have internal predecessors, (1819), 247 states have call successors, (247), 126 states have call predecessors, (247), 123 states have return successors, (246), 228 states have call predecessors, (246), 242 states have call successors, (246) [2022-02-20 22:03:04,345 INFO L87 Difference]: Start difference. First operand 1852 states. Second operand has 1659 states, 1288 states have (on average 1.4122670807453417) internal successors, (1819), 1328 states have internal predecessors, (1819), 247 states have call successors, (247), 126 states have call predecessors, (247), 123 states have return successors, (246), 228 states have call predecessors, (246), 242 states have call successors, (246) [2022-02-20 22:03:04,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:03:04,501 INFO L93 Difference]: Finished difference Result 1852 states and 2587 transitions. [2022-02-20 22:03:04,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2587 transitions. [2022-02-20 22:03:04,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:03:04,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:03:04,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 1659 states, 1288 states have (on average 1.4122670807453417) internal successors, (1819), 1328 states have internal predecessors, (1819), 247 states have call successors, (247), 126 states have call predecessors, (247), 123 states have return successors, (246), 228 states have call predecessors, (246), 242 states have call successors, (246) Second operand 1852 states. [2022-02-20 22:03:04,514 INFO L87 Difference]: Start difference. First operand has 1659 states, 1288 states have (on average 1.4122670807453417) internal successors, (1819), 1328 states have internal predecessors, (1819), 247 states have call successors, (247), 126 states have call predecessors, (247), 123 states have return successors, (246), 228 states have call predecessors, (246), 242 states have call successors, (246) Second operand 1852 states. [2022-02-20 22:03:04,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:03:04,681 INFO L93 Difference]: Finished difference Result 1852 states and 2587 transitions. [2022-02-20 22:03:04,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2587 transitions. [2022-02-20 22:03:04,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:03:04,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:03:04,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:03:04,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:03:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1288 states have (on average 1.4122670807453417) internal successors, (1819), 1328 states have internal predecessors, (1819), 247 states have call successors, (247), 126 states have call predecessors, (247), 123 states have return successors, (246), 228 states have call predecessors, (246), 242 states have call successors, (246) [2022-02-20 22:03:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2312 transitions. [2022-02-20 22:03:04,845 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2312 transitions. Word has length 65 [2022-02-20 22:03:04,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:03:04,845 INFO L470 AbstractCegarLoop]: Abstraction has 1659 states and 2312 transitions. [2022-02-20 22:03:04,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:03:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2312 transitions. [2022-02-20 22:03:04,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 22:03:04,850 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:03:04,850 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 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:03:04,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 22:03:04,850 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:03:04,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:03:04,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1750010362, now seen corresponding path program 1 times [2022-02-20 22:03:04,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:03:04,851 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314764698] [2022-02-20 22:03:04,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:03:04,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:03:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:04,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:03:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:04,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {25631#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {25604#true} is VALID [2022-02-20 22:03:04,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {25604#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {25604#true} is VALID [2022-02-20 22:03:04,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {25604#true} assume true; {25604#true} is VALID [2022-02-20 22:03:04,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25604#true} {25604#true} #910#return; {25604#true} is VALID [2022-02-20 22:03:04,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:03:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:04,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {25631#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {25604#true} is VALID [2022-02-20 22:03:04,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {25604#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {25604#true} is VALID [2022-02-20 22:03:04,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {25604#true} assume true; {25604#true} is VALID [2022-02-20 22:03:04,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25604#true} {25604#true} #912#return; {25604#true} is VALID [2022-02-20 22:03:04,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:03:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:04,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {25631#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {25604#true} is VALID [2022-02-20 22:03:04,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {25604#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {25604#true} is VALID [2022-02-20 22:03:04,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {25604#true} assume true; {25604#true} is VALID [2022-02-20 22:03:04,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25604#true} {25604#true} #914#return; {25604#true} is VALID [2022-02-20 22:03:04,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 22:03:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:04,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:03:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:04,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {25636#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {25604#true} is VALID [2022-02-20 22:03:04,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {25604#true} assume true; {25604#true} is VALID [2022-02-20 22:03:04,962 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25604#true} {25604#true} #892#return; {25604#true} is VALID [2022-02-20 22:03:04,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {25632#(and (= ~ldv_spin~0 |old(~ldv_spin~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} havoc ~flags~0; {25604#true} is VALID [2022-02-20 22:03:04,963 INFO L272 TraceCheckUtils]: 1: Hoare triple {25604#true} call ldv_spin_lock(); {25636#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 22:03:04,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {25636#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {25604#true} is VALID [2022-02-20 22:03:04,963 INFO L290 TraceCheckUtils]: 3: Hoare triple {25604#true} assume true; {25604#true} is VALID [2022-02-20 22:03:04,963 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25604#true} {25604#true} #892#return; {25604#true} is VALID [2022-02-20 22:03:04,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {25604#true} call write~int(~flags~0, ~cur_ops~0.base, 32 + ~cur_ops~0.offset, 8);#res := 0; {25604#true} is VALID [2022-02-20 22:03:04,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {25604#true} assume true; {25604#true} is VALID [2022-02-20 22:03:04,964 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {25604#true} {25605#false} #916#return; {25605#false} is VALID [2022-02-20 22:03:04,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-02-20 22:03:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:04,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {25604#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset; {25604#true} is VALID [2022-02-20 22:03:04,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {25604#true} assume true; {25604#true} is VALID [2022-02-20 22:03:04,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25604#true} {25605#false} #882#return; {25605#false} is VALID [2022-02-20 22:03:04,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {25604#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(100, 2);call #Ultimate.allocInit(10, 3);call #Ultimate.allocInit(12, 4);call #Ultimate.allocInit(17, 5);call #Ultimate.allocInit(10, 6);call #Ultimate.allocInit(14, 7);call #Ultimate.allocInit(17, 8);call #Ultimate.allocInit(33, 9);call #Ultimate.allocInit(216, 10);call #Ultimate.allocInit(20, 11);call #Ultimate.allocInit(20, 12);call #Ultimate.allocInit(6, 13);call write~init~int(37, 13, 0, 1);call write~init~int(115, 13, 1, 1);call write~init~int(37, 13, 2, 1);call write~init~int(115, 13, 3, 1);call write~init~int(32, 13, 4, 1);call write~init~int(0, 13, 5, 1);call #Ultimate.allocInit(10, 14);call #Ultimate.allocInit(56, 15);call #Ultimate.allocInit(4, 16);call write~init~int(63, 16, 0, 1);call write~init~int(63, 16, 1, 1);call write~init~int(63, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(1, 17);call write~init~int(0, 17, 0, 1);call #Ultimate.allocInit(4, 18);call write~init~int(33, 18, 0, 1);call write~init~int(33, 18, 1, 1);call write~init~int(33, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(1, 19);call write~init~int(0, 19, 0, 1);call #Ultimate.allocInit(51, 20);call #Ultimate.allocInit(4, 21);call write~init~int(9, 21, 0, 1);call write~init~int(37, 21, 1, 1);call write~init~int(115, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(32, 23);call #Ultimate.allocInit(19, 24);call #Ultimate.allocInit(19, 25);call #Ultimate.allocInit(151, 26);call #Ultimate.allocInit(34, 27);call #Ultimate.allocInit(33, 28);call #Ultimate.allocInit(21, 29);call #Ultimate.allocInit(26, 30);call #Ultimate.allocInit(21, 31);call #Ultimate.allocInit(43, 32);call #Ultimate.allocInit(21, 33);call #Ultimate.allocInit(5, 34);call write~init~int(9, 34, 0, 1);call write~init~int(32, 34, 1, 1);call write~init~int(37, 34, 2, 1);call write~init~int(115, 34, 3, 1);call write~init~int(0, 34, 4, 1);call #Ultimate.allocInit(3, 35);call write~init~int(9, 35, 0, 1);call write~init~int(10, 35, 1, 1);call write~init~int(0, 35, 2, 1);call #Ultimate.allocInit(14, 36);call #Ultimate.allocInit(17, 37);call #Ultimate.allocInit(20, 38);call #Ultimate.allocInit(20, 39);call #Ultimate.allocInit(28, 40);call #Ultimate.allocInit(20, 41);call #Ultimate.allocInit(34, 42);call #Ultimate.allocInit(37, 43);call #Ultimate.allocInit(19, 44);call #Ultimate.allocInit(33, 45);call #Ultimate.allocInit(36, 46);~ldv_state_variable_3~0 := 0;~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~nwriters_stress~0 := -1;~onoff_holdoff~0 := 0;~onoff_interval~0 := 0;~shuffle_interval~0 := 3;~shutdown_secs~0 := 0;~stat_interval~0 := 60;~stutter~0 := 5;~verbose~0 := 1;~torture_type~0.base, ~torture_type~0.offset := 3, 0;~#n_lock_torture_errors~0.base, ~#n_lock_torture_errors~0.offset := 47, 0;call #Ultimate.allocInit(4, 47);call write~init~int(0, ~#n_lock_torture_errors~0.base, ~#n_lock_torture_errors~0.offset, 4);~#stats_task~0.base, ~#stats_task~0.offset := 48, 0;call #Ultimate.allocInit(8, 48);call write~init~$Pointer$(0, 0, ~#stats_task~0.base, ~#stats_task~0.offset, 8);~writer_tasks~0.base, ~writer_tasks~0.offset := 0, 0;~nrealwriters_stress~0 := 0;~lock_is_write_held~0 := 0;~lwsa~0.base, ~lwsa~0.offset := 0, 0;~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset := 49, 0;call #Ultimate.allocInit(4, 49);call write~init~int(1, ~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset, 4);~cur_ops~0.base, ~cur_ops~0.offset := 0, 0;~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset := 50, 0;call #Ultimate.allocInit(48, 50);call write~init~$Pointer$(0, 0, ~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_lock.base, #funAddr~torture_lock_busted_write_lock.offset, ~#lock_busted_ops~0.base, 8 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_delay.base, #funAddr~torture_lock_busted_write_delay.offset, ~#lock_busted_ops~0.base, 16 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_unlock.base, #funAddr~torture_lock_busted_write_unlock.offset, ~#lock_busted_ops~0.base, 24 + ~#lock_busted_ops~0.offset, 8);call write~init~int(0, ~#lock_busted_ops~0.base, 32 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(4, 0, ~#lock_busted_ops~0.base, 40 + ~#lock_busted_ops~0.offset, 8);~#torture_spinlock~0.base, ~#torture_spinlock~0.offset := 51, 0;call #Ultimate.allocInit(68, 51);call write~init~int(0, ~#torture_spinlock~0.base, ~#torture_spinlock~0.offset, 4);call write~init~int(3735899821, ~#torture_spinlock~0.base, 4 + ~#torture_spinlock~0.offset, 4);call write~init~int(4294967295, ~#torture_spinlock~0.base, 8 + ~#torture_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#torture_spinlock~0.base, 12 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 20 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 28 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 36 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(5, 0, ~#torture_spinlock~0.base, 44 + ~#torture_spinlock~0.offset, 8);call write~init~int(0, ~#torture_spinlock~0.base, 52 + ~#torture_spinlock~0.offset, 4);call write~init~int(0, ~#torture_spinlock~0.base, 56 + ~#torture_spinlock~0.offset, 8);~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset := 52, 0;call #Ultimate.allocInit(48, 52);call write~init~$Pointer$(0, 0, ~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_lock.base, #funAddr~torture_spin_lock_write_lock.offset, ~#spin_lock_ops~0.base, 8 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_delay.base, #funAddr~torture_spin_lock_write_delay.offset, ~#spin_lock_ops~0.base, 16 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_unlock.base, #funAddr~torture_spin_lock_write_unlock.offset, ~#spin_lock_ops~0.base, 24 + ~#spin_lock_ops~0.offset, 8);call write~init~int(0, ~#spin_lock_ops~0.base, 32 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(6, 0, ~#spin_lock_ops~0.base, 40 + ~#spin_lock_ops~0.offset, 8);~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset := 53, 0;call #Ultimate.allocInit(48, 53);call write~init~$Pointer$(0, 0, ~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_lock_irq.base, #funAddr~torture_spin_lock_write_lock_irq.offset, ~#spin_lock_irq_ops~0.base, 8 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_delay.base, #funAddr~torture_spin_lock_write_delay.offset, ~#spin_lock_irq_ops~0.base, 16 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_spin_write_unlock_irq.base, #funAddr~torture_lock_spin_write_unlock_irq.offset, ~#spin_lock_irq_ops~0.base, 24 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~int(0, ~#spin_lock_irq_ops~0.base, 32 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(7, 0, ~#spin_lock_irq_ops~0.base, 40 + ~#spin_lock_irq_ops~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_spin~0 := 0; {25604#true} is VALID [2022-02-20 22:03:04,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {25604#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret125#1.base, main_#t~ret125#1.offset, main_#t~ret126#1.base, main_#t~ret126#1.offset, main_#t~ret127#1.base, main_#t~ret127#1.offset, main_#t~nondet128#1, main_#t~switch129#1, main_#t~nondet130#1, main_#t~switch131#1, main_#t~ret132#1, main_#t~ret133#1, main_#t~ret134#1, main_#t~nondet135#1, main_#t~switch136#1, main_#t~ret137#1, main_#t~nondet138#1, main_#t~switch139#1, main_#t~ret140#1, main_#t~ret141#1, main_#t~ret142#1, main_#t~nondet143#1, main_#t~switch144#1, main_#t~ret145#1, main_#t~ret146#1, main_#t~ret147#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~13#1.base, main_~tmp~13#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset, main_~tmp___2~3#1, main_~tmp___3~2#1, main_~tmp___4~2#1, main_~tmp___5~1#1, main_~tmp___6~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~13#1.base, main_~tmp~13#1.offset;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;havoc main_~tmp___2~3#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1;havoc main_~tmp___5~1#1;havoc main_~tmp___6~1#1; {25604#true} is VALID [2022-02-20 22:03:04,970 INFO L272 TraceCheckUtils]: 2: Hoare triple {25604#true} call main_#t~ret125#1.base, main_#t~ret125#1.offset := ldv_zalloc(16); {25631#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:04,970 INFO L290 TraceCheckUtils]: 3: Hoare triple {25631#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {25604#true} is VALID [2022-02-20 22:03:04,970 INFO L290 TraceCheckUtils]: 4: Hoare triple {25604#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {25604#true} is VALID [2022-02-20 22:03:04,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {25604#true} assume true; {25604#true} is VALID [2022-02-20 22:03:04,971 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {25604#true} {25604#true} #910#return; {25604#true} is VALID [2022-02-20 22:03:04,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {25604#true} main_~tmp~13#1.base, main_~tmp~13#1.offset := main_#t~ret125#1.base, main_#t~ret125#1.offset;havoc main_#t~ret125#1.base, main_#t~ret125#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~13#1.base, main_~tmp~13#1.offset; {25604#true} is VALID [2022-02-20 22:03:04,972 INFO L272 TraceCheckUtils]: 8: Hoare triple {25604#true} call main_#t~ret126#1.base, main_#t~ret126#1.offset := ldv_zalloc(16); {25631#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:04,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {25631#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {25604#true} is VALID [2022-02-20 22:03:04,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {25604#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {25604#true} is VALID [2022-02-20 22:03:04,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {25604#true} assume true; {25604#true} is VALID [2022-02-20 22:03:04,972 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {25604#true} {25604#true} #912#return; {25604#true} is VALID [2022-02-20 22:03:04,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {25604#true} main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset := main_#t~ret126#1.base, main_#t~ret126#1.offset;havoc main_#t~ret126#1.base, main_#t~ret126#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset; {25604#true} is VALID [2022-02-20 22:03:04,976 INFO L272 TraceCheckUtils]: 14: Hoare triple {25604#true} call main_#t~ret127#1.base, main_#t~ret127#1.offset := ldv_zalloc(16); {25631#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:04,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {25631#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {25604#true} is VALID [2022-02-20 22:03:04,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {25604#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {25604#true} is VALID [2022-02-20 22:03:04,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {25604#true} assume true; {25604#true} is VALID [2022-02-20 22:03:04,977 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {25604#true} {25604#true} #914#return; {25604#true} is VALID [2022-02-20 22:03:04,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {25604#true} main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset := main_#t~ret127#1.base, main_#t~ret127#1.offset;havoc main_#t~ret127#1.base, main_#t~ret127#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;assume { :begin_inline_ldv_initialize } true; {25604#true} is VALID [2022-02-20 22:03:04,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {25604#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {25604#true} is VALID [2022-02-20 22:03:04,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {25604#true} assume -2147483648 <= main_#t~nondet128#1 && main_#t~nondet128#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet128#1;havoc main_#t~nondet128#1;main_#t~switch129#1 := 0 == main_~tmp___2~3#1; {25604#true} is VALID [2022-02-20 22:03:04,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {25604#true} assume !main_#t~switch129#1;main_#t~switch129#1 := main_#t~switch129#1 || 1 == main_~tmp___2~3#1; {25604#true} is VALID [2022-02-20 22:03:04,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {25604#true} assume main_#t~switch129#1; {25604#true} is VALID [2022-02-20 22:03:04,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {25604#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet135#1 && main_#t~nondet135#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet135#1;havoc main_#t~nondet135#1;main_#t~switch136#1 := 0 == main_~tmp___4~2#1; {25604#true} is VALID [2022-02-20 22:03:04,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {25604#true} assume !main_#t~switch136#1;main_#t~switch136#1 := main_#t~switch136#1 || 1 == main_~tmp___4~2#1; {25604#true} is VALID [2022-02-20 22:03:04,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {25604#true} assume main_#t~switch136#1; {25604#true} is VALID [2022-02-20 22:03:04,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {25604#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_lock_torture_init } true;havoc lock_torture_init_#res#1;havoc lock_torture_init_#t~ret101#1, lock_torture_init_#t~mem102#1.base, lock_torture_init_#t~mem102#1.offset, lock_torture_init_#t~mem103#1.base, lock_torture_init_#t~mem103#1.offset, lock_torture_init_#t~nondet104#1, lock_torture_init_#t~nondet105#1, lock_torture_init_#t~nondet106#1, lock_torture_init_#t~nondet107#1, lock_torture_init_#t~mem108#1.base, lock_torture_init_#t~mem108#1.offset, lock_torture_init_#t~mem109#1.base, lock_torture_init_#t~mem109#1.offset, lock_torture_init_#t~nondet110#1, lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset, lock_torture_init_#t~mem113#1.base, lock_torture_init_#t~mem113#1.offset, lock_torture_init_#t~ret114#1, lock_torture_init_#t~ret115#1.base, lock_torture_init_#t~ret115#1.offset, lock_torture_init_#t~nondet116#1, lock_torture_init_#t~ret117#1, lock_torture_init_#t~ret118#1, lock_torture_init_#t~ret119#1, lock_torture_init_#t~ret120#1, lock_torture_init_#t~ret121#1.base, lock_torture_init_#t~ret121#1.offset, lock_torture_init_#t~nondet122#1, lock_torture_init_#t~ret123#1, lock_torture_init_#t~ret124#1, lock_torture_init_~i~2#1, lock_torture_init_~firsterr~0#1, lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset, lock_torture_init_~tmp~12#1, lock_torture_init_~tmp___0~9#1, lock_torture_init_~tmp___1~3#1, lock_torture_init_~tmp___2~2#1, lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset, lock_torture_init_~tmp___4~1#1.base, lock_torture_init_~tmp___4~1#1.offset;havoc lock_torture_init_~i~2#1;havoc lock_torture_init_~firsterr~0#1;call lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset := #Ultimate.allocOnStack(24);havoc lock_torture_init_~tmp~12#1;havoc lock_torture_init_~tmp___0~9#1;havoc lock_torture_init_~tmp___1~3#1;havoc lock_torture_init_~tmp___2~2#1;havoc lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset;havoc lock_torture_init_~tmp___4~1#1.base, lock_torture_init_~tmp___4~1#1.offset;lock_torture_init_~firsterr~0#1 := 0;call write~$Pointer$(~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset, 8);call write~$Pointer$(~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, 8 + lock_torture_init_~#torture_ops~0#1.offset, 8);call write~$Pointer$(~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, 16 + lock_torture_init_~#torture_ops~0#1.offset, 8);assume { :begin_inline_torture_init_begin } true;torture_init_begin_#in~arg0#1.base, torture_init_begin_#in~arg0#1.offset, torture_init_begin_#in~arg1#1, torture_init_begin_#in~arg2#1.base, torture_init_begin_#in~arg2#1.offset := ~torture_type~0.base, ~torture_type~0.offset, (if 0 == ~verbose~0 % 256 then 0 else 1), ~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset;havoc torture_init_begin_#res#1;havoc torture_init_begin_#t~nondet165#1, torture_init_begin_~arg0#1.base, torture_init_begin_~arg0#1.offset, torture_init_begin_~arg1#1, torture_init_begin_~arg2#1.base, torture_init_begin_~arg2#1.offset;torture_init_begin_~arg0#1.base, torture_init_begin_~arg0#1.offset := torture_init_begin_#in~arg0#1.base, torture_init_begin_#in~arg0#1.offset;torture_init_begin_~arg1#1 := torture_init_begin_#in~arg1#1;torture_init_begin_~arg2#1.base, torture_init_begin_~arg2#1.offset := torture_init_begin_#in~arg2#1.base, torture_init_begin_#in~arg2#1.offset;torture_init_begin_#res#1 := torture_init_begin_#t~nondet165#1;havoc torture_init_begin_#t~nondet165#1; {25604#true} is VALID [2022-02-20 22:03:04,978 INFO L290 TraceCheckUtils]: 28: Hoare triple {25604#true} lock_torture_init_#t~ret101#1 := torture_init_begin_#res#1;assume { :end_inline_torture_init_begin } true;lock_torture_init_~tmp~12#1 := lock_torture_init_#t~ret101#1;havoc lock_torture_init_#t~ret101#1; {25604#true} is VALID [2022-02-20 22:03:04,979 INFO L290 TraceCheckUtils]: 29: Hoare triple {25604#true} assume !(0 != lock_torture_init_~tmp~12#1 % 256);lock_torture_init_~tmp___0~9#1 := 1; {25604#true} is VALID [2022-02-20 22:03:04,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {25604#true} assume 0 != lock_torture_init_~tmp___0~9#1;lock_torture_init_#res#1 := -16;call ULTIMATE.dealloc(lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset);havoc lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset; {25618#(<= (+ |ULTIMATE.start_lock_torture_init_#res#1| 16) 0)} is VALID [2022-02-20 22:03:04,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {25618#(<= (+ |ULTIMATE.start_lock_torture_init_#res#1| 16) 0)} main_#t~ret137#1 := lock_torture_init_#res#1;assume { :end_inline_lock_torture_init } true;assume -2147483648 <= main_#t~ret137#1 && main_#t~ret137#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret137#1;havoc main_#t~ret137#1; {25619#(<= (+ ~ldv_retval_0~0 16) 0)} is VALID [2022-02-20 22:03:04,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {25619#(<= (+ ~ldv_retval_0~0 16) 0)} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_2~0 := 1;~ldv_state_variable_3~0 := 1;~ldv_state_variable_1~0 := 1; {25605#false} is VALID [2022-02-20 22:03:04,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {25605#false} assume !(0 != ~ldv_retval_0~0); {25605#false} is VALID [2022-02-20 22:03:04,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {25605#false} assume -2147483648 <= main_#t~nondet128#1 && main_#t~nondet128#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet128#1;havoc main_#t~nondet128#1;main_#t~switch129#1 := 0 == main_~tmp___2~3#1; {25605#false} is VALID [2022-02-20 22:03:04,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {25605#false} assume main_#t~switch129#1; {25605#false} is VALID [2022-02-20 22:03:04,981 INFO L290 TraceCheckUtils]: 36: Hoare triple {25605#false} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet130#1 && main_#t~nondet130#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet130#1;havoc main_#t~nondet130#1;main_#t~switch131#1 := 0 == main_~tmp___3~2#1; {25605#false} is VALID [2022-02-20 22:03:04,981 INFO L290 TraceCheckUtils]: 37: Hoare triple {25605#false} assume main_#t~switch131#1; {25605#false} is VALID [2022-02-20 22:03:04,981 INFO L290 TraceCheckUtils]: 38: Hoare triple {25605#false} assume 2 == ~ldv_state_variable_1~0; {25605#false} is VALID [2022-02-20 22:03:04,981 INFO L272 TraceCheckUtils]: 39: Hoare triple {25605#false} call main_#t~ret132#1 := torture_spin_lock_write_lock_irq(); {25632#(and (= ~ldv_spin~0 |old(~ldv_spin~0)|) (= |#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:03:04,982 INFO L290 TraceCheckUtils]: 40: Hoare triple {25632#(and (= ~ldv_spin~0 |old(~ldv_spin~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} havoc ~flags~0; {25604#true} is VALID [2022-02-20 22:03:04,982 INFO L272 TraceCheckUtils]: 41: Hoare triple {25604#true} call ldv_spin_lock(); {25636#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 22:03:04,982 INFO L290 TraceCheckUtils]: 42: Hoare triple {25636#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {25604#true} is VALID [2022-02-20 22:03:04,982 INFO L290 TraceCheckUtils]: 43: Hoare triple {25604#true} assume true; {25604#true} is VALID [2022-02-20 22:03:04,982 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {25604#true} {25604#true} #892#return; {25604#true} is VALID [2022-02-20 22:03:04,983 INFO L290 TraceCheckUtils]: 45: Hoare triple {25604#true} call write~int(~flags~0, ~cur_ops~0.base, 32 + ~cur_ops~0.offset, 8);#res := 0; {25604#true} is VALID [2022-02-20 22:03:04,983 INFO L290 TraceCheckUtils]: 46: Hoare triple {25604#true} assume true; {25604#true} is VALID [2022-02-20 22:03:04,983 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {25604#true} {25605#false} #916#return; {25605#false} is VALID [2022-02-20 22:03:04,983 INFO L290 TraceCheckUtils]: 48: Hoare triple {25605#false} assume -2147483648 <= main_#t~ret132#1 && main_#t~ret132#1 <= 2147483647;havoc main_#t~ret132#1;~ldv_state_variable_1~0 := 2; {25605#false} is VALID [2022-02-20 22:03:04,983 INFO L290 TraceCheckUtils]: 49: Hoare triple {25605#false} assume -2147483648 <= main_#t~nondet128#1 && main_#t~nondet128#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet128#1;havoc main_#t~nondet128#1;main_#t~switch129#1 := 0 == main_~tmp___2~3#1; {25605#false} is VALID [2022-02-20 22:03:04,983 INFO L290 TraceCheckUtils]: 50: Hoare triple {25605#false} assume !main_#t~switch129#1;main_#t~switch129#1 := main_#t~switch129#1 || 1 == main_~tmp___2~3#1; {25605#false} is VALID [2022-02-20 22:03:04,984 INFO L290 TraceCheckUtils]: 51: Hoare triple {25605#false} assume main_#t~switch129#1; {25605#false} is VALID [2022-02-20 22:03:04,984 INFO L290 TraceCheckUtils]: 52: Hoare triple {25605#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet135#1 && main_#t~nondet135#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet135#1;havoc main_#t~nondet135#1;main_#t~switch136#1 := 0 == main_~tmp___4~2#1; {25605#false} is VALID [2022-02-20 22:03:04,984 INFO L290 TraceCheckUtils]: 53: Hoare triple {25605#false} assume main_#t~switch136#1; {25605#false} is VALID [2022-02-20 22:03:04,984 INFO L290 TraceCheckUtils]: 54: Hoare triple {25605#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0; {25605#false} is VALID [2022-02-20 22:03:04,984 INFO L272 TraceCheckUtils]: 55: Hoare triple {25605#false} call lock_torture_cleanup(); {25605#false} is VALID [2022-02-20 22:03:04,984 INFO L290 TraceCheckUtils]: 56: Hoare triple {25605#false} havoc ~i~1#1;havoc ~tmp~11#1;havoc ~tmp___0~8#1;havoc ~tmp___1~2#1;assume { :begin_inline_torture_cleanup } true;havoc torture_cleanup_#res#1;havoc torture_cleanup_#t~nondet164#1;torture_cleanup_#res#1 := torture_cleanup_#t~nondet164#1;havoc torture_cleanup_#t~nondet164#1; {25605#false} is VALID [2022-02-20 22:03:04,984 INFO L290 TraceCheckUtils]: 57: Hoare triple {25605#false} #t~ret98#1 := torture_cleanup_#res#1;assume { :end_inline_torture_cleanup } true;~tmp~11#1 := #t~ret98#1;havoc #t~ret98#1; {25605#false} is VALID [2022-02-20 22:03:04,985 INFO L290 TraceCheckUtils]: 58: Hoare triple {25605#false} assume !(0 != ~tmp~11#1 % 256); {25605#false} is VALID [2022-02-20 22:03:04,985 INFO L290 TraceCheckUtils]: 59: Hoare triple {25605#false} assume !(0 != (~writer_tasks~0.base + ~writer_tasks~0.offset) % 18446744073709551616); {25605#false} is VALID [2022-02-20 22:03:04,985 INFO L272 TraceCheckUtils]: 60: Hoare triple {25605#false} call _torture_stop_kthread(28, 0, ~#stats_task~0.base, ~#stats_task~0.offset); {25604#true} is VALID [2022-02-20 22:03:04,985 INFO L290 TraceCheckUtils]: 61: Hoare triple {25604#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset; {25604#true} is VALID [2022-02-20 22:03:04,985 INFO L290 TraceCheckUtils]: 62: Hoare triple {25604#true} assume true; {25604#true} is VALID [2022-02-20 22:03:04,985 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {25604#true} {25605#false} #882#return; {25605#false} is VALID [2022-02-20 22:03:04,985 INFO L272 TraceCheckUtils]: 64: Hoare triple {25605#false} call lock_torture_stats_print(); {25605#false} is VALID [2022-02-20 22:03:04,986 INFO L290 TraceCheckUtils]: 65: Hoare triple {25605#false} havoc ~size~0#1;havoc ~buf~0#1.base, ~buf~0#1.offset;havoc ~tmp~9#1.base, ~tmp~9#1.offset;~size~0#1 := 8192 + 200 * ~nrealwriters_stress~0; {25605#false} is VALID [2022-02-20 22:03:04,986 INFO L272 TraceCheckUtils]: 66: Hoare triple {25605#false} call #t~ret91#1.base, #t~ret91#1.offset := kmalloc(~size~0#1, 208); {25605#false} is VALID [2022-02-20 22:03:04,986 INFO L290 TraceCheckUtils]: 67: Hoare triple {25605#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1; {25605#false} is VALID [2022-02-20 22:03:04,986 INFO L272 TraceCheckUtils]: 68: Hoare triple {25605#false} call ldv_check_alloc_flags(~flags#1); {25605#false} is VALID [2022-02-20 22:03:04,986 INFO L290 TraceCheckUtils]: 69: Hoare triple {25605#false} ~flags := #in~flags; {25605#false} is VALID [2022-02-20 22:03:04,986 INFO L290 TraceCheckUtils]: 70: Hoare triple {25605#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {25605#false} is VALID [2022-02-20 22:03:04,987 INFO L272 TraceCheckUtils]: 71: Hoare triple {25605#false} call ldv_error(); {25605#false} is VALID [2022-02-20 22:03:04,987 INFO L290 TraceCheckUtils]: 72: Hoare triple {25605#false} assume !false; {25605#false} is VALID [2022-02-20 22:03:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 22:03:04,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:03:04,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314764698] [2022-02-20 22:03:04,988 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314764698] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:03:04,988 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:03:04,988 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 22:03:04,988 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208607813] [2022-02-20 22:03:04,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:03:04,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2022-02-20 22:03:04,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:03:04,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:03:05,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:03:05,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 22:03:05,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:03:05,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 22:03:05,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 22:03:05,038 INFO L87 Difference]: Start difference. First operand 1659 states and 2312 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:03:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:03:08,626 INFO L93 Difference]: Finished difference Result 3474 states and 4860 transitions. [2022-02-20 22:03:08,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 22:03:08,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2022-02-20 22:03:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:03:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:03:08,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 965 transitions. [2022-02-20 22:03:08,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:03:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 965 transitions. [2022-02-20 22:03:08,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 965 transitions. [2022-02-20 22:03:09,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 965 edges. 965 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:03:09,598 INFO L225 Difference]: With dead ends: 3474 [2022-02-20 22:03:09,599 INFO L226 Difference]: Without dead ends: 1803 [2022-02-20 22:03:09,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 22:03:09,603 INFO L933 BasicCegarLoop]: 445 mSDtfsCounter, 252 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 22:03:09,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 1536 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 22:03:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2022-02-20 22:03:09,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1639. [2022-02-20 22:03:09,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:03:09,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1803 states. Second operand has 1639 states, 1272 states have (on average 1.404874213836478) internal successors, (1787), 1312 states have internal predecessors, (1787), 243 states have call successors, (243), 126 states have call predecessors, (243), 123 states have return successors, (242), 224 states have call predecessors, (242), 238 states have call successors, (242) [2022-02-20 22:03:09,961 INFO L74 IsIncluded]: Start isIncluded. First operand 1803 states. Second operand has 1639 states, 1272 states have (on average 1.404874213836478) internal successors, (1787), 1312 states have internal predecessors, (1787), 243 states have call successors, (243), 126 states have call predecessors, (243), 123 states have return successors, (242), 224 states have call predecessors, (242), 238 states have call successors, (242) [2022-02-20 22:03:09,964 INFO L87 Difference]: Start difference. First operand 1803 states. Second operand has 1639 states, 1272 states have (on average 1.404874213836478) internal successors, (1787), 1312 states have internal predecessors, (1787), 243 states have call successors, (243), 126 states have call predecessors, (243), 123 states have return successors, (242), 224 states have call predecessors, (242), 238 states have call successors, (242) [2022-02-20 22:03:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:03:10,121 INFO L93 Difference]: Finished difference Result 1803 states and 2515 transitions. [2022-02-20 22:03:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2515 transitions. [2022-02-20 22:03:10,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:03:10,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:03:10,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 1639 states, 1272 states have (on average 1.404874213836478) internal successors, (1787), 1312 states have internal predecessors, (1787), 243 states have call successors, (243), 126 states have call predecessors, (243), 123 states have return successors, (242), 224 states have call predecessors, (242), 238 states have call successors, (242) Second operand 1803 states. [2022-02-20 22:03:10,132 INFO L87 Difference]: Start difference. First operand has 1639 states, 1272 states have (on average 1.404874213836478) internal successors, (1787), 1312 states have internal predecessors, (1787), 243 states have call successors, (243), 126 states have call predecessors, (243), 123 states have return successors, (242), 224 states have call predecessors, (242), 238 states have call successors, (242) Second operand 1803 states. [2022-02-20 22:03:10,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:03:10,287 INFO L93 Difference]: Finished difference Result 1803 states and 2515 transitions. [2022-02-20 22:03:10,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2515 transitions. [2022-02-20 22:03:10,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:03:10,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:03:10,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:03:10,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:03:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1272 states have (on average 1.404874213836478) internal successors, (1787), 1312 states have internal predecessors, (1787), 243 states have call successors, (243), 126 states have call predecessors, (243), 123 states have return successors, (242), 224 states have call predecessors, (242), 238 states have call successors, (242) [2022-02-20 22:03:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2272 transitions. [2022-02-20 22:03:10,473 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2272 transitions. Word has length 73 [2022-02-20 22:03:10,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:03:10,474 INFO L470 AbstractCegarLoop]: Abstraction has 1639 states and 2272 transitions. [2022-02-20 22:03:10,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:03:10,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2272 transitions. [2022-02-20 22:03:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 22:03:10,476 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:03:10,476 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 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:03:10,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 22:03:10,476 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:03:10,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:03:10,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1924223221, now seen corresponding path program 1 times [2022-02-20 22:03:10,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:03:10,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687515991] [2022-02-20 22:03:10,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:03:10,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:03:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:10,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:03:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:10,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {36214#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {36185#true} is VALID [2022-02-20 22:03:10,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {36185#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {36185#true} is VALID [2022-02-20 22:03:10,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {36185#true} assume true; {36185#true} is VALID [2022-02-20 22:03:10,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36185#true} {36185#true} #910#return; {36185#true} is VALID [2022-02-20 22:03:10,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:03:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:10,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {36214#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {36185#true} is VALID [2022-02-20 22:03:10,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {36185#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {36185#true} is VALID [2022-02-20 22:03:10,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {36185#true} assume true; {36185#true} is VALID [2022-02-20 22:03:10,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36185#true} {36185#true} #912#return; {36185#true} is VALID [2022-02-20 22:03:10,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:03:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:10,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {36214#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {36185#true} is VALID [2022-02-20 22:03:10,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {36185#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {36185#true} is VALID [2022-02-20 22:03:10,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {36185#true} assume true; {36185#true} is VALID [2022-02-20 22:03:10,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36185#true} {36185#true} #914#return; {36185#true} is VALID [2022-02-20 22:03:10,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-20 22:03:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:10,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:03:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:10,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {36215#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {36185#true} is VALID [2022-02-20 22:03:10,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {36185#true} assume true; {36185#true} is VALID [2022-02-20 22:03:10,589 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36185#true} {36185#true} #896#return; {36185#true} is VALID [2022-02-20 22:03:10,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {36215#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} assume { :begin_inline_spin_lock } true;spin_lock_#in~lock#1.base, spin_lock_#in~lock#1.offset := ~#torture_spinlock~0.base, ~#torture_spinlock~0.offset;havoc spin_lock_~lock#1.base, spin_lock_~lock#1.offset;spin_lock_~lock#1.base, spin_lock_~lock#1.offset := spin_lock_#in~lock#1.base, spin_lock_#in~lock#1.offset; {36185#true} is VALID [2022-02-20 22:03:10,589 INFO L272 TraceCheckUtils]: 1: Hoare triple {36185#true} call ldv_spin_lock(); {36215#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 22:03:10,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {36215#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {36185#true} is VALID [2022-02-20 22:03:10,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {36185#true} assume true; {36185#true} is VALID [2022-02-20 22:03:10,590 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {36185#true} {36185#true} #896#return; {36185#true} is VALID [2022-02-20 22:03:10,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {36185#true} assume { :begin_inline_ldv_spin_lock_1 } true;ldv_spin_lock_1_#in~lock#1.base, ldv_spin_lock_1_#in~lock#1.offset := spin_lock_~lock#1.base, spin_lock_~lock#1.offset;havoc ldv_spin_lock_1_~lock#1.base, ldv_spin_lock_1_~lock#1.offset;ldv_spin_lock_1_~lock#1.base, ldv_spin_lock_1_~lock#1.offset := ldv_spin_lock_1_#in~lock#1.base, ldv_spin_lock_1_#in~lock#1.offset;assume { :begin_inline__raw_spin_lock } true;_raw_spin_lock_#in~arg0#1.base, _raw_spin_lock_#in~arg0#1.offset := ldv_spin_lock_1_~lock#1.base, ldv_spin_lock_1_~lock#1.offset;havoc _raw_spin_lock_~arg0#1.base, _raw_spin_lock_~arg0#1.offset;_raw_spin_lock_~arg0#1.base, _raw_spin_lock_~arg0#1.offset := _raw_spin_lock_#in~arg0#1.base, _raw_spin_lock_#in~arg0#1.offset; {36185#true} is VALID [2022-02-20 22:03:10,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {36185#true} assume { :end_inline__raw_spin_lock } true; {36185#true} is VALID [2022-02-20 22:03:10,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {36185#true} assume { :end_inline_ldv_spin_lock_1 } true; {36185#true} is VALID [2022-02-20 22:03:10,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {36185#true} assume { :end_inline_spin_lock } true;#res#1 := 0; {36185#true} is VALID [2022-02-20 22:03:10,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {36185#true} assume true; {36185#true} is VALID [2022-02-20 22:03:10,591 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36185#true} {36186#false} #964#return; {36186#false} is VALID [2022-02-20 22:03:10,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-02-20 22:03:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:10,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {36185#true} ~cur_ops___0.base, ~cur_ops___0.offset := #in~cur_ops___0.base, #in~cur_ops___0.offset;~tag.base, ~tag.offset := #in~tag.base, #in~tag.offset;havoc #t~nondet97; {36185#true} is VALID [2022-02-20 22:03:10,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {36185#true} assume true; {36185#true} is VALID [2022-02-20 22:03:10,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36185#true} {36186#false} #934#return; {36186#false} is VALID [2022-02-20 22:03:10,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {36185#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(100, 2);call #Ultimate.allocInit(10, 3);call #Ultimate.allocInit(12, 4);call #Ultimate.allocInit(17, 5);call #Ultimate.allocInit(10, 6);call #Ultimate.allocInit(14, 7);call #Ultimate.allocInit(17, 8);call #Ultimate.allocInit(33, 9);call #Ultimate.allocInit(216, 10);call #Ultimate.allocInit(20, 11);call #Ultimate.allocInit(20, 12);call #Ultimate.allocInit(6, 13);call write~init~int(37, 13, 0, 1);call write~init~int(115, 13, 1, 1);call write~init~int(37, 13, 2, 1);call write~init~int(115, 13, 3, 1);call write~init~int(32, 13, 4, 1);call write~init~int(0, 13, 5, 1);call #Ultimate.allocInit(10, 14);call #Ultimate.allocInit(56, 15);call #Ultimate.allocInit(4, 16);call write~init~int(63, 16, 0, 1);call write~init~int(63, 16, 1, 1);call write~init~int(63, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(1, 17);call write~init~int(0, 17, 0, 1);call #Ultimate.allocInit(4, 18);call write~init~int(33, 18, 0, 1);call write~init~int(33, 18, 1, 1);call write~init~int(33, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(1, 19);call write~init~int(0, 19, 0, 1);call #Ultimate.allocInit(51, 20);call #Ultimate.allocInit(4, 21);call write~init~int(9, 21, 0, 1);call write~init~int(37, 21, 1, 1);call write~init~int(115, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(32, 23);call #Ultimate.allocInit(19, 24);call #Ultimate.allocInit(19, 25);call #Ultimate.allocInit(151, 26);call #Ultimate.allocInit(34, 27);call #Ultimate.allocInit(33, 28);call #Ultimate.allocInit(21, 29);call #Ultimate.allocInit(26, 30);call #Ultimate.allocInit(21, 31);call #Ultimate.allocInit(43, 32);call #Ultimate.allocInit(21, 33);call #Ultimate.allocInit(5, 34);call write~init~int(9, 34, 0, 1);call write~init~int(32, 34, 1, 1);call write~init~int(37, 34, 2, 1);call write~init~int(115, 34, 3, 1);call write~init~int(0, 34, 4, 1);call #Ultimate.allocInit(3, 35);call write~init~int(9, 35, 0, 1);call write~init~int(10, 35, 1, 1);call write~init~int(0, 35, 2, 1);call #Ultimate.allocInit(14, 36);call #Ultimate.allocInit(17, 37);call #Ultimate.allocInit(20, 38);call #Ultimate.allocInit(20, 39);call #Ultimate.allocInit(28, 40);call #Ultimate.allocInit(20, 41);call #Ultimate.allocInit(34, 42);call #Ultimate.allocInit(37, 43);call #Ultimate.allocInit(19, 44);call #Ultimate.allocInit(33, 45);call #Ultimate.allocInit(36, 46);~ldv_state_variable_3~0 := 0;~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~nwriters_stress~0 := -1;~onoff_holdoff~0 := 0;~onoff_interval~0 := 0;~shuffle_interval~0 := 3;~shutdown_secs~0 := 0;~stat_interval~0 := 60;~stutter~0 := 5;~verbose~0 := 1;~torture_type~0.base, ~torture_type~0.offset := 3, 0;~#n_lock_torture_errors~0.base, ~#n_lock_torture_errors~0.offset := 47, 0;call #Ultimate.allocInit(4, 47);call write~init~int(0, ~#n_lock_torture_errors~0.base, ~#n_lock_torture_errors~0.offset, 4);~#stats_task~0.base, ~#stats_task~0.offset := 48, 0;call #Ultimate.allocInit(8, 48);call write~init~$Pointer$(0, 0, ~#stats_task~0.base, ~#stats_task~0.offset, 8);~writer_tasks~0.base, ~writer_tasks~0.offset := 0, 0;~nrealwriters_stress~0 := 0;~lock_is_write_held~0 := 0;~lwsa~0.base, ~lwsa~0.offset := 0, 0;~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset := 49, 0;call #Ultimate.allocInit(4, 49);call write~init~int(1, ~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset, 4);~cur_ops~0.base, ~cur_ops~0.offset := 0, 0;~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset := 50, 0;call #Ultimate.allocInit(48, 50);call write~init~$Pointer$(0, 0, ~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_lock.base, #funAddr~torture_lock_busted_write_lock.offset, ~#lock_busted_ops~0.base, 8 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_delay.base, #funAddr~torture_lock_busted_write_delay.offset, ~#lock_busted_ops~0.base, 16 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_unlock.base, #funAddr~torture_lock_busted_write_unlock.offset, ~#lock_busted_ops~0.base, 24 + ~#lock_busted_ops~0.offset, 8);call write~init~int(0, ~#lock_busted_ops~0.base, 32 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(4, 0, ~#lock_busted_ops~0.base, 40 + ~#lock_busted_ops~0.offset, 8);~#torture_spinlock~0.base, ~#torture_spinlock~0.offset := 51, 0;call #Ultimate.allocInit(68, 51);call write~init~int(0, ~#torture_spinlock~0.base, ~#torture_spinlock~0.offset, 4);call write~init~int(3735899821, ~#torture_spinlock~0.base, 4 + ~#torture_spinlock~0.offset, 4);call write~init~int(4294967295, ~#torture_spinlock~0.base, 8 + ~#torture_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#torture_spinlock~0.base, 12 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 20 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 28 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 36 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(5, 0, ~#torture_spinlock~0.base, 44 + ~#torture_spinlock~0.offset, 8);call write~init~int(0, ~#torture_spinlock~0.base, 52 + ~#torture_spinlock~0.offset, 4);call write~init~int(0, ~#torture_spinlock~0.base, 56 + ~#torture_spinlock~0.offset, 8);~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset := 52, 0;call #Ultimate.allocInit(48, 52);call write~init~$Pointer$(0, 0, ~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_lock.base, #funAddr~torture_spin_lock_write_lock.offset, ~#spin_lock_ops~0.base, 8 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_delay.base, #funAddr~torture_spin_lock_write_delay.offset, ~#spin_lock_ops~0.base, 16 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_unlock.base, #funAddr~torture_spin_lock_write_unlock.offset, ~#spin_lock_ops~0.base, 24 + ~#spin_lock_ops~0.offset, 8);call write~init~int(0, ~#spin_lock_ops~0.base, 32 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(6, 0, ~#spin_lock_ops~0.base, 40 + ~#spin_lock_ops~0.offset, 8);~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset := 53, 0;call #Ultimate.allocInit(48, 53);call write~init~$Pointer$(0, 0, ~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_lock_irq.base, #funAddr~torture_spin_lock_write_lock_irq.offset, ~#spin_lock_irq_ops~0.base, 8 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_delay.base, #funAddr~torture_spin_lock_write_delay.offset, ~#spin_lock_irq_ops~0.base, 16 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_spin_write_unlock_irq.base, #funAddr~torture_lock_spin_write_unlock_irq.offset, ~#spin_lock_irq_ops~0.base, 24 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~int(0, ~#spin_lock_irq_ops~0.base, 32 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(7, 0, ~#spin_lock_irq_ops~0.base, 40 + ~#spin_lock_irq_ops~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_spin~0 := 0; {36185#true} is VALID [2022-02-20 22:03:10,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {36185#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret125#1.base, main_#t~ret125#1.offset, main_#t~ret126#1.base, main_#t~ret126#1.offset, main_#t~ret127#1.base, main_#t~ret127#1.offset, main_#t~nondet128#1, main_#t~switch129#1, main_#t~nondet130#1, main_#t~switch131#1, main_#t~ret132#1, main_#t~ret133#1, main_#t~ret134#1, main_#t~nondet135#1, main_#t~switch136#1, main_#t~ret137#1, main_#t~nondet138#1, main_#t~switch139#1, main_#t~ret140#1, main_#t~ret141#1, main_#t~ret142#1, main_#t~nondet143#1, main_#t~switch144#1, main_#t~ret145#1, main_#t~ret146#1, main_#t~ret147#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~13#1.base, main_~tmp~13#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset, main_~tmp___2~3#1, main_~tmp___3~2#1, main_~tmp___4~2#1, main_~tmp___5~1#1, main_~tmp___6~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~13#1.base, main_~tmp~13#1.offset;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;havoc main_~tmp___2~3#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1;havoc main_~tmp___5~1#1;havoc main_~tmp___6~1#1; {36185#true} is VALID [2022-02-20 22:03:10,614 INFO L272 TraceCheckUtils]: 2: Hoare triple {36185#true} call main_#t~ret125#1.base, main_#t~ret125#1.offset := ldv_zalloc(16); {36214#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:10,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {36214#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {36185#true} is VALID [2022-02-20 22:03:10,614 INFO L290 TraceCheckUtils]: 4: Hoare triple {36185#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {36185#true} is VALID [2022-02-20 22:03:10,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {36185#true} assume true; {36185#true} is VALID [2022-02-20 22:03:10,614 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {36185#true} {36185#true} #910#return; {36185#true} is VALID [2022-02-20 22:03:10,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {36185#true} main_~tmp~13#1.base, main_~tmp~13#1.offset := main_#t~ret125#1.base, main_#t~ret125#1.offset;havoc main_#t~ret125#1.base, main_#t~ret125#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~13#1.base, main_~tmp~13#1.offset; {36185#true} is VALID [2022-02-20 22:03:10,615 INFO L272 TraceCheckUtils]: 8: Hoare triple {36185#true} call main_#t~ret126#1.base, main_#t~ret126#1.offset := ldv_zalloc(16); {36214#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:10,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {36214#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {36185#true} is VALID [2022-02-20 22:03:10,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {36185#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {36185#true} is VALID [2022-02-20 22:03:10,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {36185#true} assume true; {36185#true} is VALID [2022-02-20 22:03:10,616 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {36185#true} {36185#true} #912#return; {36185#true} is VALID [2022-02-20 22:03:10,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {36185#true} main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset := main_#t~ret126#1.base, main_#t~ret126#1.offset;havoc main_#t~ret126#1.base, main_#t~ret126#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset; {36185#true} is VALID [2022-02-20 22:03:10,616 INFO L272 TraceCheckUtils]: 14: Hoare triple {36185#true} call main_#t~ret127#1.base, main_#t~ret127#1.offset := ldv_zalloc(16); {36214#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:10,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {36214#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {36185#true} is VALID [2022-02-20 22:03:10,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {36185#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {36185#true} is VALID [2022-02-20 22:03:10,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {36185#true} assume true; {36185#true} is VALID [2022-02-20 22:03:10,617 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {36185#true} {36185#true} #914#return; {36185#true} is VALID [2022-02-20 22:03:10,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {36185#true} main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset := main_#t~ret127#1.base, main_#t~ret127#1.offset;havoc main_#t~ret127#1.base, main_#t~ret127#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;assume { :begin_inline_ldv_initialize } true; {36185#true} is VALID [2022-02-20 22:03:10,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {36185#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {36199#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 22:03:10,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {36199#(= ~ldv_state_variable_2~0 0)} assume -2147483648 <= main_#t~nondet128#1 && main_#t~nondet128#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet128#1;havoc main_#t~nondet128#1;main_#t~switch129#1 := 0 == main_~tmp___2~3#1; {36199#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 22:03:10,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {36199#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch129#1;main_#t~switch129#1 := main_#t~switch129#1 || 1 == main_~tmp___2~3#1; {36199#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 22:03:10,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {36199#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch129#1;main_#t~switch129#1 := main_#t~switch129#1 || 2 == main_~tmp___2~3#1; {36199#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 22:03:10,619 INFO L290 TraceCheckUtils]: 24: Hoare triple {36199#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch129#1;main_#t~switch129#1 := main_#t~switch129#1 || 3 == main_~tmp___2~3#1; {36199#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 22:03:10,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {36199#(= ~ldv_state_variable_2~0 0)} assume main_#t~switch129#1; {36199#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 22:03:10,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {36199#(= ~ldv_state_variable_2~0 0)} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet143#1 && main_#t~nondet143#1 <= 2147483647;main_~tmp___6~1#1 := main_#t~nondet143#1;havoc main_#t~nondet143#1;main_#t~switch144#1 := 0 == main_~tmp___6~1#1; {36186#false} is VALID [2022-02-20 22:03:10,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {36186#false} assume main_#t~switch144#1; {36186#false} is VALID [2022-02-20 22:03:10,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {36186#false} assume 2 == ~ldv_state_variable_2~0; {36186#false} is VALID [2022-02-20 22:03:10,620 INFO L272 TraceCheckUtils]: 29: Hoare triple {36186#false} call main_#t~ret145#1 := torture_spin_lock_write_lock(); {36215#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 22:03:10,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {36215#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} assume { :begin_inline_spin_lock } true;spin_lock_#in~lock#1.base, spin_lock_#in~lock#1.offset := ~#torture_spinlock~0.base, ~#torture_spinlock~0.offset;havoc spin_lock_~lock#1.base, spin_lock_~lock#1.offset;spin_lock_~lock#1.base, spin_lock_~lock#1.offset := spin_lock_#in~lock#1.base, spin_lock_#in~lock#1.offset; {36185#true} is VALID [2022-02-20 22:03:10,621 INFO L272 TraceCheckUtils]: 31: Hoare triple {36185#true} call ldv_spin_lock(); {36215#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 22:03:10,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {36215#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {36185#true} is VALID [2022-02-20 22:03:10,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {36185#true} assume true; {36185#true} is VALID [2022-02-20 22:03:10,621 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {36185#true} {36185#true} #896#return; {36185#true} is VALID [2022-02-20 22:03:10,621 INFO L290 TraceCheckUtils]: 35: Hoare triple {36185#true} assume { :begin_inline_ldv_spin_lock_1 } true;ldv_spin_lock_1_#in~lock#1.base, ldv_spin_lock_1_#in~lock#1.offset := spin_lock_~lock#1.base, spin_lock_~lock#1.offset;havoc ldv_spin_lock_1_~lock#1.base, ldv_spin_lock_1_~lock#1.offset;ldv_spin_lock_1_~lock#1.base, ldv_spin_lock_1_~lock#1.offset := ldv_spin_lock_1_#in~lock#1.base, ldv_spin_lock_1_#in~lock#1.offset;assume { :begin_inline__raw_spin_lock } true;_raw_spin_lock_#in~arg0#1.base, _raw_spin_lock_#in~arg0#1.offset := ldv_spin_lock_1_~lock#1.base, ldv_spin_lock_1_~lock#1.offset;havoc _raw_spin_lock_~arg0#1.base, _raw_spin_lock_~arg0#1.offset;_raw_spin_lock_~arg0#1.base, _raw_spin_lock_~arg0#1.offset := _raw_spin_lock_#in~arg0#1.base, _raw_spin_lock_#in~arg0#1.offset; {36185#true} is VALID [2022-02-20 22:03:10,622 INFO L290 TraceCheckUtils]: 36: Hoare triple {36185#true} assume { :end_inline__raw_spin_lock } true; {36185#true} is VALID [2022-02-20 22:03:10,622 INFO L290 TraceCheckUtils]: 37: Hoare triple {36185#true} assume { :end_inline_ldv_spin_lock_1 } true; {36185#true} is VALID [2022-02-20 22:03:10,622 INFO L290 TraceCheckUtils]: 38: Hoare triple {36185#true} assume { :end_inline_spin_lock } true;#res#1 := 0; {36185#true} is VALID [2022-02-20 22:03:10,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {36185#true} assume true; {36185#true} is VALID [2022-02-20 22:03:10,622 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {36185#true} {36186#false} #964#return; {36186#false} is VALID [2022-02-20 22:03:10,623 INFO L290 TraceCheckUtils]: 41: Hoare triple {36186#false} assume -2147483648 <= main_#t~ret145#1 && main_#t~ret145#1 <= 2147483647;havoc main_#t~ret145#1;~ldv_state_variable_2~0 := 2; {36186#false} is VALID [2022-02-20 22:03:10,623 INFO L290 TraceCheckUtils]: 42: Hoare triple {36186#false} assume -2147483648 <= main_#t~nondet128#1 && main_#t~nondet128#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet128#1;havoc main_#t~nondet128#1;main_#t~switch129#1 := 0 == main_~tmp___2~3#1; {36186#false} is VALID [2022-02-20 22:03:10,623 INFO L290 TraceCheckUtils]: 43: Hoare triple {36186#false} assume !main_#t~switch129#1;main_#t~switch129#1 := main_#t~switch129#1 || 1 == main_~tmp___2~3#1; {36186#false} is VALID [2022-02-20 22:03:10,624 INFO L290 TraceCheckUtils]: 44: Hoare triple {36186#false} assume main_#t~switch129#1; {36186#false} is VALID [2022-02-20 22:03:10,624 INFO L290 TraceCheckUtils]: 45: Hoare triple {36186#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet135#1 && main_#t~nondet135#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet135#1;havoc main_#t~nondet135#1;main_#t~switch136#1 := 0 == main_~tmp___4~2#1; {36186#false} is VALID [2022-02-20 22:03:10,624 INFO L290 TraceCheckUtils]: 46: Hoare triple {36186#false} assume !main_#t~switch136#1;main_#t~switch136#1 := main_#t~switch136#1 || 1 == main_~tmp___4~2#1; {36186#false} is VALID [2022-02-20 22:03:10,624 INFO L290 TraceCheckUtils]: 47: Hoare triple {36186#false} assume main_#t~switch136#1; {36186#false} is VALID [2022-02-20 22:03:10,624 INFO L290 TraceCheckUtils]: 48: Hoare triple {36186#false} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_lock_torture_init } true;havoc lock_torture_init_#res#1;havoc lock_torture_init_#t~ret101#1, lock_torture_init_#t~mem102#1.base, lock_torture_init_#t~mem102#1.offset, lock_torture_init_#t~mem103#1.base, lock_torture_init_#t~mem103#1.offset, lock_torture_init_#t~nondet104#1, lock_torture_init_#t~nondet105#1, lock_torture_init_#t~nondet106#1, lock_torture_init_#t~nondet107#1, lock_torture_init_#t~mem108#1.base, lock_torture_init_#t~mem108#1.offset, lock_torture_init_#t~mem109#1.base, lock_torture_init_#t~mem109#1.offset, lock_torture_init_#t~nondet110#1, lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset, lock_torture_init_#t~mem113#1.base, lock_torture_init_#t~mem113#1.offset, lock_torture_init_#t~ret114#1, lock_torture_init_#t~ret115#1.base, lock_torture_init_#t~ret115#1.offset, lock_torture_init_#t~nondet116#1, lock_torture_init_#t~ret117#1, lock_torture_init_#t~ret118#1, lock_torture_init_#t~ret119#1, lock_torture_init_#t~ret120#1, lock_torture_init_#t~ret121#1.base, lock_torture_init_#t~ret121#1.offset, lock_torture_init_#t~nondet122#1, lock_torture_init_#t~ret123#1, lock_torture_init_#t~ret124#1, lock_torture_init_~i~2#1, lock_torture_init_~firsterr~0#1, lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset, lock_torture_init_~tmp~12#1, lock_torture_init_~tmp___0~9#1, lock_torture_init_~tmp___1~3#1, lock_torture_init_~tmp___2~2#1, lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset, lock_torture_init_~tmp___4~1#1.base, lock_torture_init_~tmp___4~1#1.offset;havoc lock_torture_init_~i~2#1;havoc lock_torture_init_~firsterr~0#1;call lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset := #Ultimate.allocOnStack(24);havoc lock_torture_init_~tmp~12#1;havoc lock_torture_init_~tmp___0~9#1;havoc lock_torture_init_~tmp___1~3#1;havoc lock_torture_init_~tmp___2~2#1;havoc lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset;havoc lock_torture_init_~tmp___4~1#1.base, lock_torture_init_~tmp___4~1#1.offset;lock_torture_init_~firsterr~0#1 := 0;call write~$Pointer$(~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset, 8);call write~$Pointer$(~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, 8 + lock_torture_init_~#torture_ops~0#1.offset, 8);call write~$Pointer$(~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, 16 + lock_torture_init_~#torture_ops~0#1.offset, 8);assume { :begin_inline_torture_init_begin } true;torture_init_begin_#in~arg0#1.base, torture_init_begin_#in~arg0#1.offset, torture_init_begin_#in~arg1#1, torture_init_begin_#in~arg2#1.base, torture_init_begin_#in~arg2#1.offset := ~torture_type~0.base, ~torture_type~0.offset, (if 0 == ~verbose~0 % 256 then 0 else 1), ~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset;havoc torture_init_begin_#res#1;havoc torture_init_begin_#t~nondet165#1, torture_init_begin_~arg0#1.base, torture_init_begin_~arg0#1.offset, torture_init_begin_~arg1#1, torture_init_begin_~arg2#1.base, torture_init_begin_~arg2#1.offset;torture_init_begin_~arg0#1.base, torture_init_begin_~arg0#1.offset := torture_init_begin_#in~arg0#1.base, torture_init_begin_#in~arg0#1.offset;torture_init_begin_~arg1#1 := torture_init_begin_#in~arg1#1;torture_init_begin_~arg2#1.base, torture_init_begin_~arg2#1.offset := torture_init_begin_#in~arg2#1.base, torture_init_begin_#in~arg2#1.offset;torture_init_begin_#res#1 := torture_init_begin_#t~nondet165#1;havoc torture_init_begin_#t~nondet165#1; {36186#false} is VALID [2022-02-20 22:03:10,624 INFO L290 TraceCheckUtils]: 49: Hoare triple {36186#false} lock_torture_init_#t~ret101#1 := torture_init_begin_#res#1;assume { :end_inline_torture_init_begin } true;lock_torture_init_~tmp~12#1 := lock_torture_init_#t~ret101#1;havoc lock_torture_init_#t~ret101#1; {36186#false} is VALID [2022-02-20 22:03:10,624 INFO L290 TraceCheckUtils]: 50: Hoare triple {36186#false} assume 0 != lock_torture_init_~tmp~12#1 % 256;lock_torture_init_~tmp___0~9#1 := 0; {36186#false} is VALID [2022-02-20 22:03:10,625 INFO L290 TraceCheckUtils]: 51: Hoare triple {36186#false} assume !(0 != lock_torture_init_~tmp___0~9#1);lock_torture_init_~i~2#1 := 0; {36186#false} is VALID [2022-02-20 22:03:10,625 INFO L290 TraceCheckUtils]: 52: Hoare triple {36186#false} assume !(lock_torture_init_~i~2#1 % 4294967296 <= 2); {36186#false} is VALID [2022-02-20 22:03:10,625 INFO L290 TraceCheckUtils]: 53: Hoare triple {36186#false} assume !(3 == lock_torture_init_~i~2#1);call lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset := read~$Pointer$(~cur_ops~0.base, ~cur_ops~0.offset, 8); {36186#false} is VALID [2022-02-20 22:03:10,625 INFO L290 TraceCheckUtils]: 54: Hoare triple {36186#false} assume !(0 != (lock_torture_init_#t~mem111#1.base + lock_torture_init_#t~mem111#1.offset) % 18446744073709551616);havoc lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset; {36186#false} is VALID [2022-02-20 22:03:10,625 INFO L290 TraceCheckUtils]: 55: Hoare triple {36186#false} assume !(~nwriters_stress~0 >= 0);assume { :begin_inline_cpumask_weight } true;cpumask_weight_#in~srcp#1.base, cpumask_weight_#in~srcp#1.offset := ~cpu_online_mask~0.base, ~cpu_online_mask~0.offset;havoc cpumask_weight_#res#1;havoc cpumask_weight_#t~ret12#1, cpumask_weight_~srcp#1.base, cpumask_weight_~srcp#1.offset, cpumask_weight_~tmp~0#1;cpumask_weight_~srcp#1.base, cpumask_weight_~srcp#1.offset := cpumask_weight_#in~srcp#1.base, cpumask_weight_#in~srcp#1.offset;havoc cpumask_weight_~tmp~0#1;assume { :begin_inline_bitmap_weight } true;bitmap_weight_#in~src#1.base, bitmap_weight_#in~src#1.offset, bitmap_weight_#in~nbits#1 := cpumask_weight_~srcp#1.base, cpumask_weight_~srcp#1.offset, ~nr_cpu_ids~0;havoc bitmap_weight_#res#1;havoc bitmap_weight_#t~ret11#1, bitmap_weight_~src#1.base, bitmap_weight_~src#1.offset, bitmap_weight_~nbits#1, bitmap_weight_~tmp___0~0#1;bitmap_weight_~src#1.base, bitmap_weight_~src#1.offset := bitmap_weight_#in~src#1.base, bitmap_weight_#in~src#1.offset;bitmap_weight_~nbits#1 := bitmap_weight_#in~nbits#1;havoc bitmap_weight_~tmp___0~0#1;assume { :begin_inline___bitmap_weight } true;__bitmap_weight_#in~arg0#1.base, __bitmap_weight_#in~arg0#1.offset, __bitmap_weight_#in~arg1#1 := bitmap_weight_~src#1.base, bitmap_weight_~src#1.offset, bitmap_weight_~nbits#1;havoc __bitmap_weight_#res#1;havoc __bitmap_weight_#t~nondet151#1, __bitmap_weight_~arg0#1.base, __bitmap_weight_~arg0#1.offset, __bitmap_weight_~arg1#1;__bitmap_weight_~arg0#1.base, __bitmap_weight_~arg0#1.offset := __bitmap_weight_#in~arg0#1.base, __bitmap_weight_#in~arg0#1.offset;__bitmap_weight_~arg1#1 := __bitmap_weight_#in~arg1#1;assume -2147483648 <= __bitmap_weight_#t~nondet151#1 && __bitmap_weight_#t~nondet151#1 <= 2147483647;__bitmap_weight_#res#1 := __bitmap_weight_#t~nondet151#1;havoc __bitmap_weight_#t~nondet151#1; {36186#false} is VALID [2022-02-20 22:03:10,625 INFO L290 TraceCheckUtils]: 56: Hoare triple {36186#false} bitmap_weight_#t~ret11#1 := __bitmap_weight_#res#1;assume { :end_inline___bitmap_weight } true;assume -2147483648 <= bitmap_weight_#t~ret11#1 && bitmap_weight_#t~ret11#1 <= 2147483647;bitmap_weight_~tmp___0~0#1 := bitmap_weight_#t~ret11#1;havoc bitmap_weight_#t~ret11#1;bitmap_weight_#res#1 := bitmap_weight_~tmp___0~0#1; {36186#false} is VALID [2022-02-20 22:03:10,626 INFO L290 TraceCheckUtils]: 57: Hoare triple {36186#false} cpumask_weight_#t~ret12#1 := bitmap_weight_#res#1;assume { :end_inline_bitmap_weight } true;assume -2147483648 <= cpumask_weight_#t~ret12#1 && cpumask_weight_#t~ret12#1 <= 2147483647;cpumask_weight_~tmp~0#1 := cpumask_weight_#t~ret12#1;havoc cpumask_weight_#t~ret12#1;cpumask_weight_#res#1 := cpumask_weight_~tmp~0#1; {36186#false} is VALID [2022-02-20 22:03:10,626 INFO L290 TraceCheckUtils]: 58: Hoare triple {36186#false} lock_torture_init_#t~ret114#1 := cpumask_weight_#res#1;assume { :end_inline_cpumask_weight } true;lock_torture_init_~tmp___2~2#1 := lock_torture_init_#t~ret114#1;havoc lock_torture_init_#t~ret114#1;~nrealwriters_stress~0 := (if 2 * lock_torture_init_~tmp___2~2#1 % 4294967296 % 4294967296 <= 2147483647 then 2 * lock_torture_init_~tmp___2~2#1 % 4294967296 % 4294967296 else 2 * lock_torture_init_~tmp___2~2#1 % 4294967296 % 4294967296 - 4294967296); {36186#false} is VALID [2022-02-20 22:03:10,626 INFO L272 TraceCheckUtils]: 59: Hoare triple {36186#false} call lock_torture_print_module_parms(~cur_ops~0.base, ~cur_ops~0.offset, 36, 0); {36185#true} is VALID [2022-02-20 22:03:10,626 INFO L290 TraceCheckUtils]: 60: Hoare triple {36185#true} ~cur_ops___0.base, ~cur_ops___0.offset := #in~cur_ops___0.base, #in~cur_ops___0.offset;~tag.base, ~tag.offset := #in~tag.base, #in~tag.offset;havoc #t~nondet97; {36185#true} is VALID [2022-02-20 22:03:10,626 INFO L290 TraceCheckUtils]: 61: Hoare triple {36185#true} assume true; {36185#true} is VALID [2022-02-20 22:03:10,626 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {36185#true} {36186#false} #934#return; {36186#false} is VALID [2022-02-20 22:03:10,626 INFO L290 TraceCheckUtils]: 63: Hoare triple {36186#false} ~lock_is_write_held~0 := 0; {36186#false} is VALID [2022-02-20 22:03:10,627 INFO L272 TraceCheckUtils]: 64: Hoare triple {36186#false} call lock_torture_init_#t~ret115#1.base, lock_torture_init_#t~ret115#1.offset := kmalloc(16 * ~nrealwriters_stress~0, 208); {36186#false} is VALID [2022-02-20 22:03:10,627 INFO L290 TraceCheckUtils]: 65: Hoare triple {36186#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1; {36186#false} is VALID [2022-02-20 22:03:10,627 INFO L272 TraceCheckUtils]: 66: Hoare triple {36186#false} call ldv_check_alloc_flags(~flags#1); {36186#false} is VALID [2022-02-20 22:03:10,627 INFO L290 TraceCheckUtils]: 67: Hoare triple {36186#false} ~flags := #in~flags; {36186#false} is VALID [2022-02-20 22:03:10,627 INFO L290 TraceCheckUtils]: 68: Hoare triple {36186#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {36186#false} is VALID [2022-02-20 22:03:10,627 INFO L272 TraceCheckUtils]: 69: Hoare triple {36186#false} call ldv_error(); {36186#false} is VALID [2022-02-20 22:03:10,627 INFO L290 TraceCheckUtils]: 70: Hoare triple {36186#false} assume !false; {36186#false} is VALID [2022-02-20 22:03:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 22:03:10,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:03:10,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687515991] [2022-02-20 22:03:10,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687515991] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:03:10,628 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:03:10,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 22:03:10,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877258845] [2022-02-20 22:03:10,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:03:10,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 71 [2022-02-20 22:03:10,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:03:10,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:03:10,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:03:10,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 22:03:10,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:03:10,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 22:03:10,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 22:03:10,689 INFO L87 Difference]: Start difference. First operand 1639 states and 2272 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:03:14,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:03:14,734 INFO L93 Difference]: Finished difference Result 4908 states and 6816 transitions. [2022-02-20 22:03:14,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 22:03:14,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 71 [2022-02-20 22:03:14,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:03:14,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:03:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1382 transitions. [2022-02-20 22:03:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:03:14,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1382 transitions. [2022-02-20 22:03:14,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 1382 transitions. [2022-02-20 22:03:15,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1382 edges. 1382 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:03:16,322 INFO L225 Difference]: With dead ends: 4908 [2022-02-20 22:03:16,322 INFO L226 Difference]: Without dead ends: 3289 [2022-02-20 22:03:16,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 22:03:16,326 INFO L933 BasicCegarLoop]: 529 mSDtfsCounter, 804 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 22:03:16,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [840 Valid, 1212 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 22:03:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2022-02-20 22:03:16,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 2936. [2022-02-20 22:03:16,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:03:16,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3289 states. Second operand has 2936 states, 2278 states have (on average 1.3999122036874452) internal successors, (3189), 2354 states have internal predecessors, (3189), 428 states have call successors, (428), 230 states have call predecessors, (428), 229 states have return successors, (431), 395 states have call predecessors, (431), 423 states have call successors, (431) [2022-02-20 22:03:16,973 INFO L74 IsIncluded]: Start isIncluded. First operand 3289 states. Second operand has 2936 states, 2278 states have (on average 1.3999122036874452) internal successors, (3189), 2354 states have internal predecessors, (3189), 428 states have call successors, (428), 230 states have call predecessors, (428), 229 states have return successors, (431), 395 states have call predecessors, (431), 423 states have call successors, (431) [2022-02-20 22:03:16,979 INFO L87 Difference]: Start difference. First operand 3289 states. Second operand has 2936 states, 2278 states have (on average 1.3999122036874452) internal successors, (3189), 2354 states have internal predecessors, (3189), 428 states have call successors, (428), 230 states have call predecessors, (428), 229 states have return successors, (431), 395 states have call predecessors, (431), 423 states have call successors, (431) [2022-02-20 22:03:17,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:03:17,438 INFO L93 Difference]: Finished difference Result 3289 states and 4559 transitions. [2022-02-20 22:03:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 4559 transitions. [2022-02-20 22:03:17,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:03:17,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:03:17,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 2936 states, 2278 states have (on average 1.3999122036874452) internal successors, (3189), 2354 states have internal predecessors, (3189), 428 states have call successors, (428), 230 states have call predecessors, (428), 229 states have return successors, (431), 395 states have call predecessors, (431), 423 states have call successors, (431) Second operand 3289 states. [2022-02-20 22:03:17,458 INFO L87 Difference]: Start difference. First operand has 2936 states, 2278 states have (on average 1.3999122036874452) internal successors, (3189), 2354 states have internal predecessors, (3189), 428 states have call successors, (428), 230 states have call predecessors, (428), 229 states have return successors, (431), 395 states have call predecessors, (431), 423 states have call successors, (431) Second operand 3289 states. [2022-02-20 22:03:17,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:03:17,956 INFO L93 Difference]: Finished difference Result 3289 states and 4559 transitions. [2022-02-20 22:03:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 4559 transitions. [2022-02-20 22:03:17,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:03:17,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:03:17,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:03:17,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:03:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2278 states have (on average 1.3999122036874452) internal successors, (3189), 2354 states have internal predecessors, (3189), 428 states have call successors, (428), 230 states have call predecessors, (428), 229 states have return successors, (431), 395 states have call predecessors, (431), 423 states have call successors, (431) [2022-02-20 22:03:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 4048 transitions. [2022-02-20 22:03:18,470 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 4048 transitions. Word has length 71 [2022-02-20 22:03:18,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:03:18,470 INFO L470 AbstractCegarLoop]: Abstraction has 2936 states and 4048 transitions. [2022-02-20 22:03:18,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:03:18,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 4048 transitions. [2022-02-20 22:03:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-02-20 22:03:18,475 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:03:18,475 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 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, 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:03:18,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 22:03:18,476 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:03:18,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:03:18,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1077933097, now seen corresponding path program 1 times [2022-02-20 22:03:18,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:03:18,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213535650] [2022-02-20 22:03:18,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:03:18,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:03:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:18,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:03:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:18,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {53489#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {53436#true} is VALID [2022-02-20 22:03:18,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {53436#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {53436#true} is VALID [2022-02-20 22:03:18,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53436#true} {53436#true} #910#return; {53436#true} is VALID [2022-02-20 22:03:18,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:03:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:18,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {53489#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {53436#true} is VALID [2022-02-20 22:03:18,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {53436#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {53436#true} is VALID [2022-02-20 22:03:18,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53436#true} {53436#true} #912#return; {53436#true} is VALID [2022-02-20 22:03:18,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:03:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:18,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {53489#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {53436#true} is VALID [2022-02-20 22:03:18,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {53436#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {53436#true} is VALID [2022-02-20 22:03:18,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53436#true} {53436#true} #914#return; {53436#true} is VALID [2022-02-20 22:03:18,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 22:03:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:18,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {53436#true} ~cur_ops___0.base, ~cur_ops___0.offset := #in~cur_ops___0.base, #in~cur_ops___0.offset;~tag.base, ~tag.offset := #in~tag.base, #in~tag.offset;havoc #t~nondet97; {53436#true} is VALID [2022-02-20 22:03:18,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,599 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53436#true} {53436#true} #934#return; {53436#true} is VALID [2022-02-20 22:03:18,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 22:03:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:18,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:03:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:18,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {53436#true} ~flags := #in~flags; {53436#true} is VALID [2022-02-20 22:03:18,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {53436#true} assume 0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296; {53436#true} is VALID [2022-02-20 22:03:18,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53436#true} {53436#true} #864#return; {53436#true} is VALID [2022-02-20 22:03:18,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 22:03:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:18,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {53490#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___0~1 := #t~nondet24;havoc #t~nondet24; {53436#true} is VALID [2022-02-20 22:03:18,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {53436#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {53436#true} is VALID [2022-02-20 22:03:18,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53436#true} {53436#true} #866#return; {53436#true} is VALID [2022-02-20 22:03:18,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {53490#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1; {53436#true} is VALID [2022-02-20 22:03:18,646 INFO L272 TraceCheckUtils]: 1: Hoare triple {53436#true} call ldv_check_alloc_flags(~flags#1); {53436#true} is VALID [2022-02-20 22:03:18,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {53436#true} ~flags := #in~flags; {53436#true} is VALID [2022-02-20 22:03:18,646 INFO L290 TraceCheckUtils]: 3: Hoare triple {53436#true} assume 0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296; {53436#true} is VALID [2022-02-20 22:03:18,646 INFO L290 TraceCheckUtils]: 4: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,647 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {53436#true} {53436#true} #864#return; {53436#true} is VALID [2022-02-20 22:03:18,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {53436#true} assume { :begin_inline_ldv_kmalloc_12 } true;ldv_kmalloc_12_#in~size#1, ldv_kmalloc_12_#in~flags#1 := ~size#1, ~flags#1;havoc ldv_kmalloc_12_#res#1.base, ldv_kmalloc_12_#res#1.offset;havoc ldv_kmalloc_12_#t~ret23#1.base, ldv_kmalloc_12_#t~ret23#1.offset, ldv_kmalloc_12_~size#1, ldv_kmalloc_12_~flags#1, ldv_kmalloc_12_~tmp___2~0#1.base, ldv_kmalloc_12_~tmp___2~0#1.offset;ldv_kmalloc_12_~size#1 := ldv_kmalloc_12_#in~size#1;ldv_kmalloc_12_~flags#1 := ldv_kmalloc_12_#in~flags#1;havoc ldv_kmalloc_12_~tmp___2~0#1.base, ldv_kmalloc_12_~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := ldv_kmalloc_12_~size#1, ldv_kmalloc_12_~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret20#1.base, __kmalloc_#t~ret20#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {53436#true} is VALID [2022-02-20 22:03:18,647 INFO L272 TraceCheckUtils]: 7: Hoare triple {53436#true} call __kmalloc_#t~ret20#1.base, __kmalloc_#t~ret20#1.offset := ldv_malloc(__kmalloc_~size#1); {53490#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:18,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {53490#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___0~1 := #t~nondet24;havoc #t~nondet24; {53436#true} is VALID [2022-02-20 22:03:18,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {53436#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {53436#true} is VALID [2022-02-20 22:03:18,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,648 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {53436#true} {53436#true} #866#return; {53436#true} is VALID [2022-02-20 22:03:18,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {53436#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret20#1.base, __kmalloc_#t~ret20#1.offset;havoc __kmalloc_#t~ret20#1.base, __kmalloc_#t~ret20#1.offset; {53436#true} is VALID [2022-02-20 22:03:18,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {53436#true} ldv_kmalloc_12_#t~ret23#1.base, ldv_kmalloc_12_#t~ret23#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;ldv_kmalloc_12_~tmp___2~0#1.base, ldv_kmalloc_12_~tmp___2~0#1.offset := ldv_kmalloc_12_#t~ret23#1.base, ldv_kmalloc_12_#t~ret23#1.offset;havoc ldv_kmalloc_12_#t~ret23#1.base, ldv_kmalloc_12_#t~ret23#1.offset;ldv_kmalloc_12_#res#1.base, ldv_kmalloc_12_#res#1.offset := ldv_kmalloc_12_~tmp___2~0#1.base, ldv_kmalloc_12_~tmp___2~0#1.offset; {53436#true} is VALID [2022-02-20 22:03:18,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {53436#true} #t~ret148#1.base, #t~ret148#1.offset := ldv_kmalloc_12_#res#1.base, ldv_kmalloc_12_#res#1.offset;assume { :end_inline_ldv_kmalloc_12 } true;havoc #t~ret148#1.base, #t~ret148#1.offset;#res#1.base, #res#1.offset := 0, 0; {53436#true} is VALID [2022-02-20 22:03:18,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,649 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {53436#true} {53436#true} #936#return; {53436#true} is VALID [2022-02-20 22:03:18,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 22:03:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:18,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,653 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {53436#true} {53436#true} #946#return; {53436#true} is VALID [2022-02-20 22:03:18,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-20 22:03:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:18,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {53499#(and (= |old(#length)| |#length|) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))} havoc ~i~1#1;havoc ~tmp~11#1;havoc ~tmp___0~8#1;havoc ~tmp___1~2#1;assume { :begin_inline_torture_cleanup } true;havoc torture_cleanup_#res#1;havoc torture_cleanup_#t~nondet164#1;torture_cleanup_#res#1 := torture_cleanup_#t~nondet164#1;havoc torture_cleanup_#t~nondet164#1; {53436#true} is VALID [2022-02-20 22:03:18,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {53436#true} #t~ret98#1 := torture_cleanup_#res#1;assume { :end_inline_torture_cleanup } true;~tmp~11#1 := #t~ret98#1;havoc #t~ret98#1; {53436#true} is VALID [2022-02-20 22:03:18,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {53436#true} assume 0 != ~tmp~11#1 % 256; {53436#true} is VALID [2022-02-20 22:03:18,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,666 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {53436#true} {53436#true} #948#return; {53436#true} is VALID [2022-02-20 22:03:18,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-02-20 22:03:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:18,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:03:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:18,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {53504#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {53436#true} is VALID [2022-02-20 22:03:18,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,690 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53436#true} {53436#true} #892#return; {53436#true} is VALID [2022-02-20 22:03:18,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {53500#(and (= ~ldv_spin~0 |old(~ldv_spin~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} havoc ~flags~0; {53436#true} is VALID [2022-02-20 22:03:18,690 INFO L272 TraceCheckUtils]: 1: Hoare triple {53436#true} call ldv_spin_lock(); {53504#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 22:03:18,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {53504#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {53436#true} is VALID [2022-02-20 22:03:18,691 INFO L290 TraceCheckUtils]: 3: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,691 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {53436#true} {53436#true} #892#return; {53436#true} is VALID [2022-02-20 22:03:18,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {53436#true} call write~int(~flags~0, ~cur_ops~0.base, 32 + ~cur_ops~0.offset, 8);#res := 0; {53436#true} is VALID [2022-02-20 22:03:18,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,691 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {53436#true} {53437#false} #916#return; {53437#false} is VALID [2022-02-20 22:03:18,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-02-20 22:03:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:18,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {53436#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset; {53436#true} is VALID [2022-02-20 22:03:18,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,696 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53436#true} {53437#false} #882#return; {53437#false} is VALID [2022-02-20 22:03:18,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {53436#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(100, 2);call #Ultimate.allocInit(10, 3);call #Ultimate.allocInit(12, 4);call #Ultimate.allocInit(17, 5);call #Ultimate.allocInit(10, 6);call #Ultimate.allocInit(14, 7);call #Ultimate.allocInit(17, 8);call #Ultimate.allocInit(33, 9);call #Ultimate.allocInit(216, 10);call #Ultimate.allocInit(20, 11);call #Ultimate.allocInit(20, 12);call #Ultimate.allocInit(6, 13);call write~init~int(37, 13, 0, 1);call write~init~int(115, 13, 1, 1);call write~init~int(37, 13, 2, 1);call write~init~int(115, 13, 3, 1);call write~init~int(32, 13, 4, 1);call write~init~int(0, 13, 5, 1);call #Ultimate.allocInit(10, 14);call #Ultimate.allocInit(56, 15);call #Ultimate.allocInit(4, 16);call write~init~int(63, 16, 0, 1);call write~init~int(63, 16, 1, 1);call write~init~int(63, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(1, 17);call write~init~int(0, 17, 0, 1);call #Ultimate.allocInit(4, 18);call write~init~int(33, 18, 0, 1);call write~init~int(33, 18, 1, 1);call write~init~int(33, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(1, 19);call write~init~int(0, 19, 0, 1);call #Ultimate.allocInit(51, 20);call #Ultimate.allocInit(4, 21);call write~init~int(9, 21, 0, 1);call write~init~int(37, 21, 1, 1);call write~init~int(115, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(32, 23);call #Ultimate.allocInit(19, 24);call #Ultimate.allocInit(19, 25);call #Ultimate.allocInit(151, 26);call #Ultimate.allocInit(34, 27);call #Ultimate.allocInit(33, 28);call #Ultimate.allocInit(21, 29);call #Ultimate.allocInit(26, 30);call #Ultimate.allocInit(21, 31);call #Ultimate.allocInit(43, 32);call #Ultimate.allocInit(21, 33);call #Ultimate.allocInit(5, 34);call write~init~int(9, 34, 0, 1);call write~init~int(32, 34, 1, 1);call write~init~int(37, 34, 2, 1);call write~init~int(115, 34, 3, 1);call write~init~int(0, 34, 4, 1);call #Ultimate.allocInit(3, 35);call write~init~int(9, 35, 0, 1);call write~init~int(10, 35, 1, 1);call write~init~int(0, 35, 2, 1);call #Ultimate.allocInit(14, 36);call #Ultimate.allocInit(17, 37);call #Ultimate.allocInit(20, 38);call #Ultimate.allocInit(20, 39);call #Ultimate.allocInit(28, 40);call #Ultimate.allocInit(20, 41);call #Ultimate.allocInit(34, 42);call #Ultimate.allocInit(37, 43);call #Ultimate.allocInit(19, 44);call #Ultimate.allocInit(33, 45);call #Ultimate.allocInit(36, 46);~ldv_state_variable_3~0 := 0;~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~nwriters_stress~0 := -1;~onoff_holdoff~0 := 0;~onoff_interval~0 := 0;~shuffle_interval~0 := 3;~shutdown_secs~0 := 0;~stat_interval~0 := 60;~stutter~0 := 5;~verbose~0 := 1;~torture_type~0.base, ~torture_type~0.offset := 3, 0;~#n_lock_torture_errors~0.base, ~#n_lock_torture_errors~0.offset := 47, 0;call #Ultimate.allocInit(4, 47);call write~init~int(0, ~#n_lock_torture_errors~0.base, ~#n_lock_torture_errors~0.offset, 4);~#stats_task~0.base, ~#stats_task~0.offset := 48, 0;call #Ultimate.allocInit(8, 48);call write~init~$Pointer$(0, 0, ~#stats_task~0.base, ~#stats_task~0.offset, 8);~writer_tasks~0.base, ~writer_tasks~0.offset := 0, 0;~nrealwriters_stress~0 := 0;~lock_is_write_held~0 := 0;~lwsa~0.base, ~lwsa~0.offset := 0, 0;~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset := 49, 0;call #Ultimate.allocInit(4, 49);call write~init~int(1, ~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset, 4);~cur_ops~0.base, ~cur_ops~0.offset := 0, 0;~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset := 50, 0;call #Ultimate.allocInit(48, 50);call write~init~$Pointer$(0, 0, ~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_lock.base, #funAddr~torture_lock_busted_write_lock.offset, ~#lock_busted_ops~0.base, 8 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_delay.base, #funAddr~torture_lock_busted_write_delay.offset, ~#lock_busted_ops~0.base, 16 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_unlock.base, #funAddr~torture_lock_busted_write_unlock.offset, ~#lock_busted_ops~0.base, 24 + ~#lock_busted_ops~0.offset, 8);call write~init~int(0, ~#lock_busted_ops~0.base, 32 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(4, 0, ~#lock_busted_ops~0.base, 40 + ~#lock_busted_ops~0.offset, 8);~#torture_spinlock~0.base, ~#torture_spinlock~0.offset := 51, 0;call #Ultimate.allocInit(68, 51);call write~init~int(0, ~#torture_spinlock~0.base, ~#torture_spinlock~0.offset, 4);call write~init~int(3735899821, ~#torture_spinlock~0.base, 4 + ~#torture_spinlock~0.offset, 4);call write~init~int(4294967295, ~#torture_spinlock~0.base, 8 + ~#torture_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#torture_spinlock~0.base, 12 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 20 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 28 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 36 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(5, 0, ~#torture_spinlock~0.base, 44 + ~#torture_spinlock~0.offset, 8);call write~init~int(0, ~#torture_spinlock~0.base, 52 + ~#torture_spinlock~0.offset, 4);call write~init~int(0, ~#torture_spinlock~0.base, 56 + ~#torture_spinlock~0.offset, 8);~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset := 52, 0;call #Ultimate.allocInit(48, 52);call write~init~$Pointer$(0, 0, ~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_lock.base, #funAddr~torture_spin_lock_write_lock.offset, ~#spin_lock_ops~0.base, 8 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_delay.base, #funAddr~torture_spin_lock_write_delay.offset, ~#spin_lock_ops~0.base, 16 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_unlock.base, #funAddr~torture_spin_lock_write_unlock.offset, ~#spin_lock_ops~0.base, 24 + ~#spin_lock_ops~0.offset, 8);call write~init~int(0, ~#spin_lock_ops~0.base, 32 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(6, 0, ~#spin_lock_ops~0.base, 40 + ~#spin_lock_ops~0.offset, 8);~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset := 53, 0;call #Ultimate.allocInit(48, 53);call write~init~$Pointer$(0, 0, ~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_lock_irq.base, #funAddr~torture_spin_lock_write_lock_irq.offset, ~#spin_lock_irq_ops~0.base, 8 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_delay.base, #funAddr~torture_spin_lock_write_delay.offset, ~#spin_lock_irq_ops~0.base, 16 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_spin_write_unlock_irq.base, #funAddr~torture_lock_spin_write_unlock_irq.offset, ~#spin_lock_irq_ops~0.base, 24 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~int(0, ~#spin_lock_irq_ops~0.base, 32 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(7, 0, ~#spin_lock_irq_ops~0.base, 40 + ~#spin_lock_irq_ops~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_spin~0 := 0; {53436#true} is VALID [2022-02-20 22:03:18,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {53436#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret125#1.base, main_#t~ret125#1.offset, main_#t~ret126#1.base, main_#t~ret126#1.offset, main_#t~ret127#1.base, main_#t~ret127#1.offset, main_#t~nondet128#1, main_#t~switch129#1, main_#t~nondet130#1, main_#t~switch131#1, main_#t~ret132#1, main_#t~ret133#1, main_#t~ret134#1, main_#t~nondet135#1, main_#t~switch136#1, main_#t~ret137#1, main_#t~nondet138#1, main_#t~switch139#1, main_#t~ret140#1, main_#t~ret141#1, main_#t~ret142#1, main_#t~nondet143#1, main_#t~switch144#1, main_#t~ret145#1, main_#t~ret146#1, main_#t~ret147#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~13#1.base, main_~tmp~13#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset, main_~tmp___2~3#1, main_~tmp___3~2#1, main_~tmp___4~2#1, main_~tmp___5~1#1, main_~tmp___6~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~13#1.base, main_~tmp~13#1.offset;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;havoc main_~tmp___2~3#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1;havoc main_~tmp___5~1#1;havoc main_~tmp___6~1#1; {53436#true} is VALID [2022-02-20 22:03:18,697 INFO L272 TraceCheckUtils]: 2: Hoare triple {53436#true} call main_#t~ret125#1.base, main_#t~ret125#1.offset := ldv_zalloc(16); {53489#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:18,697 INFO L290 TraceCheckUtils]: 3: Hoare triple {53489#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {53436#true} is VALID [2022-02-20 22:03:18,697 INFO L290 TraceCheckUtils]: 4: Hoare triple {53436#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {53436#true} is VALID [2022-02-20 22:03:18,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,698 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {53436#true} {53436#true} #910#return; {53436#true} is VALID [2022-02-20 22:03:18,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {53436#true} main_~tmp~13#1.base, main_~tmp~13#1.offset := main_#t~ret125#1.base, main_#t~ret125#1.offset;havoc main_#t~ret125#1.base, main_#t~ret125#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~13#1.base, main_~tmp~13#1.offset; {53436#true} is VALID [2022-02-20 22:03:18,699 INFO L272 TraceCheckUtils]: 8: Hoare triple {53436#true} call main_#t~ret126#1.base, main_#t~ret126#1.offset := ldv_zalloc(16); {53489#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:18,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {53489#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {53436#true} is VALID [2022-02-20 22:03:18,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {53436#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {53436#true} is VALID [2022-02-20 22:03:18,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,699 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {53436#true} {53436#true} #912#return; {53436#true} is VALID [2022-02-20 22:03:18,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {53436#true} main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset := main_#t~ret126#1.base, main_#t~ret126#1.offset;havoc main_#t~ret126#1.base, main_#t~ret126#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset; {53436#true} is VALID [2022-02-20 22:03:18,700 INFO L272 TraceCheckUtils]: 14: Hoare triple {53436#true} call main_#t~ret127#1.base, main_#t~ret127#1.offset := ldv_zalloc(16); {53489#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:18,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {53489#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {53436#true} is VALID [2022-02-20 22:03:18,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {53436#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {53436#true} is VALID [2022-02-20 22:03:18,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,701 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {53436#true} {53436#true} #914#return; {53436#true} is VALID [2022-02-20 22:03:18,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {53436#true} main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset := main_#t~ret127#1.base, main_#t~ret127#1.offset;havoc main_#t~ret127#1.base, main_#t~ret127#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;assume { :begin_inline_ldv_initialize } true; {53436#true} is VALID [2022-02-20 22:03:18,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {53436#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {53436#true} is VALID [2022-02-20 22:03:18,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {53436#true} assume -2147483648 <= main_#t~nondet128#1 && main_#t~nondet128#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet128#1;havoc main_#t~nondet128#1;main_#t~switch129#1 := 0 == main_~tmp___2~3#1; {53436#true} is VALID [2022-02-20 22:03:18,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {53436#true} assume !main_#t~switch129#1;main_#t~switch129#1 := main_#t~switch129#1 || 1 == main_~tmp___2~3#1; {53436#true} is VALID [2022-02-20 22:03:18,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {53436#true} assume main_#t~switch129#1; {53436#true} is VALID [2022-02-20 22:03:18,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {53436#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet135#1 && main_#t~nondet135#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet135#1;havoc main_#t~nondet135#1;main_#t~switch136#1 := 0 == main_~tmp___4~2#1; {53436#true} is VALID [2022-02-20 22:03:18,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {53436#true} assume !main_#t~switch136#1;main_#t~switch136#1 := main_#t~switch136#1 || 1 == main_~tmp___4~2#1; {53436#true} is VALID [2022-02-20 22:03:18,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {53436#true} assume main_#t~switch136#1; {53436#true} is VALID [2022-02-20 22:03:18,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {53436#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_lock_torture_init } true;havoc lock_torture_init_#res#1;havoc lock_torture_init_#t~ret101#1, lock_torture_init_#t~mem102#1.base, lock_torture_init_#t~mem102#1.offset, lock_torture_init_#t~mem103#1.base, lock_torture_init_#t~mem103#1.offset, lock_torture_init_#t~nondet104#1, lock_torture_init_#t~nondet105#1, lock_torture_init_#t~nondet106#1, lock_torture_init_#t~nondet107#1, lock_torture_init_#t~mem108#1.base, lock_torture_init_#t~mem108#1.offset, lock_torture_init_#t~mem109#1.base, lock_torture_init_#t~mem109#1.offset, lock_torture_init_#t~nondet110#1, lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset, lock_torture_init_#t~mem113#1.base, lock_torture_init_#t~mem113#1.offset, lock_torture_init_#t~ret114#1, lock_torture_init_#t~ret115#1.base, lock_torture_init_#t~ret115#1.offset, lock_torture_init_#t~nondet116#1, lock_torture_init_#t~ret117#1, lock_torture_init_#t~ret118#1, lock_torture_init_#t~ret119#1, lock_torture_init_#t~ret120#1, lock_torture_init_#t~ret121#1.base, lock_torture_init_#t~ret121#1.offset, lock_torture_init_#t~nondet122#1, lock_torture_init_#t~ret123#1, lock_torture_init_#t~ret124#1, lock_torture_init_~i~2#1, lock_torture_init_~firsterr~0#1, lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset, lock_torture_init_~tmp~12#1, lock_torture_init_~tmp___0~9#1, lock_torture_init_~tmp___1~3#1, lock_torture_init_~tmp___2~2#1, lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset, lock_torture_init_~tmp___4~1#1.base, lock_torture_init_~tmp___4~1#1.offset;havoc lock_torture_init_~i~2#1;havoc lock_torture_init_~firsterr~0#1;call lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset := #Ultimate.allocOnStack(24);havoc lock_torture_init_~tmp~12#1;havoc lock_torture_init_~tmp___0~9#1;havoc lock_torture_init_~tmp___1~3#1;havoc lock_torture_init_~tmp___2~2#1;havoc lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset;havoc lock_torture_init_~tmp___4~1#1.base, lock_torture_init_~tmp___4~1#1.offset;lock_torture_init_~firsterr~0#1 := 0;call write~$Pointer$(~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset, 8);call write~$Pointer$(~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, 8 + lock_torture_init_~#torture_ops~0#1.offset, 8);call write~$Pointer$(~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, 16 + lock_torture_init_~#torture_ops~0#1.offset, 8);assume { :begin_inline_torture_init_begin } true;torture_init_begin_#in~arg0#1.base, torture_init_begin_#in~arg0#1.offset, torture_init_begin_#in~arg1#1, torture_init_begin_#in~arg2#1.base, torture_init_begin_#in~arg2#1.offset := ~torture_type~0.base, ~torture_type~0.offset, (if 0 == ~verbose~0 % 256 then 0 else 1), ~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset;havoc torture_init_begin_#res#1;havoc torture_init_begin_#t~nondet165#1, torture_init_begin_~arg0#1.base, torture_init_begin_~arg0#1.offset, torture_init_begin_~arg1#1, torture_init_begin_~arg2#1.base, torture_init_begin_~arg2#1.offset;torture_init_begin_~arg0#1.base, torture_init_begin_~arg0#1.offset := torture_init_begin_#in~arg0#1.base, torture_init_begin_#in~arg0#1.offset;torture_init_begin_~arg1#1 := torture_init_begin_#in~arg1#1;torture_init_begin_~arg2#1.base, torture_init_begin_~arg2#1.offset := torture_init_begin_#in~arg2#1.base, torture_init_begin_#in~arg2#1.offset;torture_init_begin_#res#1 := torture_init_begin_#t~nondet165#1;havoc torture_init_begin_#t~nondet165#1; {53436#true} is VALID [2022-02-20 22:03:18,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {53436#true} lock_torture_init_#t~ret101#1 := torture_init_begin_#res#1;assume { :end_inline_torture_init_begin } true;lock_torture_init_~tmp~12#1 := lock_torture_init_#t~ret101#1;havoc lock_torture_init_#t~ret101#1; {53436#true} is VALID [2022-02-20 22:03:18,702 INFO L290 TraceCheckUtils]: 29: Hoare triple {53436#true} assume 0 != lock_torture_init_~tmp~12#1 % 256;lock_torture_init_~tmp___0~9#1 := 0; {53436#true} is VALID [2022-02-20 22:03:18,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {53436#true} assume !(0 != lock_torture_init_~tmp___0~9#1);lock_torture_init_~i~2#1 := 0; {53436#true} is VALID [2022-02-20 22:03:18,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {53436#true} assume !(lock_torture_init_~i~2#1 % 4294967296 <= 2); {53436#true} is VALID [2022-02-20 22:03:18,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {53436#true} assume !(3 == lock_torture_init_~i~2#1);call lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset := read~$Pointer$(~cur_ops~0.base, ~cur_ops~0.offset, 8); {53436#true} is VALID [2022-02-20 22:03:18,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {53436#true} assume !(0 != (lock_torture_init_#t~mem111#1.base + lock_torture_init_#t~mem111#1.offset) % 18446744073709551616);havoc lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset; {53436#true} is VALID [2022-02-20 22:03:18,703 INFO L290 TraceCheckUtils]: 34: Hoare triple {53436#true} assume !(~nwriters_stress~0 >= 0);assume { :begin_inline_cpumask_weight } true;cpumask_weight_#in~srcp#1.base, cpumask_weight_#in~srcp#1.offset := ~cpu_online_mask~0.base, ~cpu_online_mask~0.offset;havoc cpumask_weight_#res#1;havoc cpumask_weight_#t~ret12#1, cpumask_weight_~srcp#1.base, cpumask_weight_~srcp#1.offset, cpumask_weight_~tmp~0#1;cpumask_weight_~srcp#1.base, cpumask_weight_~srcp#1.offset := cpumask_weight_#in~srcp#1.base, cpumask_weight_#in~srcp#1.offset;havoc cpumask_weight_~tmp~0#1;assume { :begin_inline_bitmap_weight } true;bitmap_weight_#in~src#1.base, bitmap_weight_#in~src#1.offset, bitmap_weight_#in~nbits#1 := cpumask_weight_~srcp#1.base, cpumask_weight_~srcp#1.offset, ~nr_cpu_ids~0;havoc bitmap_weight_#res#1;havoc bitmap_weight_#t~ret11#1, bitmap_weight_~src#1.base, bitmap_weight_~src#1.offset, bitmap_weight_~nbits#1, bitmap_weight_~tmp___0~0#1;bitmap_weight_~src#1.base, bitmap_weight_~src#1.offset := bitmap_weight_#in~src#1.base, bitmap_weight_#in~src#1.offset;bitmap_weight_~nbits#1 := bitmap_weight_#in~nbits#1;havoc bitmap_weight_~tmp___0~0#1;assume { :begin_inline___bitmap_weight } true;__bitmap_weight_#in~arg0#1.base, __bitmap_weight_#in~arg0#1.offset, __bitmap_weight_#in~arg1#1 := bitmap_weight_~src#1.base, bitmap_weight_~src#1.offset, bitmap_weight_~nbits#1;havoc __bitmap_weight_#res#1;havoc __bitmap_weight_#t~nondet151#1, __bitmap_weight_~arg0#1.base, __bitmap_weight_~arg0#1.offset, __bitmap_weight_~arg1#1;__bitmap_weight_~arg0#1.base, __bitmap_weight_~arg0#1.offset := __bitmap_weight_#in~arg0#1.base, __bitmap_weight_#in~arg0#1.offset;__bitmap_weight_~arg1#1 := __bitmap_weight_#in~arg1#1;assume -2147483648 <= __bitmap_weight_#t~nondet151#1 && __bitmap_weight_#t~nondet151#1 <= 2147483647;__bitmap_weight_#res#1 := __bitmap_weight_#t~nondet151#1;havoc __bitmap_weight_#t~nondet151#1; {53436#true} is VALID [2022-02-20 22:03:18,703 INFO L290 TraceCheckUtils]: 35: Hoare triple {53436#true} bitmap_weight_#t~ret11#1 := __bitmap_weight_#res#1;assume { :end_inline___bitmap_weight } true;assume -2147483648 <= bitmap_weight_#t~ret11#1 && bitmap_weight_#t~ret11#1 <= 2147483647;bitmap_weight_~tmp___0~0#1 := bitmap_weight_#t~ret11#1;havoc bitmap_weight_#t~ret11#1;bitmap_weight_#res#1 := bitmap_weight_~tmp___0~0#1; {53436#true} is VALID [2022-02-20 22:03:18,703 INFO L290 TraceCheckUtils]: 36: Hoare triple {53436#true} cpumask_weight_#t~ret12#1 := bitmap_weight_#res#1;assume { :end_inline_bitmap_weight } true;assume -2147483648 <= cpumask_weight_#t~ret12#1 && cpumask_weight_#t~ret12#1 <= 2147483647;cpumask_weight_~tmp~0#1 := cpumask_weight_#t~ret12#1;havoc cpumask_weight_#t~ret12#1;cpumask_weight_#res#1 := cpumask_weight_~tmp~0#1; {53436#true} is VALID [2022-02-20 22:03:18,704 INFO L290 TraceCheckUtils]: 37: Hoare triple {53436#true} lock_torture_init_#t~ret114#1 := cpumask_weight_#res#1;assume { :end_inline_cpumask_weight } true;lock_torture_init_~tmp___2~2#1 := lock_torture_init_#t~ret114#1;havoc lock_torture_init_#t~ret114#1;~nrealwriters_stress~0 := (if 2 * lock_torture_init_~tmp___2~2#1 % 4294967296 % 4294967296 <= 2147483647 then 2 * lock_torture_init_~tmp___2~2#1 % 4294967296 % 4294967296 else 2 * lock_torture_init_~tmp___2~2#1 % 4294967296 % 4294967296 - 4294967296); {53436#true} is VALID [2022-02-20 22:03:18,704 INFO L272 TraceCheckUtils]: 38: Hoare triple {53436#true} call lock_torture_print_module_parms(~cur_ops~0.base, ~cur_ops~0.offset, 36, 0); {53436#true} is VALID [2022-02-20 22:03:18,704 INFO L290 TraceCheckUtils]: 39: Hoare triple {53436#true} ~cur_ops___0.base, ~cur_ops___0.offset := #in~cur_ops___0.base, #in~cur_ops___0.offset;~tag.base, ~tag.offset := #in~tag.base, #in~tag.offset;havoc #t~nondet97; {53436#true} is VALID [2022-02-20 22:03:18,704 INFO L290 TraceCheckUtils]: 40: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,704 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {53436#true} {53436#true} #934#return; {53436#true} is VALID [2022-02-20 22:03:18,704 INFO L290 TraceCheckUtils]: 42: Hoare triple {53436#true} ~lock_is_write_held~0 := 0; {53436#true} is VALID [2022-02-20 22:03:18,705 INFO L272 TraceCheckUtils]: 43: Hoare triple {53436#true} call lock_torture_init_#t~ret115#1.base, lock_torture_init_#t~ret115#1.offset := kmalloc(16 * ~nrealwriters_stress~0, 208); {53490#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:18,705 INFO L290 TraceCheckUtils]: 44: Hoare triple {53490#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1; {53436#true} is VALID [2022-02-20 22:03:18,705 INFO L272 TraceCheckUtils]: 45: Hoare triple {53436#true} call ldv_check_alloc_flags(~flags#1); {53436#true} is VALID [2022-02-20 22:03:18,706 INFO L290 TraceCheckUtils]: 46: Hoare triple {53436#true} ~flags := #in~flags; {53436#true} is VALID [2022-02-20 22:03:18,706 INFO L290 TraceCheckUtils]: 47: Hoare triple {53436#true} assume 0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296; {53436#true} is VALID [2022-02-20 22:03:18,706 INFO L290 TraceCheckUtils]: 48: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,706 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {53436#true} {53436#true} #864#return; {53436#true} is VALID [2022-02-20 22:03:18,706 INFO L290 TraceCheckUtils]: 50: Hoare triple {53436#true} assume { :begin_inline_ldv_kmalloc_12 } true;ldv_kmalloc_12_#in~size#1, ldv_kmalloc_12_#in~flags#1 := ~size#1, ~flags#1;havoc ldv_kmalloc_12_#res#1.base, ldv_kmalloc_12_#res#1.offset;havoc ldv_kmalloc_12_#t~ret23#1.base, ldv_kmalloc_12_#t~ret23#1.offset, ldv_kmalloc_12_~size#1, ldv_kmalloc_12_~flags#1, ldv_kmalloc_12_~tmp___2~0#1.base, ldv_kmalloc_12_~tmp___2~0#1.offset;ldv_kmalloc_12_~size#1 := ldv_kmalloc_12_#in~size#1;ldv_kmalloc_12_~flags#1 := ldv_kmalloc_12_#in~flags#1;havoc ldv_kmalloc_12_~tmp___2~0#1.base, ldv_kmalloc_12_~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := ldv_kmalloc_12_~size#1, ldv_kmalloc_12_~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret20#1.base, __kmalloc_#t~ret20#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {53436#true} is VALID [2022-02-20 22:03:18,707 INFO L272 TraceCheckUtils]: 51: Hoare triple {53436#true} call __kmalloc_#t~ret20#1.base, __kmalloc_#t~ret20#1.offset := ldv_malloc(__kmalloc_~size#1); {53490#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:18,707 INFO L290 TraceCheckUtils]: 52: Hoare triple {53490#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___0~1 := #t~nondet24;havoc #t~nondet24; {53436#true} is VALID [2022-02-20 22:03:18,707 INFO L290 TraceCheckUtils]: 53: Hoare triple {53436#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {53436#true} is VALID [2022-02-20 22:03:18,707 INFO L290 TraceCheckUtils]: 54: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,707 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {53436#true} {53436#true} #866#return; {53436#true} is VALID [2022-02-20 22:03:18,708 INFO L290 TraceCheckUtils]: 56: Hoare triple {53436#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret20#1.base, __kmalloc_#t~ret20#1.offset;havoc __kmalloc_#t~ret20#1.base, __kmalloc_#t~ret20#1.offset; {53436#true} is VALID [2022-02-20 22:03:18,708 INFO L290 TraceCheckUtils]: 57: Hoare triple {53436#true} ldv_kmalloc_12_#t~ret23#1.base, ldv_kmalloc_12_#t~ret23#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;ldv_kmalloc_12_~tmp___2~0#1.base, ldv_kmalloc_12_~tmp___2~0#1.offset := ldv_kmalloc_12_#t~ret23#1.base, ldv_kmalloc_12_#t~ret23#1.offset;havoc ldv_kmalloc_12_#t~ret23#1.base, ldv_kmalloc_12_#t~ret23#1.offset;ldv_kmalloc_12_#res#1.base, ldv_kmalloc_12_#res#1.offset := ldv_kmalloc_12_~tmp___2~0#1.base, ldv_kmalloc_12_~tmp___2~0#1.offset; {53436#true} is VALID [2022-02-20 22:03:18,708 INFO L290 TraceCheckUtils]: 58: Hoare triple {53436#true} #t~ret148#1.base, #t~ret148#1.offset := ldv_kmalloc_12_#res#1.base, ldv_kmalloc_12_#res#1.offset;assume { :end_inline_ldv_kmalloc_12 } true;havoc #t~ret148#1.base, #t~ret148#1.offset;#res#1.base, #res#1.offset := 0, 0; {53436#true} is VALID [2022-02-20 22:03:18,708 INFO L290 TraceCheckUtils]: 59: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,708 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {53436#true} {53436#true} #936#return; {53436#true} is VALID [2022-02-20 22:03:18,708 INFO L290 TraceCheckUtils]: 61: Hoare triple {53436#true} lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset := lock_torture_init_#t~ret115#1.base, lock_torture_init_#t~ret115#1.offset;havoc lock_torture_init_#t~ret115#1.base, lock_torture_init_#t~ret115#1.offset;~lwsa~0.base, ~lwsa~0.offset := lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset; {53436#true} is VALID [2022-02-20 22:03:18,708 INFO L290 TraceCheckUtils]: 62: Hoare triple {53436#true} assume 0 == (~lwsa~0.base + ~lwsa~0.offset) % 18446744073709551616; {53436#true} is VALID [2022-02-20 22:03:18,709 INFO L290 TraceCheckUtils]: 63: Hoare triple {53436#true} assume 0 != ~verbose~0 % 256;havoc lock_torture_init_#t~nondet116#1; {53436#true} is VALID [2022-02-20 22:03:18,709 INFO L290 TraceCheckUtils]: 64: Hoare triple {53436#true} lock_torture_init_~firsterr~0#1 := -12; {53436#true} is VALID [2022-02-20 22:03:18,709 INFO L272 TraceCheckUtils]: 65: Hoare triple {53436#true} call torture_init_end(); {53436#true} is VALID [2022-02-20 22:03:18,709 INFO L290 TraceCheckUtils]: 66: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,709 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {53436#true} {53436#true} #946#return; {53436#true} is VALID [2022-02-20 22:03:18,710 INFO L272 TraceCheckUtils]: 68: Hoare triple {53436#true} call lock_torture_cleanup(); {53499#(and (= |old(#length)| |#length|) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))} is VALID [2022-02-20 22:03:18,710 INFO L290 TraceCheckUtils]: 69: Hoare triple {53499#(and (= |old(#length)| |#length|) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))} havoc ~i~1#1;havoc ~tmp~11#1;havoc ~tmp___0~8#1;havoc ~tmp___1~2#1;assume { :begin_inline_torture_cleanup } true;havoc torture_cleanup_#res#1;havoc torture_cleanup_#t~nondet164#1;torture_cleanup_#res#1 := torture_cleanup_#t~nondet164#1;havoc torture_cleanup_#t~nondet164#1; {53436#true} is VALID [2022-02-20 22:03:18,710 INFO L290 TraceCheckUtils]: 70: Hoare triple {53436#true} #t~ret98#1 := torture_cleanup_#res#1;assume { :end_inline_torture_cleanup } true;~tmp~11#1 := #t~ret98#1;havoc #t~ret98#1; {53436#true} is VALID [2022-02-20 22:03:18,710 INFO L290 TraceCheckUtils]: 71: Hoare triple {53436#true} assume 0 != ~tmp~11#1 % 256; {53436#true} is VALID [2022-02-20 22:03:18,710 INFO L290 TraceCheckUtils]: 72: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,711 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {53436#true} {53436#true} #948#return; {53436#true} is VALID [2022-02-20 22:03:18,711 INFO L290 TraceCheckUtils]: 74: Hoare triple {53436#true} lock_torture_init_#res#1 := lock_torture_init_~firsterr~0#1;call ULTIMATE.dealloc(lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset);havoc lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset; {53436#true} is VALID [2022-02-20 22:03:18,711 INFO L290 TraceCheckUtils]: 75: Hoare triple {53436#true} main_#t~ret137#1 := lock_torture_init_#res#1;assume { :end_inline_lock_torture_init } true;assume -2147483648 <= main_#t~ret137#1 && main_#t~ret137#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret137#1;havoc main_#t~ret137#1; {53436#true} is VALID [2022-02-20 22:03:18,711 INFO L290 TraceCheckUtils]: 76: Hoare triple {53436#true} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_2~0 := 1;~ldv_state_variable_3~0 := 1;~ldv_state_variable_1~0 := 1; {53477#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 22:03:18,712 INFO L290 TraceCheckUtils]: 77: Hoare triple {53477#(= ~ldv_state_variable_1~0 1)} assume !(0 != ~ldv_retval_0~0); {53477#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 22:03:18,712 INFO L290 TraceCheckUtils]: 78: Hoare triple {53477#(= ~ldv_state_variable_1~0 1)} assume -2147483648 <= main_#t~nondet128#1 && main_#t~nondet128#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet128#1;havoc main_#t~nondet128#1;main_#t~switch129#1 := 0 == main_~tmp___2~3#1; {53477#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 22:03:18,712 INFO L290 TraceCheckUtils]: 79: Hoare triple {53477#(= ~ldv_state_variable_1~0 1)} assume main_#t~switch129#1; {53477#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 22:03:18,713 INFO L290 TraceCheckUtils]: 80: Hoare triple {53477#(= ~ldv_state_variable_1~0 1)} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet130#1 && main_#t~nondet130#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet130#1;havoc main_#t~nondet130#1;main_#t~switch131#1 := 0 == main_~tmp___3~2#1; {53477#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 22:03:18,713 INFO L290 TraceCheckUtils]: 81: Hoare triple {53477#(= ~ldv_state_variable_1~0 1)} assume main_#t~switch131#1; {53477#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 22:03:18,713 INFO L290 TraceCheckUtils]: 82: Hoare triple {53477#(= ~ldv_state_variable_1~0 1)} assume 2 == ~ldv_state_variable_1~0; {53437#false} is VALID [2022-02-20 22:03:18,714 INFO L272 TraceCheckUtils]: 83: Hoare triple {53437#false} call main_#t~ret132#1 := torture_spin_lock_write_lock_irq(); {53500#(and (= ~ldv_spin~0 |old(~ldv_spin~0)|) (= |#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:03:18,714 INFO L290 TraceCheckUtils]: 84: Hoare triple {53500#(and (= ~ldv_spin~0 |old(~ldv_spin~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} havoc ~flags~0; {53436#true} is VALID [2022-02-20 22:03:18,714 INFO L272 TraceCheckUtils]: 85: Hoare triple {53436#true} call ldv_spin_lock(); {53504#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 22:03:18,714 INFO L290 TraceCheckUtils]: 86: Hoare triple {53504#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {53436#true} is VALID [2022-02-20 22:03:18,714 INFO L290 TraceCheckUtils]: 87: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,715 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {53436#true} {53436#true} #892#return; {53436#true} is VALID [2022-02-20 22:03:18,715 INFO L290 TraceCheckUtils]: 89: Hoare triple {53436#true} call write~int(~flags~0, ~cur_ops~0.base, 32 + ~cur_ops~0.offset, 8);#res := 0; {53436#true} is VALID [2022-02-20 22:03:18,715 INFO L290 TraceCheckUtils]: 90: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,715 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {53436#true} {53437#false} #916#return; {53437#false} is VALID [2022-02-20 22:03:18,715 INFO L290 TraceCheckUtils]: 92: Hoare triple {53437#false} assume -2147483648 <= main_#t~ret132#1 && main_#t~ret132#1 <= 2147483647;havoc main_#t~ret132#1;~ldv_state_variable_1~0 := 2; {53437#false} is VALID [2022-02-20 22:03:18,715 INFO L290 TraceCheckUtils]: 93: Hoare triple {53437#false} assume -2147483648 <= main_#t~nondet128#1 && main_#t~nondet128#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet128#1;havoc main_#t~nondet128#1;main_#t~switch129#1 := 0 == main_~tmp___2~3#1; {53437#false} is VALID [2022-02-20 22:03:18,716 INFO L290 TraceCheckUtils]: 94: Hoare triple {53437#false} assume !main_#t~switch129#1;main_#t~switch129#1 := main_#t~switch129#1 || 1 == main_~tmp___2~3#1; {53437#false} is VALID [2022-02-20 22:03:18,716 INFO L290 TraceCheckUtils]: 95: Hoare triple {53437#false} assume main_#t~switch129#1; {53437#false} is VALID [2022-02-20 22:03:18,716 INFO L290 TraceCheckUtils]: 96: Hoare triple {53437#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet135#1 && main_#t~nondet135#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet135#1;havoc main_#t~nondet135#1;main_#t~switch136#1 := 0 == main_~tmp___4~2#1; {53437#false} is VALID [2022-02-20 22:03:18,716 INFO L290 TraceCheckUtils]: 97: Hoare triple {53437#false} assume main_#t~switch136#1; {53437#false} is VALID [2022-02-20 22:03:18,716 INFO L290 TraceCheckUtils]: 98: Hoare triple {53437#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0; {53437#false} is VALID [2022-02-20 22:03:18,716 INFO L272 TraceCheckUtils]: 99: Hoare triple {53437#false} call lock_torture_cleanup(); {53437#false} is VALID [2022-02-20 22:03:18,716 INFO L290 TraceCheckUtils]: 100: Hoare triple {53437#false} havoc ~i~1#1;havoc ~tmp~11#1;havoc ~tmp___0~8#1;havoc ~tmp___1~2#1;assume { :begin_inline_torture_cleanup } true;havoc torture_cleanup_#res#1;havoc torture_cleanup_#t~nondet164#1;torture_cleanup_#res#1 := torture_cleanup_#t~nondet164#1;havoc torture_cleanup_#t~nondet164#1; {53437#false} is VALID [2022-02-20 22:03:18,717 INFO L290 TraceCheckUtils]: 101: Hoare triple {53437#false} #t~ret98#1 := torture_cleanup_#res#1;assume { :end_inline_torture_cleanup } true;~tmp~11#1 := #t~ret98#1;havoc #t~ret98#1; {53437#false} is VALID [2022-02-20 22:03:18,717 INFO L290 TraceCheckUtils]: 102: Hoare triple {53437#false} assume !(0 != ~tmp~11#1 % 256); {53437#false} is VALID [2022-02-20 22:03:18,717 INFO L290 TraceCheckUtils]: 103: Hoare triple {53437#false} assume !(0 != (~writer_tasks~0.base + ~writer_tasks~0.offset) % 18446744073709551616); {53437#false} is VALID [2022-02-20 22:03:18,717 INFO L272 TraceCheckUtils]: 104: Hoare triple {53437#false} call _torture_stop_kthread(28, 0, ~#stats_task~0.base, ~#stats_task~0.offset); {53436#true} is VALID [2022-02-20 22:03:18,717 INFO L290 TraceCheckUtils]: 105: Hoare triple {53436#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset; {53436#true} is VALID [2022-02-20 22:03:18,717 INFO L290 TraceCheckUtils]: 106: Hoare triple {53436#true} assume true; {53436#true} is VALID [2022-02-20 22:03:18,717 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {53436#true} {53437#false} #882#return; {53437#false} is VALID [2022-02-20 22:03:18,718 INFO L272 TraceCheckUtils]: 108: Hoare triple {53437#false} call lock_torture_stats_print(); {53437#false} is VALID [2022-02-20 22:03:18,718 INFO L290 TraceCheckUtils]: 109: Hoare triple {53437#false} havoc ~size~0#1;havoc ~buf~0#1.base, ~buf~0#1.offset;havoc ~tmp~9#1.base, ~tmp~9#1.offset;~size~0#1 := 8192 + 200 * ~nrealwriters_stress~0; {53437#false} is VALID [2022-02-20 22:03:18,718 INFO L272 TraceCheckUtils]: 110: Hoare triple {53437#false} call #t~ret91#1.base, #t~ret91#1.offset := kmalloc(~size~0#1, 208); {53437#false} is VALID [2022-02-20 22:03:18,718 INFO L290 TraceCheckUtils]: 111: Hoare triple {53437#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1; {53437#false} is VALID [2022-02-20 22:03:18,718 INFO L272 TraceCheckUtils]: 112: Hoare triple {53437#false} call ldv_check_alloc_flags(~flags#1); {53437#false} is VALID [2022-02-20 22:03:18,718 INFO L290 TraceCheckUtils]: 113: Hoare triple {53437#false} ~flags := #in~flags; {53437#false} is VALID [2022-02-20 22:03:18,719 INFO L290 TraceCheckUtils]: 114: Hoare triple {53437#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {53437#false} is VALID [2022-02-20 22:03:18,719 INFO L272 TraceCheckUtils]: 115: Hoare triple {53437#false} call ldv_error(); {53437#false} is VALID [2022-02-20 22:03:18,719 INFO L290 TraceCheckUtils]: 116: Hoare triple {53437#false} assume !false; {53437#false} is VALID [2022-02-20 22:03:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 22:03:18,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:03:18,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213535650] [2022-02-20 22:03:18,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213535650] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:03:18,720 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:03:18,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 22:03:18,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111123020] [2022-02-20 22:03:18,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:03:18,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2022-02-20 22:03:18,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:03:18,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 22:03:18,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:03:18,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 22:03:18,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:03:18,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 22:03:18,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 22:03:18,806 INFO L87 Difference]: Start difference. First operand 2936 states and 4048 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 22:03:25,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:03:25,949 INFO L93 Difference]: Finished difference Result 7847 states and 10900 transitions. [2022-02-20 22:03:25,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 22:03:25,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2022-02-20 22:03:25,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:03:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 22:03:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1411 transitions. [2022-02-20 22:03:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 22:03:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1411 transitions. [2022-02-20 22:03:25,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 1411 transitions. [2022-02-20 22:03:27,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1411 edges. 1411 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:03:28,062 INFO L225 Difference]: With dead ends: 7847 [2022-02-20 22:03:28,062 INFO L226 Difference]: Without dead ends: 4931 [2022-02-20 22:03:28,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-02-20 22:03:28,081 INFO L933 BasicCegarLoop]: 704 mSDtfsCounter, 953 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 22:03:28,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [987 Valid, 1867 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 22:03:28,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4931 states. [2022-02-20 22:03:29,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4931 to 4414. [2022-02-20 22:03:29,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:03:29,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4931 states. Second operand has 4414 states, 3444 states have (on average 1.3945993031358885) internal successors, (4803), 3560 states have internal predecessors, (4803), 627 states have call successors, (627), 341 states have call predecessors, (627), 342 states have return successors, (634), 580 states have call predecessors, (634), 622 states have call successors, (634) [2022-02-20 22:03:29,044 INFO L74 IsIncluded]: Start isIncluded. First operand 4931 states. Second operand has 4414 states, 3444 states have (on average 1.3945993031358885) internal successors, (4803), 3560 states have internal predecessors, (4803), 627 states have call successors, (627), 341 states have call predecessors, (627), 342 states have return successors, (634), 580 states have call predecessors, (634), 622 states have call successors, (634) [2022-02-20 22:03:29,052 INFO L87 Difference]: Start difference. First operand 4931 states. Second operand has 4414 states, 3444 states have (on average 1.3945993031358885) internal successors, (4803), 3560 states have internal predecessors, (4803), 627 states have call successors, (627), 341 states have call predecessors, (627), 342 states have return successors, (634), 580 states have call predecessors, (634), 622 states have call successors, (634) [2022-02-20 22:03:30,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:03:30,055 INFO L93 Difference]: Finished difference Result 4931 states and 6815 transitions. [2022-02-20 22:03:30,055 INFO L276 IsEmpty]: Start isEmpty. Operand 4931 states and 6815 transitions. [2022-02-20 22:03:30,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:03:30,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:03:30,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 4414 states, 3444 states have (on average 1.3945993031358885) internal successors, (4803), 3560 states have internal predecessors, (4803), 627 states have call successors, (627), 341 states have call predecessors, (627), 342 states have return successors, (634), 580 states have call predecessors, (634), 622 states have call successors, (634) Second operand 4931 states. [2022-02-20 22:03:30,086 INFO L87 Difference]: Start difference. First operand has 4414 states, 3444 states have (on average 1.3945993031358885) internal successors, (4803), 3560 states have internal predecessors, (4803), 627 states have call successors, (627), 341 states have call predecessors, (627), 342 states have return successors, (634), 580 states have call predecessors, (634), 622 states have call successors, (634) Second operand 4931 states. [2022-02-20 22:03:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:03:30,910 INFO L93 Difference]: Finished difference Result 4931 states and 6815 transitions. [2022-02-20 22:03:30,910 INFO L276 IsEmpty]: Start isEmpty. Operand 4931 states and 6815 transitions. [2022-02-20 22:03:30,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:03:30,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:03:30,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:03:30,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:03:30,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4414 states, 3444 states have (on average 1.3945993031358885) internal successors, (4803), 3560 states have internal predecessors, (4803), 627 states have call successors, (627), 341 states have call predecessors, (627), 342 states have return successors, (634), 580 states have call predecessors, (634), 622 states have call successors, (634) [2022-02-20 22:03:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4414 states to 4414 states and 6064 transitions. [2022-02-20 22:03:32,039 INFO L78 Accepts]: Start accepts. Automaton has 4414 states and 6064 transitions. Word has length 117 [2022-02-20 22:03:32,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:03:32,039 INFO L470 AbstractCegarLoop]: Abstraction has 4414 states and 6064 transitions. [2022-02-20 22:03:32,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 22:03:32,040 INFO L276 IsEmpty]: Start isEmpty. Operand 4414 states and 6064 transitions. [2022-02-20 22:03:32,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-02-20 22:03:32,044 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:03:32,044 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 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, 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:03:32,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 22:03:32,045 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:03:32,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:03:32,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1717722878, now seen corresponding path program 1 times [2022-02-20 22:03:32,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:03:32,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247299188] [2022-02-20 22:03:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:03:32,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:03:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:32,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:03:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:32,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {79988#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {79932#true} is VALID [2022-02-20 22:03:32,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {79932#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {79932#true} is VALID [2022-02-20 22:03:32,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79932#true} {79932#true} #910#return; {79932#true} is VALID [2022-02-20 22:03:32,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:03:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:32,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {79988#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {79932#true} is VALID [2022-02-20 22:03:32,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {79932#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {79932#true} is VALID [2022-02-20 22:03:32,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79932#true} {79932#true} #912#return; {79932#true} is VALID [2022-02-20 22:03:32,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:03:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:32,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {79988#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {79932#true} is VALID [2022-02-20 22:03:32,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {79932#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {79932#true} is VALID [2022-02-20 22:03:32,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79932#true} {79932#true} #914#return; {79932#true} is VALID [2022-02-20 22:03:32,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 22:03:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:32,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {79932#true} ~cur_ops___0.base, ~cur_ops___0.offset := #in~cur_ops___0.base, #in~cur_ops___0.offset;~tag.base, ~tag.offset := #in~tag.base, #in~tag.offset;havoc #t~nondet97; {79932#true} is VALID [2022-02-20 22:03:32,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,156 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79932#true} {79932#true} #934#return; {79932#true} is VALID [2022-02-20 22:03:32,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 22:03:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:32,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:03:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:32,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {79932#true} ~flags := #in~flags; {79932#true} is VALID [2022-02-20 22:03:32,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {79932#true} assume 0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296; {79932#true} is VALID [2022-02-20 22:03:32,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79932#true} {79932#true} #864#return; {79932#true} is VALID [2022-02-20 22:03:32,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 22:03:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:32,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {79989#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___0~1 := #t~nondet24;havoc #t~nondet24; {79932#true} is VALID [2022-02-20 22:03:32,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {79932#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {79932#true} is VALID [2022-02-20 22:03:32,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79932#true} {79932#true} #866#return; {79932#true} is VALID [2022-02-20 22:03:32,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {79989#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1; {79932#true} is VALID [2022-02-20 22:03:32,195 INFO L272 TraceCheckUtils]: 1: Hoare triple {79932#true} call ldv_check_alloc_flags(~flags#1); {79932#true} is VALID [2022-02-20 22:03:32,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {79932#true} ~flags := #in~flags; {79932#true} is VALID [2022-02-20 22:03:32,196 INFO L290 TraceCheckUtils]: 3: Hoare triple {79932#true} assume 0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296; {79932#true} is VALID [2022-02-20 22:03:32,196 INFO L290 TraceCheckUtils]: 4: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,196 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {79932#true} {79932#true} #864#return; {79932#true} is VALID [2022-02-20 22:03:32,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {79932#true} assume { :begin_inline_ldv_kmalloc_12 } true;ldv_kmalloc_12_#in~size#1, ldv_kmalloc_12_#in~flags#1 := ~size#1, ~flags#1;havoc ldv_kmalloc_12_#res#1.base, ldv_kmalloc_12_#res#1.offset;havoc ldv_kmalloc_12_#t~ret23#1.base, ldv_kmalloc_12_#t~ret23#1.offset, ldv_kmalloc_12_~size#1, ldv_kmalloc_12_~flags#1, ldv_kmalloc_12_~tmp___2~0#1.base, ldv_kmalloc_12_~tmp___2~0#1.offset;ldv_kmalloc_12_~size#1 := ldv_kmalloc_12_#in~size#1;ldv_kmalloc_12_~flags#1 := ldv_kmalloc_12_#in~flags#1;havoc ldv_kmalloc_12_~tmp___2~0#1.base, ldv_kmalloc_12_~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := ldv_kmalloc_12_~size#1, ldv_kmalloc_12_~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret20#1.base, __kmalloc_#t~ret20#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {79932#true} is VALID [2022-02-20 22:03:32,197 INFO L272 TraceCheckUtils]: 7: Hoare triple {79932#true} call __kmalloc_#t~ret20#1.base, __kmalloc_#t~ret20#1.offset := ldv_malloc(__kmalloc_~size#1); {79989#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:32,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {79989#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___0~1 := #t~nondet24;havoc #t~nondet24; {79932#true} is VALID [2022-02-20 22:03:32,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {79932#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {79932#true} is VALID [2022-02-20 22:03:32,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,198 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {79932#true} {79932#true} #866#return; {79932#true} is VALID [2022-02-20 22:03:32,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {79932#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret20#1.base, __kmalloc_#t~ret20#1.offset;havoc __kmalloc_#t~ret20#1.base, __kmalloc_#t~ret20#1.offset; {79932#true} is VALID [2022-02-20 22:03:32,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {79932#true} ldv_kmalloc_12_#t~ret23#1.base, ldv_kmalloc_12_#t~ret23#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;ldv_kmalloc_12_~tmp___2~0#1.base, ldv_kmalloc_12_~tmp___2~0#1.offset := ldv_kmalloc_12_#t~ret23#1.base, ldv_kmalloc_12_#t~ret23#1.offset;havoc ldv_kmalloc_12_#t~ret23#1.base, ldv_kmalloc_12_#t~ret23#1.offset;ldv_kmalloc_12_#res#1.base, ldv_kmalloc_12_#res#1.offset := ldv_kmalloc_12_~tmp___2~0#1.base, ldv_kmalloc_12_~tmp___2~0#1.offset; {79932#true} is VALID [2022-02-20 22:03:32,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {79932#true} #t~ret148#1.base, #t~ret148#1.offset := ldv_kmalloc_12_#res#1.base, ldv_kmalloc_12_#res#1.offset;assume { :end_inline_ldv_kmalloc_12 } true;havoc #t~ret148#1.base, #t~ret148#1.offset;#res#1.base, #res#1.offset := 0, 0; {79932#true} is VALID [2022-02-20 22:03:32,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,198 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {79932#true} {79932#true} #936#return; {79932#true} is VALID [2022-02-20 22:03:32,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 22:03:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:32,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,203 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {79932#true} {79932#true} #946#return; {79932#true} is VALID [2022-02-20 22:03:32,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-20 22:03:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:32,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {79998#(and (= |old(#length)| |#length|) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))} havoc ~i~1#1;havoc ~tmp~11#1;havoc ~tmp___0~8#1;havoc ~tmp___1~2#1;assume { :begin_inline_torture_cleanup } true;havoc torture_cleanup_#res#1;havoc torture_cleanup_#t~nondet164#1;torture_cleanup_#res#1 := torture_cleanup_#t~nondet164#1;havoc torture_cleanup_#t~nondet164#1; {79932#true} is VALID [2022-02-20 22:03:32,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {79932#true} #t~ret98#1 := torture_cleanup_#res#1;assume { :end_inline_torture_cleanup } true;~tmp~11#1 := #t~ret98#1;havoc #t~ret98#1; {79932#true} is VALID [2022-02-20 22:03:32,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {79932#true} assume 0 != ~tmp~11#1 % 256; {79932#true} is VALID [2022-02-20 22:03:32,216 INFO L290 TraceCheckUtils]: 3: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,216 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {79932#true} {79932#true} #948#return; {79932#true} is VALID [2022-02-20 22:03:32,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-02-20 22:03:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:32,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:03:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:32,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {79999#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {79932#true} is VALID [2022-02-20 22:03:32,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79932#true} {79932#true} #896#return; {79932#true} is VALID [2022-02-20 22:03:32,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {79999#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} assume { :begin_inline_spin_lock } true;spin_lock_#in~lock#1.base, spin_lock_#in~lock#1.offset := ~#torture_spinlock~0.base, ~#torture_spinlock~0.offset;havoc spin_lock_~lock#1.base, spin_lock_~lock#1.offset;spin_lock_~lock#1.base, spin_lock_~lock#1.offset := spin_lock_#in~lock#1.base, spin_lock_#in~lock#1.offset; {79932#true} is VALID [2022-02-20 22:03:32,229 INFO L272 TraceCheckUtils]: 1: Hoare triple {79932#true} call ldv_spin_lock(); {79999#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 22:03:32,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {79999#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {79932#true} is VALID [2022-02-20 22:03:32,229 INFO L290 TraceCheckUtils]: 3: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,229 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {79932#true} {79932#true} #896#return; {79932#true} is VALID [2022-02-20 22:03:32,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {79932#true} assume { :begin_inline_ldv_spin_lock_1 } true;ldv_spin_lock_1_#in~lock#1.base, ldv_spin_lock_1_#in~lock#1.offset := spin_lock_~lock#1.base, spin_lock_~lock#1.offset;havoc ldv_spin_lock_1_~lock#1.base, ldv_spin_lock_1_~lock#1.offset;ldv_spin_lock_1_~lock#1.base, ldv_spin_lock_1_~lock#1.offset := ldv_spin_lock_1_#in~lock#1.base, ldv_spin_lock_1_#in~lock#1.offset;assume { :begin_inline__raw_spin_lock } true;_raw_spin_lock_#in~arg0#1.base, _raw_spin_lock_#in~arg0#1.offset := ldv_spin_lock_1_~lock#1.base, ldv_spin_lock_1_~lock#1.offset;havoc _raw_spin_lock_~arg0#1.base, _raw_spin_lock_~arg0#1.offset;_raw_spin_lock_~arg0#1.base, _raw_spin_lock_~arg0#1.offset := _raw_spin_lock_#in~arg0#1.base, _raw_spin_lock_#in~arg0#1.offset; {79932#true} is VALID [2022-02-20 22:03:32,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {79932#true} assume { :end_inline__raw_spin_lock } true; {79932#true} is VALID [2022-02-20 22:03:32,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {79932#true} assume { :end_inline_ldv_spin_lock_1 } true; {79932#true} is VALID [2022-02-20 22:03:32,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {79932#true} assume { :end_inline_spin_lock } true;#res#1 := 0; {79932#true} is VALID [2022-02-20 22:03:32,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,230 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79932#true} {79933#false} #964#return; {79933#false} is VALID [2022-02-20 22:03:32,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-02-20 22:03:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:03:32,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {79932#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset; {79932#true} is VALID [2022-02-20 22:03:32,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,235 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79932#true} {79933#false} #882#return; {79933#false} is VALID [2022-02-20 22:03:32,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {79932#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(100, 2);call #Ultimate.allocInit(10, 3);call #Ultimate.allocInit(12, 4);call #Ultimate.allocInit(17, 5);call #Ultimate.allocInit(10, 6);call #Ultimate.allocInit(14, 7);call #Ultimate.allocInit(17, 8);call #Ultimate.allocInit(33, 9);call #Ultimate.allocInit(216, 10);call #Ultimate.allocInit(20, 11);call #Ultimate.allocInit(20, 12);call #Ultimate.allocInit(6, 13);call write~init~int(37, 13, 0, 1);call write~init~int(115, 13, 1, 1);call write~init~int(37, 13, 2, 1);call write~init~int(115, 13, 3, 1);call write~init~int(32, 13, 4, 1);call write~init~int(0, 13, 5, 1);call #Ultimate.allocInit(10, 14);call #Ultimate.allocInit(56, 15);call #Ultimate.allocInit(4, 16);call write~init~int(63, 16, 0, 1);call write~init~int(63, 16, 1, 1);call write~init~int(63, 16, 2, 1);call write~init~int(0, 16, 3, 1);call #Ultimate.allocInit(1, 17);call write~init~int(0, 17, 0, 1);call #Ultimate.allocInit(4, 18);call write~init~int(33, 18, 0, 1);call write~init~int(33, 18, 1, 1);call write~init~int(33, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(1, 19);call write~init~int(0, 19, 0, 1);call #Ultimate.allocInit(51, 20);call #Ultimate.allocInit(4, 21);call write~init~int(9, 21, 0, 1);call write~init~int(37, 21, 1, 1);call write~init~int(115, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(17, 22);call #Ultimate.allocInit(32, 23);call #Ultimate.allocInit(19, 24);call #Ultimate.allocInit(19, 25);call #Ultimate.allocInit(151, 26);call #Ultimate.allocInit(34, 27);call #Ultimate.allocInit(33, 28);call #Ultimate.allocInit(21, 29);call #Ultimate.allocInit(26, 30);call #Ultimate.allocInit(21, 31);call #Ultimate.allocInit(43, 32);call #Ultimate.allocInit(21, 33);call #Ultimate.allocInit(5, 34);call write~init~int(9, 34, 0, 1);call write~init~int(32, 34, 1, 1);call write~init~int(37, 34, 2, 1);call write~init~int(115, 34, 3, 1);call write~init~int(0, 34, 4, 1);call #Ultimate.allocInit(3, 35);call write~init~int(9, 35, 0, 1);call write~init~int(10, 35, 1, 1);call write~init~int(0, 35, 2, 1);call #Ultimate.allocInit(14, 36);call #Ultimate.allocInit(17, 37);call #Ultimate.allocInit(20, 38);call #Ultimate.allocInit(20, 39);call #Ultimate.allocInit(28, 40);call #Ultimate.allocInit(20, 41);call #Ultimate.allocInit(34, 42);call #Ultimate.allocInit(37, 43);call #Ultimate.allocInit(19, 44);call #Ultimate.allocInit(33, 45);call #Ultimate.allocInit(36, 46);~ldv_state_variable_3~0 := 0;~ldv_state_variable_1~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~nwriters_stress~0 := -1;~onoff_holdoff~0 := 0;~onoff_interval~0 := 0;~shuffle_interval~0 := 3;~shutdown_secs~0 := 0;~stat_interval~0 := 60;~stutter~0 := 5;~verbose~0 := 1;~torture_type~0.base, ~torture_type~0.offset := 3, 0;~#n_lock_torture_errors~0.base, ~#n_lock_torture_errors~0.offset := 47, 0;call #Ultimate.allocInit(4, 47);call write~init~int(0, ~#n_lock_torture_errors~0.base, ~#n_lock_torture_errors~0.offset, 4);~#stats_task~0.base, ~#stats_task~0.offset := 48, 0;call #Ultimate.allocInit(8, 48);call write~init~$Pointer$(0, 0, ~#stats_task~0.base, ~#stats_task~0.offset, 8);~writer_tasks~0.base, ~writer_tasks~0.offset := 0, 0;~nrealwriters_stress~0 := 0;~lock_is_write_held~0 := 0;~lwsa~0.base, ~lwsa~0.offset := 0, 0;~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset := 49, 0;call #Ultimate.allocInit(4, 49);call write~init~int(1, ~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset, 4);~cur_ops~0.base, ~cur_ops~0.offset := 0, 0;~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset := 50, 0;call #Ultimate.allocInit(48, 50);call write~init~$Pointer$(0, 0, ~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_lock.base, #funAddr~torture_lock_busted_write_lock.offset, ~#lock_busted_ops~0.base, 8 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_delay.base, #funAddr~torture_lock_busted_write_delay.offset, ~#lock_busted_ops~0.base, 16 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_busted_write_unlock.base, #funAddr~torture_lock_busted_write_unlock.offset, ~#lock_busted_ops~0.base, 24 + ~#lock_busted_ops~0.offset, 8);call write~init~int(0, ~#lock_busted_ops~0.base, 32 + ~#lock_busted_ops~0.offset, 8);call write~init~$Pointer$(4, 0, ~#lock_busted_ops~0.base, 40 + ~#lock_busted_ops~0.offset, 8);~#torture_spinlock~0.base, ~#torture_spinlock~0.offset := 51, 0;call #Ultimate.allocInit(68, 51);call write~init~int(0, ~#torture_spinlock~0.base, ~#torture_spinlock~0.offset, 4);call write~init~int(3735899821, ~#torture_spinlock~0.base, 4 + ~#torture_spinlock~0.offset, 4);call write~init~int(4294967295, ~#torture_spinlock~0.base, 8 + ~#torture_spinlock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#torture_spinlock~0.base, 12 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 20 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 28 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#torture_spinlock~0.base, 36 + ~#torture_spinlock~0.offset, 8);call write~init~$Pointer$(5, 0, ~#torture_spinlock~0.base, 44 + ~#torture_spinlock~0.offset, 8);call write~init~int(0, ~#torture_spinlock~0.base, 52 + ~#torture_spinlock~0.offset, 4);call write~init~int(0, ~#torture_spinlock~0.base, 56 + ~#torture_spinlock~0.offset, 8);~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset := 52, 0;call #Ultimate.allocInit(48, 52);call write~init~$Pointer$(0, 0, ~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_lock.base, #funAddr~torture_spin_lock_write_lock.offset, ~#spin_lock_ops~0.base, 8 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_delay.base, #funAddr~torture_spin_lock_write_delay.offset, ~#spin_lock_ops~0.base, 16 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_unlock.base, #funAddr~torture_spin_lock_write_unlock.offset, ~#spin_lock_ops~0.base, 24 + ~#spin_lock_ops~0.offset, 8);call write~init~int(0, ~#spin_lock_ops~0.base, 32 + ~#spin_lock_ops~0.offset, 8);call write~init~$Pointer$(6, 0, ~#spin_lock_ops~0.base, 40 + ~#spin_lock_ops~0.offset, 8);~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset := 53, 0;call #Ultimate.allocInit(48, 53);call write~init~$Pointer$(0, 0, ~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_lock_irq.base, #funAddr~torture_spin_lock_write_lock_irq.offset, ~#spin_lock_irq_ops~0.base, 8 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_spin_lock_write_delay.base, #funAddr~torture_spin_lock_write_delay.offset, ~#spin_lock_irq_ops~0.base, 16 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~torture_lock_spin_write_unlock_irq.base, #funAddr~torture_lock_spin_write_unlock_irq.offset, ~#spin_lock_irq_ops~0.base, 24 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~int(0, ~#spin_lock_irq_ops~0.base, 32 + ~#spin_lock_irq_ops~0.offset, 8);call write~init~$Pointer$(7, 0, ~#spin_lock_irq_ops~0.base, 40 + ~#spin_lock_irq_ops~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_spin~0 := 0; {79932#true} is VALID [2022-02-20 22:03:32,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {79932#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret125#1.base, main_#t~ret125#1.offset, main_#t~ret126#1.base, main_#t~ret126#1.offset, main_#t~ret127#1.base, main_#t~ret127#1.offset, main_#t~nondet128#1, main_#t~switch129#1, main_#t~nondet130#1, main_#t~switch131#1, main_#t~ret132#1, main_#t~ret133#1, main_#t~ret134#1, main_#t~nondet135#1, main_#t~switch136#1, main_#t~ret137#1, main_#t~nondet138#1, main_#t~switch139#1, main_#t~ret140#1, main_#t~ret141#1, main_#t~ret142#1, main_#t~nondet143#1, main_#t~switch144#1, main_#t~ret145#1, main_#t~ret146#1, main_#t~ret147#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~13#1.base, main_~tmp~13#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset, main_~tmp___2~3#1, main_~tmp___3~2#1, main_~tmp___4~2#1, main_~tmp___5~1#1, main_~tmp___6~1#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~13#1.base, main_~tmp~13#1.offset;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;havoc main_~tmp___2~3#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1;havoc main_~tmp___5~1#1;havoc main_~tmp___6~1#1; {79932#true} is VALID [2022-02-20 22:03:32,236 INFO L272 TraceCheckUtils]: 2: Hoare triple {79932#true} call main_#t~ret125#1.base, main_#t~ret125#1.offset := ldv_zalloc(16); {79988#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:32,236 INFO L290 TraceCheckUtils]: 3: Hoare triple {79988#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {79932#true} is VALID [2022-02-20 22:03:32,236 INFO L290 TraceCheckUtils]: 4: Hoare triple {79932#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {79932#true} is VALID [2022-02-20 22:03:32,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,237 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {79932#true} {79932#true} #910#return; {79932#true} is VALID [2022-02-20 22:03:32,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {79932#true} main_~tmp~13#1.base, main_~tmp~13#1.offset := main_#t~ret125#1.base, main_#t~ret125#1.offset;havoc main_#t~ret125#1.base, main_#t~ret125#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~13#1.base, main_~tmp~13#1.offset; {79932#true} is VALID [2022-02-20 22:03:32,237 INFO L272 TraceCheckUtils]: 8: Hoare triple {79932#true} call main_#t~ret126#1.base, main_#t~ret126#1.offset := ldv_zalloc(16); {79988#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:32,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {79988#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {79932#true} is VALID [2022-02-20 22:03:32,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {79932#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {79932#true} is VALID [2022-02-20 22:03:32,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,238 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {79932#true} {79932#true} #912#return; {79932#true} is VALID [2022-02-20 22:03:32,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {79932#true} main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset := main_#t~ret126#1.base, main_#t~ret126#1.offset;havoc main_#t~ret126#1.base, main_#t~ret126#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___0~10#1.base, main_~tmp___0~10#1.offset; {79932#true} is VALID [2022-02-20 22:03:32,239 INFO L272 TraceCheckUtils]: 14: Hoare triple {79932#true} call main_#t~ret127#1.base, main_#t~ret127#1.offset := ldv_zalloc(16); {79988#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:32,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {79988#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~2#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~2#1 := #t~nondet26#1;havoc #t~nondet26#1; {79932#true} is VALID [2022-02-20 22:03:32,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {79932#true} assume 0 != ~tmp___0~2#1;#res#1.base, #res#1.offset := 0, 0; {79932#true} is VALID [2022-02-20 22:03:32,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,239 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {79932#true} {79932#true} #914#return; {79932#true} is VALID [2022-02-20 22:03:32,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {79932#true} main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset := main_#t~ret127#1.base, main_#t~ret127#1.offset;havoc main_#t~ret127#1.base, main_#t~ret127#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;assume { :begin_inline_ldv_initialize } true; {79932#true} is VALID [2022-02-20 22:03:32,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {79932#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 0; {79932#true} is VALID [2022-02-20 22:03:32,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {79932#true} assume -2147483648 <= main_#t~nondet128#1 && main_#t~nondet128#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet128#1;havoc main_#t~nondet128#1;main_#t~switch129#1 := 0 == main_~tmp___2~3#1; {79932#true} is VALID [2022-02-20 22:03:32,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {79932#true} assume !main_#t~switch129#1;main_#t~switch129#1 := main_#t~switch129#1 || 1 == main_~tmp___2~3#1; {79932#true} is VALID [2022-02-20 22:03:32,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {79932#true} assume main_#t~switch129#1; {79932#true} is VALID [2022-02-20 22:03:32,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {79932#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet135#1 && main_#t~nondet135#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet135#1;havoc main_#t~nondet135#1;main_#t~switch136#1 := 0 == main_~tmp___4~2#1; {79932#true} is VALID [2022-02-20 22:03:32,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {79932#true} assume !main_#t~switch136#1;main_#t~switch136#1 := main_#t~switch136#1 || 1 == main_~tmp___4~2#1; {79932#true} is VALID [2022-02-20 22:03:32,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {79932#true} assume main_#t~switch136#1; {79932#true} is VALID [2022-02-20 22:03:32,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {79932#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_lock_torture_init } true;havoc lock_torture_init_#res#1;havoc lock_torture_init_#t~ret101#1, lock_torture_init_#t~mem102#1.base, lock_torture_init_#t~mem102#1.offset, lock_torture_init_#t~mem103#1.base, lock_torture_init_#t~mem103#1.offset, lock_torture_init_#t~nondet104#1, lock_torture_init_#t~nondet105#1, lock_torture_init_#t~nondet106#1, lock_torture_init_#t~nondet107#1, lock_torture_init_#t~mem108#1.base, lock_torture_init_#t~mem108#1.offset, lock_torture_init_#t~mem109#1.base, lock_torture_init_#t~mem109#1.offset, lock_torture_init_#t~nondet110#1, lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset, lock_torture_init_#t~mem113#1.base, lock_torture_init_#t~mem113#1.offset, lock_torture_init_#t~ret114#1, lock_torture_init_#t~ret115#1.base, lock_torture_init_#t~ret115#1.offset, lock_torture_init_#t~nondet116#1, lock_torture_init_#t~ret117#1, lock_torture_init_#t~ret118#1, lock_torture_init_#t~ret119#1, lock_torture_init_#t~ret120#1, lock_torture_init_#t~ret121#1.base, lock_torture_init_#t~ret121#1.offset, lock_torture_init_#t~nondet122#1, lock_torture_init_#t~ret123#1, lock_torture_init_#t~ret124#1, lock_torture_init_~i~2#1, lock_torture_init_~firsterr~0#1, lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset, lock_torture_init_~tmp~12#1, lock_torture_init_~tmp___0~9#1, lock_torture_init_~tmp___1~3#1, lock_torture_init_~tmp___2~2#1, lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset, lock_torture_init_~tmp___4~1#1.base, lock_torture_init_~tmp___4~1#1.offset;havoc lock_torture_init_~i~2#1;havoc lock_torture_init_~firsterr~0#1;call lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset := #Ultimate.allocOnStack(24);havoc lock_torture_init_~tmp~12#1;havoc lock_torture_init_~tmp___0~9#1;havoc lock_torture_init_~tmp___1~3#1;havoc lock_torture_init_~tmp___2~2#1;havoc lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset;havoc lock_torture_init_~tmp___4~1#1.base, lock_torture_init_~tmp___4~1#1.offset;lock_torture_init_~firsterr~0#1 := 0;call write~$Pointer$(~#lock_busted_ops~0.base, ~#lock_busted_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset, 8);call write~$Pointer$(~#spin_lock_ops~0.base, ~#spin_lock_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, 8 + lock_torture_init_~#torture_ops~0#1.offset, 8);call write~$Pointer$(~#spin_lock_irq_ops~0.base, ~#spin_lock_irq_ops~0.offset, lock_torture_init_~#torture_ops~0#1.base, 16 + lock_torture_init_~#torture_ops~0#1.offset, 8);assume { :begin_inline_torture_init_begin } true;torture_init_begin_#in~arg0#1.base, torture_init_begin_#in~arg0#1.offset, torture_init_begin_#in~arg1#1, torture_init_begin_#in~arg2#1.base, torture_init_begin_#in~arg2#1.offset := ~torture_type~0.base, ~torture_type~0.offset, (if 0 == ~verbose~0 % 256 then 0 else 1), ~#locktorture_runnable~0.base, ~#locktorture_runnable~0.offset;havoc torture_init_begin_#res#1;havoc torture_init_begin_#t~nondet165#1, torture_init_begin_~arg0#1.base, torture_init_begin_~arg0#1.offset, torture_init_begin_~arg1#1, torture_init_begin_~arg2#1.base, torture_init_begin_~arg2#1.offset;torture_init_begin_~arg0#1.base, torture_init_begin_~arg0#1.offset := torture_init_begin_#in~arg0#1.base, torture_init_begin_#in~arg0#1.offset;torture_init_begin_~arg1#1 := torture_init_begin_#in~arg1#1;torture_init_begin_~arg2#1.base, torture_init_begin_~arg2#1.offset := torture_init_begin_#in~arg2#1.base, torture_init_begin_#in~arg2#1.offset;torture_init_begin_#res#1 := torture_init_begin_#t~nondet165#1;havoc torture_init_begin_#t~nondet165#1; {79932#true} is VALID [2022-02-20 22:03:32,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {79932#true} lock_torture_init_#t~ret101#1 := torture_init_begin_#res#1;assume { :end_inline_torture_init_begin } true;lock_torture_init_~tmp~12#1 := lock_torture_init_#t~ret101#1;havoc lock_torture_init_#t~ret101#1; {79932#true} is VALID [2022-02-20 22:03:32,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {79932#true} assume 0 != lock_torture_init_~tmp~12#1 % 256;lock_torture_init_~tmp___0~9#1 := 0; {79932#true} is VALID [2022-02-20 22:03:32,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {79932#true} assume !(0 != lock_torture_init_~tmp___0~9#1);lock_torture_init_~i~2#1 := 0; {79932#true} is VALID [2022-02-20 22:03:32,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {79932#true} assume !(lock_torture_init_~i~2#1 % 4294967296 <= 2); {79932#true} is VALID [2022-02-20 22:03:32,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {79932#true} assume !(3 == lock_torture_init_~i~2#1);call lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset := read~$Pointer$(~cur_ops~0.base, ~cur_ops~0.offset, 8); {79932#true} is VALID [2022-02-20 22:03:32,249 INFO L290 TraceCheckUtils]: 33: Hoare triple {79932#true} assume !(0 != (lock_torture_init_#t~mem111#1.base + lock_torture_init_#t~mem111#1.offset) % 18446744073709551616);havoc lock_torture_init_#t~mem111#1.base, lock_torture_init_#t~mem111#1.offset; {79932#true} is VALID [2022-02-20 22:03:32,249 INFO L290 TraceCheckUtils]: 34: Hoare triple {79932#true} assume !(~nwriters_stress~0 >= 0);assume { :begin_inline_cpumask_weight } true;cpumask_weight_#in~srcp#1.base, cpumask_weight_#in~srcp#1.offset := ~cpu_online_mask~0.base, ~cpu_online_mask~0.offset;havoc cpumask_weight_#res#1;havoc cpumask_weight_#t~ret12#1, cpumask_weight_~srcp#1.base, cpumask_weight_~srcp#1.offset, cpumask_weight_~tmp~0#1;cpumask_weight_~srcp#1.base, cpumask_weight_~srcp#1.offset := cpumask_weight_#in~srcp#1.base, cpumask_weight_#in~srcp#1.offset;havoc cpumask_weight_~tmp~0#1;assume { :begin_inline_bitmap_weight } true;bitmap_weight_#in~src#1.base, bitmap_weight_#in~src#1.offset, bitmap_weight_#in~nbits#1 := cpumask_weight_~srcp#1.base, cpumask_weight_~srcp#1.offset, ~nr_cpu_ids~0;havoc bitmap_weight_#res#1;havoc bitmap_weight_#t~ret11#1, bitmap_weight_~src#1.base, bitmap_weight_~src#1.offset, bitmap_weight_~nbits#1, bitmap_weight_~tmp___0~0#1;bitmap_weight_~src#1.base, bitmap_weight_~src#1.offset := bitmap_weight_#in~src#1.base, bitmap_weight_#in~src#1.offset;bitmap_weight_~nbits#1 := bitmap_weight_#in~nbits#1;havoc bitmap_weight_~tmp___0~0#1;assume { :begin_inline___bitmap_weight } true;__bitmap_weight_#in~arg0#1.base, __bitmap_weight_#in~arg0#1.offset, __bitmap_weight_#in~arg1#1 := bitmap_weight_~src#1.base, bitmap_weight_~src#1.offset, bitmap_weight_~nbits#1;havoc __bitmap_weight_#res#1;havoc __bitmap_weight_#t~nondet151#1, __bitmap_weight_~arg0#1.base, __bitmap_weight_~arg0#1.offset, __bitmap_weight_~arg1#1;__bitmap_weight_~arg0#1.base, __bitmap_weight_~arg0#1.offset := __bitmap_weight_#in~arg0#1.base, __bitmap_weight_#in~arg0#1.offset;__bitmap_weight_~arg1#1 := __bitmap_weight_#in~arg1#1;assume -2147483648 <= __bitmap_weight_#t~nondet151#1 && __bitmap_weight_#t~nondet151#1 <= 2147483647;__bitmap_weight_#res#1 := __bitmap_weight_#t~nondet151#1;havoc __bitmap_weight_#t~nondet151#1; {79932#true} is VALID [2022-02-20 22:03:32,249 INFO L290 TraceCheckUtils]: 35: Hoare triple {79932#true} bitmap_weight_#t~ret11#1 := __bitmap_weight_#res#1;assume { :end_inline___bitmap_weight } true;assume -2147483648 <= bitmap_weight_#t~ret11#1 && bitmap_weight_#t~ret11#1 <= 2147483647;bitmap_weight_~tmp___0~0#1 := bitmap_weight_#t~ret11#1;havoc bitmap_weight_#t~ret11#1;bitmap_weight_#res#1 := bitmap_weight_~tmp___0~0#1; {79932#true} is VALID [2022-02-20 22:03:32,249 INFO L290 TraceCheckUtils]: 36: Hoare triple {79932#true} cpumask_weight_#t~ret12#1 := bitmap_weight_#res#1;assume { :end_inline_bitmap_weight } true;assume -2147483648 <= cpumask_weight_#t~ret12#1 && cpumask_weight_#t~ret12#1 <= 2147483647;cpumask_weight_~tmp~0#1 := cpumask_weight_#t~ret12#1;havoc cpumask_weight_#t~ret12#1;cpumask_weight_#res#1 := cpumask_weight_~tmp~0#1; {79932#true} is VALID [2022-02-20 22:03:32,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {79932#true} lock_torture_init_#t~ret114#1 := cpumask_weight_#res#1;assume { :end_inline_cpumask_weight } true;lock_torture_init_~tmp___2~2#1 := lock_torture_init_#t~ret114#1;havoc lock_torture_init_#t~ret114#1;~nrealwriters_stress~0 := (if 2 * lock_torture_init_~tmp___2~2#1 % 4294967296 % 4294967296 <= 2147483647 then 2 * lock_torture_init_~tmp___2~2#1 % 4294967296 % 4294967296 else 2 * lock_torture_init_~tmp___2~2#1 % 4294967296 % 4294967296 - 4294967296); {79932#true} is VALID [2022-02-20 22:03:32,250 INFO L272 TraceCheckUtils]: 38: Hoare triple {79932#true} call lock_torture_print_module_parms(~cur_ops~0.base, ~cur_ops~0.offset, 36, 0); {79932#true} is VALID [2022-02-20 22:03:32,250 INFO L290 TraceCheckUtils]: 39: Hoare triple {79932#true} ~cur_ops___0.base, ~cur_ops___0.offset := #in~cur_ops___0.base, #in~cur_ops___0.offset;~tag.base, ~tag.offset := #in~tag.base, #in~tag.offset;havoc #t~nondet97; {79932#true} is VALID [2022-02-20 22:03:32,250 INFO L290 TraceCheckUtils]: 40: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,250 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {79932#true} {79932#true} #934#return; {79932#true} is VALID [2022-02-20 22:03:32,250 INFO L290 TraceCheckUtils]: 42: Hoare triple {79932#true} ~lock_is_write_held~0 := 0; {79932#true} is VALID [2022-02-20 22:03:32,251 INFO L272 TraceCheckUtils]: 43: Hoare triple {79932#true} call lock_torture_init_#t~ret115#1.base, lock_torture_init_#t~ret115#1.offset := kmalloc(16 * ~nrealwriters_stress~0, 208); {79989#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:32,251 INFO L290 TraceCheckUtils]: 44: Hoare triple {79989#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;~flags#1 := #in~flags#1; {79932#true} is VALID [2022-02-20 22:03:32,252 INFO L272 TraceCheckUtils]: 45: Hoare triple {79932#true} call ldv_check_alloc_flags(~flags#1); {79932#true} is VALID [2022-02-20 22:03:32,252 INFO L290 TraceCheckUtils]: 46: Hoare triple {79932#true} ~flags := #in~flags; {79932#true} is VALID [2022-02-20 22:03:32,252 INFO L290 TraceCheckUtils]: 47: Hoare triple {79932#true} assume 0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296; {79932#true} is VALID [2022-02-20 22:03:32,252 INFO L290 TraceCheckUtils]: 48: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,252 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {79932#true} {79932#true} #864#return; {79932#true} is VALID [2022-02-20 22:03:32,252 INFO L290 TraceCheckUtils]: 50: Hoare triple {79932#true} assume { :begin_inline_ldv_kmalloc_12 } true;ldv_kmalloc_12_#in~size#1, ldv_kmalloc_12_#in~flags#1 := ~size#1, ~flags#1;havoc ldv_kmalloc_12_#res#1.base, ldv_kmalloc_12_#res#1.offset;havoc ldv_kmalloc_12_#t~ret23#1.base, ldv_kmalloc_12_#t~ret23#1.offset, ldv_kmalloc_12_~size#1, ldv_kmalloc_12_~flags#1, ldv_kmalloc_12_~tmp___2~0#1.base, ldv_kmalloc_12_~tmp___2~0#1.offset;ldv_kmalloc_12_~size#1 := ldv_kmalloc_12_#in~size#1;ldv_kmalloc_12_~flags#1 := ldv_kmalloc_12_#in~flags#1;havoc ldv_kmalloc_12_~tmp___2~0#1.base, ldv_kmalloc_12_~tmp___2~0#1.offset;assume { :begin_inline___kmalloc } true;__kmalloc_#in~size#1, __kmalloc_#in~t#1 := ldv_kmalloc_12_~size#1, ldv_kmalloc_12_~flags#1;havoc __kmalloc_#res#1.base, __kmalloc_#res#1.offset;havoc __kmalloc_#t~ret20#1.base, __kmalloc_#t~ret20#1.offset, __kmalloc_~size#1, __kmalloc_~t#1;__kmalloc_~size#1 := __kmalloc_#in~size#1;__kmalloc_~t#1 := __kmalloc_#in~t#1; {79932#true} is VALID [2022-02-20 22:03:32,253 INFO L272 TraceCheckUtils]: 51: Hoare triple {79932#true} call __kmalloc_#t~ret20#1.base, __kmalloc_#t~ret20#1.offset := ldv_malloc(__kmalloc_~size#1); {79989#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:03:32,253 INFO L290 TraceCheckUtils]: 52: Hoare triple {79989#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~1;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___0~1 := #t~nondet24;havoc #t~nondet24; {79932#true} is VALID [2022-02-20 22:03:32,253 INFO L290 TraceCheckUtils]: 53: Hoare triple {79932#true} assume 0 != ~tmp___0~1;#res.base, #res.offset := 0, 0; {79932#true} is VALID [2022-02-20 22:03:32,253 INFO L290 TraceCheckUtils]: 54: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,254 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79932#true} {79932#true} #866#return; {79932#true} is VALID [2022-02-20 22:03:32,254 INFO L290 TraceCheckUtils]: 56: Hoare triple {79932#true} __kmalloc_#res#1.base, __kmalloc_#res#1.offset := __kmalloc_#t~ret20#1.base, __kmalloc_#t~ret20#1.offset;havoc __kmalloc_#t~ret20#1.base, __kmalloc_#t~ret20#1.offset; {79932#true} is VALID [2022-02-20 22:03:32,254 INFO L290 TraceCheckUtils]: 57: Hoare triple {79932#true} ldv_kmalloc_12_#t~ret23#1.base, ldv_kmalloc_12_#t~ret23#1.offset := __kmalloc_#res#1.base, __kmalloc_#res#1.offset;assume { :end_inline___kmalloc } true;ldv_kmalloc_12_~tmp___2~0#1.base, ldv_kmalloc_12_~tmp___2~0#1.offset := ldv_kmalloc_12_#t~ret23#1.base, ldv_kmalloc_12_#t~ret23#1.offset;havoc ldv_kmalloc_12_#t~ret23#1.base, ldv_kmalloc_12_#t~ret23#1.offset;ldv_kmalloc_12_#res#1.base, ldv_kmalloc_12_#res#1.offset := ldv_kmalloc_12_~tmp___2~0#1.base, ldv_kmalloc_12_~tmp___2~0#1.offset; {79932#true} is VALID [2022-02-20 22:03:32,254 INFO L290 TraceCheckUtils]: 58: Hoare triple {79932#true} #t~ret148#1.base, #t~ret148#1.offset := ldv_kmalloc_12_#res#1.base, ldv_kmalloc_12_#res#1.offset;assume { :end_inline_ldv_kmalloc_12 } true;havoc #t~ret148#1.base, #t~ret148#1.offset;#res#1.base, #res#1.offset := 0, 0; {79932#true} is VALID [2022-02-20 22:03:32,254 INFO L290 TraceCheckUtils]: 59: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,254 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {79932#true} {79932#true} #936#return; {79932#true} is VALID [2022-02-20 22:03:32,254 INFO L290 TraceCheckUtils]: 61: Hoare triple {79932#true} lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset := lock_torture_init_#t~ret115#1.base, lock_torture_init_#t~ret115#1.offset;havoc lock_torture_init_#t~ret115#1.base, lock_torture_init_#t~ret115#1.offset;~lwsa~0.base, ~lwsa~0.offset := lock_torture_init_~tmp___3~1#1.base, lock_torture_init_~tmp___3~1#1.offset; {79932#true} is VALID [2022-02-20 22:03:32,255 INFO L290 TraceCheckUtils]: 62: Hoare triple {79932#true} assume 0 == (~lwsa~0.base + ~lwsa~0.offset) % 18446744073709551616; {79932#true} is VALID [2022-02-20 22:03:32,255 INFO L290 TraceCheckUtils]: 63: Hoare triple {79932#true} assume 0 != ~verbose~0 % 256;havoc lock_torture_init_#t~nondet116#1; {79932#true} is VALID [2022-02-20 22:03:32,255 INFO L290 TraceCheckUtils]: 64: Hoare triple {79932#true} lock_torture_init_~firsterr~0#1 := -12; {79932#true} is VALID [2022-02-20 22:03:32,255 INFO L272 TraceCheckUtils]: 65: Hoare triple {79932#true} call torture_init_end(); {79932#true} is VALID [2022-02-20 22:03:32,255 INFO L290 TraceCheckUtils]: 66: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,255 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {79932#true} {79932#true} #946#return; {79932#true} is VALID [2022-02-20 22:03:32,256 INFO L272 TraceCheckUtils]: 68: Hoare triple {79932#true} call lock_torture_cleanup(); {79998#(and (= |old(#length)| |#length|) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))} is VALID [2022-02-20 22:03:32,256 INFO L290 TraceCheckUtils]: 69: Hoare triple {79998#(and (= |old(#length)| |#length|) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))} havoc ~i~1#1;havoc ~tmp~11#1;havoc ~tmp___0~8#1;havoc ~tmp___1~2#1;assume { :begin_inline_torture_cleanup } true;havoc torture_cleanup_#res#1;havoc torture_cleanup_#t~nondet164#1;torture_cleanup_#res#1 := torture_cleanup_#t~nondet164#1;havoc torture_cleanup_#t~nondet164#1; {79932#true} is VALID [2022-02-20 22:03:32,256 INFO L290 TraceCheckUtils]: 70: Hoare triple {79932#true} #t~ret98#1 := torture_cleanup_#res#1;assume { :end_inline_torture_cleanup } true;~tmp~11#1 := #t~ret98#1;havoc #t~ret98#1; {79932#true} is VALID [2022-02-20 22:03:32,256 INFO L290 TraceCheckUtils]: 71: Hoare triple {79932#true} assume 0 != ~tmp~11#1 % 256; {79932#true} is VALID [2022-02-20 22:03:32,257 INFO L290 TraceCheckUtils]: 72: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,257 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {79932#true} {79932#true} #948#return; {79932#true} is VALID [2022-02-20 22:03:32,257 INFO L290 TraceCheckUtils]: 74: Hoare triple {79932#true} lock_torture_init_#res#1 := lock_torture_init_~firsterr~0#1;call ULTIMATE.dealloc(lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset);havoc lock_torture_init_~#torture_ops~0#1.base, lock_torture_init_~#torture_ops~0#1.offset; {79932#true} is VALID [2022-02-20 22:03:32,257 INFO L290 TraceCheckUtils]: 75: Hoare triple {79932#true} main_#t~ret137#1 := lock_torture_init_#res#1;assume { :end_inline_lock_torture_init } true;assume -2147483648 <= main_#t~ret137#1 && main_#t~ret137#1 <= 2147483647;~ldv_retval_0~0 := main_#t~ret137#1;havoc main_#t~ret137#1; {79932#true} is VALID [2022-02-20 22:03:32,257 INFO L290 TraceCheckUtils]: 76: Hoare triple {79932#true} assume 0 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_2~0 := 1;~ldv_state_variable_3~0 := 1;~ldv_state_variable_1~0 := 1; {79973#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 22:03:32,258 INFO L290 TraceCheckUtils]: 77: Hoare triple {79973#(= ~ldv_state_variable_2~0 1)} assume !(0 != ~ldv_retval_0~0); {79973#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 22:03:32,258 INFO L290 TraceCheckUtils]: 78: Hoare triple {79973#(= ~ldv_state_variable_2~0 1)} assume -2147483648 <= main_#t~nondet128#1 && main_#t~nondet128#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet128#1;havoc main_#t~nondet128#1;main_#t~switch129#1 := 0 == main_~tmp___2~3#1; {79973#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 22:03:32,258 INFO L290 TraceCheckUtils]: 79: Hoare triple {79973#(= ~ldv_state_variable_2~0 1)} assume !main_#t~switch129#1;main_#t~switch129#1 := main_#t~switch129#1 || 1 == main_~tmp___2~3#1; {79973#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 22:03:32,259 INFO L290 TraceCheckUtils]: 80: Hoare triple {79973#(= ~ldv_state_variable_2~0 1)} assume !main_#t~switch129#1;main_#t~switch129#1 := main_#t~switch129#1 || 2 == main_~tmp___2~3#1; {79973#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 22:03:32,259 INFO L290 TraceCheckUtils]: 81: Hoare triple {79973#(= ~ldv_state_variable_2~0 1)} assume !main_#t~switch129#1;main_#t~switch129#1 := main_#t~switch129#1 || 3 == main_~tmp___2~3#1; {79973#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 22:03:32,259 INFO L290 TraceCheckUtils]: 82: Hoare triple {79973#(= ~ldv_state_variable_2~0 1)} assume main_#t~switch129#1; {79973#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 22:03:32,260 INFO L290 TraceCheckUtils]: 83: Hoare triple {79973#(= ~ldv_state_variable_2~0 1)} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet143#1 && main_#t~nondet143#1 <= 2147483647;main_~tmp___6~1#1 := main_#t~nondet143#1;havoc main_#t~nondet143#1;main_#t~switch144#1 := 0 == main_~tmp___6~1#1; {79973#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 22:03:32,260 INFO L290 TraceCheckUtils]: 84: Hoare triple {79973#(= ~ldv_state_variable_2~0 1)} assume main_#t~switch144#1; {79973#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 22:03:32,261 INFO L290 TraceCheckUtils]: 85: Hoare triple {79973#(= ~ldv_state_variable_2~0 1)} assume 2 == ~ldv_state_variable_2~0; {79933#false} is VALID [2022-02-20 22:03:32,261 INFO L272 TraceCheckUtils]: 86: Hoare triple {79933#false} call main_#t~ret145#1 := torture_spin_lock_write_lock(); {79999#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 22:03:32,261 INFO L290 TraceCheckUtils]: 87: Hoare triple {79999#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} assume { :begin_inline_spin_lock } true;spin_lock_#in~lock#1.base, spin_lock_#in~lock#1.offset := ~#torture_spinlock~0.base, ~#torture_spinlock~0.offset;havoc spin_lock_~lock#1.base, spin_lock_~lock#1.offset;spin_lock_~lock#1.base, spin_lock_~lock#1.offset := spin_lock_#in~lock#1.base, spin_lock_#in~lock#1.offset; {79932#true} is VALID [2022-02-20 22:03:32,261 INFO L272 TraceCheckUtils]: 88: Hoare triple {79932#true} call ldv_spin_lock(); {79999#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} is VALID [2022-02-20 22:03:32,261 INFO L290 TraceCheckUtils]: 89: Hoare triple {79999#(= ~ldv_spin~0 |old(~ldv_spin~0)|)} ~ldv_spin~0 := 1; {79932#true} is VALID [2022-02-20 22:03:32,262 INFO L290 TraceCheckUtils]: 90: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,262 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {79932#true} {79932#true} #896#return; {79932#true} is VALID [2022-02-20 22:03:32,262 INFO L290 TraceCheckUtils]: 92: Hoare triple {79932#true} assume { :begin_inline_ldv_spin_lock_1 } true;ldv_spin_lock_1_#in~lock#1.base, ldv_spin_lock_1_#in~lock#1.offset := spin_lock_~lock#1.base, spin_lock_~lock#1.offset;havoc ldv_spin_lock_1_~lock#1.base, ldv_spin_lock_1_~lock#1.offset;ldv_spin_lock_1_~lock#1.base, ldv_spin_lock_1_~lock#1.offset := ldv_spin_lock_1_#in~lock#1.base, ldv_spin_lock_1_#in~lock#1.offset;assume { :begin_inline__raw_spin_lock } true;_raw_spin_lock_#in~arg0#1.base, _raw_spin_lock_#in~arg0#1.offset := ldv_spin_lock_1_~lock#1.base, ldv_spin_lock_1_~lock#1.offset;havoc _raw_spin_lock_~arg0#1.base, _raw_spin_lock_~arg0#1.offset;_raw_spin_lock_~arg0#1.base, _raw_spin_lock_~arg0#1.offset := _raw_spin_lock_#in~arg0#1.base, _raw_spin_lock_#in~arg0#1.offset; {79932#true} is VALID [2022-02-20 22:03:32,262 INFO L290 TraceCheckUtils]: 93: Hoare triple {79932#true} assume { :end_inline__raw_spin_lock } true; {79932#true} is VALID [2022-02-20 22:03:32,262 INFO L290 TraceCheckUtils]: 94: Hoare triple {79932#true} assume { :end_inline_ldv_spin_lock_1 } true; {79932#true} is VALID [2022-02-20 22:03:32,262 INFO L290 TraceCheckUtils]: 95: Hoare triple {79932#true} assume { :end_inline_spin_lock } true;#res#1 := 0; {79932#true} is VALID [2022-02-20 22:03:32,262 INFO L290 TraceCheckUtils]: 96: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,263 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {79932#true} {79933#false} #964#return; {79933#false} is VALID [2022-02-20 22:03:32,263 INFO L290 TraceCheckUtils]: 98: Hoare triple {79933#false} assume -2147483648 <= main_#t~ret145#1 && main_#t~ret145#1 <= 2147483647;havoc main_#t~ret145#1;~ldv_state_variable_2~0 := 2; {79933#false} is VALID [2022-02-20 22:03:32,263 INFO L290 TraceCheckUtils]: 99: Hoare triple {79933#false} assume -2147483648 <= main_#t~nondet128#1 && main_#t~nondet128#1 <= 2147483647;main_~tmp___2~3#1 := main_#t~nondet128#1;havoc main_#t~nondet128#1;main_#t~switch129#1 := 0 == main_~tmp___2~3#1; {79933#false} is VALID [2022-02-20 22:03:32,263 INFO L290 TraceCheckUtils]: 100: Hoare triple {79933#false} assume !main_#t~switch129#1;main_#t~switch129#1 := main_#t~switch129#1 || 1 == main_~tmp___2~3#1; {79933#false} is VALID [2022-02-20 22:03:32,263 INFO L290 TraceCheckUtils]: 101: Hoare triple {79933#false} assume main_#t~switch129#1; {79933#false} is VALID [2022-02-20 22:03:32,263 INFO L290 TraceCheckUtils]: 102: Hoare triple {79933#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet135#1 && main_#t~nondet135#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet135#1;havoc main_#t~nondet135#1;main_#t~switch136#1 := 0 == main_~tmp___4~2#1; {79933#false} is VALID [2022-02-20 22:03:32,263 INFO L290 TraceCheckUtils]: 103: Hoare triple {79933#false} assume main_#t~switch136#1; {79933#false} is VALID [2022-02-20 22:03:32,264 INFO L290 TraceCheckUtils]: 104: Hoare triple {79933#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0; {79933#false} is VALID [2022-02-20 22:03:32,264 INFO L272 TraceCheckUtils]: 105: Hoare triple {79933#false} call lock_torture_cleanup(); {79933#false} is VALID [2022-02-20 22:03:32,264 INFO L290 TraceCheckUtils]: 106: Hoare triple {79933#false} havoc ~i~1#1;havoc ~tmp~11#1;havoc ~tmp___0~8#1;havoc ~tmp___1~2#1;assume { :begin_inline_torture_cleanup } true;havoc torture_cleanup_#res#1;havoc torture_cleanup_#t~nondet164#1;torture_cleanup_#res#1 := torture_cleanup_#t~nondet164#1;havoc torture_cleanup_#t~nondet164#1; {79933#false} is VALID [2022-02-20 22:03:32,264 INFO L290 TraceCheckUtils]: 107: Hoare triple {79933#false} #t~ret98#1 := torture_cleanup_#res#1;assume { :end_inline_torture_cleanup } true;~tmp~11#1 := #t~ret98#1;havoc #t~ret98#1; {79933#false} is VALID [2022-02-20 22:03:32,264 INFO L290 TraceCheckUtils]: 108: Hoare triple {79933#false} assume !(0 != ~tmp~11#1 % 256); {79933#false} is VALID [2022-02-20 22:03:32,264 INFO L290 TraceCheckUtils]: 109: Hoare triple {79933#false} assume !(0 != (~writer_tasks~0.base + ~writer_tasks~0.offset) % 18446744073709551616); {79933#false} is VALID [2022-02-20 22:03:32,265 INFO L272 TraceCheckUtils]: 110: Hoare triple {79933#false} call _torture_stop_kthread(28, 0, ~#stats_task~0.base, ~#stats_task~0.offset); {79932#true} is VALID [2022-02-20 22:03:32,265 INFO L290 TraceCheckUtils]: 111: Hoare triple {79932#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1.base, ~arg1.offset := #in~arg1.base, #in~arg1.offset; {79932#true} is VALID [2022-02-20 22:03:32,265 INFO L290 TraceCheckUtils]: 112: Hoare triple {79932#true} assume true; {79932#true} is VALID [2022-02-20 22:03:32,265 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {79932#true} {79933#false} #882#return; {79933#false} is VALID [2022-02-20 22:03:32,265 INFO L272 TraceCheckUtils]: 114: Hoare triple {79933#false} call lock_torture_stats_print(); {79933#false} is VALID [2022-02-20 22:03:32,265 INFO L290 TraceCheckUtils]: 115: Hoare triple {79933#false} havoc ~size~0#1;havoc ~buf~0#1.base, ~buf~0#1.offset;havoc ~tmp~9#1.base, ~tmp~9#1.offset;~size~0#1 := 8192 + 200 * ~nrealwriters_stress~0; {79933#false} is VALID [2022-02-20 22:03:32,265 INFO L272 TraceCheckUtils]: 116: Hoare triple {79933#false} call #t~ret91#1.base, #t~ret91#1.offset := kmalloc(~size~0#1, 208); {79933#false} is VALID [2022-02-20 22:03:32,266 INFO L290 TraceCheckUtils]: 117: Hoare triple {79933#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1; {79933#false} is VALID [2022-02-20 22:03:32,266 INFO L272 TraceCheckUtils]: 118: Hoare triple {79933#false} call ldv_check_alloc_flags(~flags#1); {79933#false} is VALID [2022-02-20 22:03:32,266 INFO L290 TraceCheckUtils]: 119: Hoare triple {79933#false} ~flags := #in~flags; {79933#false} is VALID [2022-02-20 22:03:32,266 INFO L290 TraceCheckUtils]: 120: Hoare triple {79933#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {79933#false} is VALID [2022-02-20 22:03:32,266 INFO L272 TraceCheckUtils]: 121: Hoare triple {79933#false} call ldv_error(); {79933#false} is VALID [2022-02-20 22:03:32,266 INFO L290 TraceCheckUtils]: 122: Hoare triple {79933#false} assume !false; {79933#false} is VALID [2022-02-20 22:03:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 22:03:32,267 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:03:32,267 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247299188] [2022-02-20 22:03:32,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247299188] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:03:32,267 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:03:32,268 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 22:03:32,268 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806835885] [2022-02-20 22:03:32,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:03:32,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2022-02-20 22:03:32,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:03:32,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 22:03:32,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:03:32,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 22:03:32,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:03:32,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 22:03:32,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 22:03:32,347 INFO L87 Difference]: Start difference. First operand 4414 states and 6064 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)