./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.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.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.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 4bd03bf538c8a1f05055d45724b67645b210b4f99e6ffddc4b441645e05ec36a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:45:30,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:45:30,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:45:30,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:45:30,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:45:30,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:45:30,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:45:30,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:45:30,811 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:45:30,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:45:30,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:45:30,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:45:30,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:45:30,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:45:30,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:45:30,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:45:30,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:45:30,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:45:30,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:45:30,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:45:30,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:45:30,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:45:30,839 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:45:30,840 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:45:30,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:45:30,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:45:30,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:45:30,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:45:30,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:45:30,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:45:30,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:45:30,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:45:30,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:45:30,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:45:30,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:45:30,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:45:30,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:45:30,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:45:30,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:45:30,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:45:30,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:45:30,855 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:45:30,886 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:45:30,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:45:30,887 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:45:30,888 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:45:30,889 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:45:30,889 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:45:30,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:45:30,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:45:30,890 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:45:30,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:45:30,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 22:45:30,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:45:30,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:45:30,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:45:30,892 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:45:30,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:45:30,892 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:45:30,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:45:30,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:45:30,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:45:30,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:45:30,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:45:30,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:45:30,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:45:30,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:45:30,894 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 22:45:30,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 22:45:30,894 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:45:30,895 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:45:30,895 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:45:30,895 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 -> 4bd03bf538c8a1f05055d45724b67645b210b4f99e6ffddc4b441645e05ec36a [2022-02-20 22:45:31,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:45:31,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:45:31,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:45:31,203 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:45:31,203 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:45:31,205 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i [2022-02-20 22:45:31,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca2ecd59/fab9c1c1d684458baf368ed96d04878d/FLAGe7d0d999d [2022-02-20 22:45:31,980 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:45:31,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i [2022-02-20 22:45:32,023 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca2ecd59/fab9c1c1d684458baf368ed96d04878d/FLAGe7d0d999d [2022-02-20 22:45:32,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca2ecd59/fab9c1c1d684458baf368ed96d04878d [2022-02-20 22:45:32,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:45:32,261 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:45:32,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:45:32,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:45:32,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:45:32,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:45:32" (1/1) ... [2022-02-20 22:45:32,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6daa40df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:45:32, skipping insertion in model container [2022-02-20 22:45:32,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:45:32" (1/1) ... [2022-02-20 22:45:32,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:45:32,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:45:33,650 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.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i[196376,196389] [2022-02-20 22:45:33,652 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.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i[196545,196558] [2022-02-20 22:45:33,653 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.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i[196712,196725] [2022-02-20 22:45:33,654 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.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i[196880,196893] [2022-02-20 22:45:33,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:45:33,690 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:45:33,915 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.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i[196376,196389] [2022-02-20 22:45:33,916 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.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i[196545,196558] [2022-02-20 22:45:33,916 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.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i[196712,196725] [2022-02-20 22:45:33,917 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.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i[196880,196893] [2022-02-20 22:45:33,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:45:34,005 INFO L208 MainTranslator]: Completed translation [2022-02-20 22:45:34,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:45:34 WrapperNode [2022-02-20 22:45:34,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 22:45:34,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 22:45:34,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 22:45:34,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 22:45:34,013 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:45:34" (1/1) ... [2022-02-20 22:45:34,068 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:45:34" (1/1) ... [2022-02-20 22:45:34,194 INFO L137 Inliner]: procedures = 289, calls = 1101, calls flagged for inlining = 114, calls inlined = 94, statements flattened = 2349 [2022-02-20 22:45:34,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 22:45:34,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 22:45:34,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 22:45:34,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 22:45:34,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:45:34" (1/1) ... [2022-02-20 22:45:34,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:45:34" (1/1) ... [2022-02-20 22:45:34,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:45:34" (1/1) ... [2022-02-20 22:45:34,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:45:34" (1/1) ... [2022-02-20 22:45:34,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:45:34" (1/1) ... [2022-02-20 22:45:34,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:45:34" (1/1) ... [2022-02-20 22:45:34,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:45:34" (1/1) ... [2022-02-20 22:45:34,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 22:45:34,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 22:45:34,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 22:45:34,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 22:45:34,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:45:34" (1/1) ... [2022-02-20 22:45:34,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:45:34,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:45:34,396 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:45:34,419 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:45:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2022-02-20 22:45:34,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2022-02-20 22:45:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 22:45:34,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 22:45:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 22:45:34,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 22:45:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_automaton_state_0_6 [2022-02-20 22:45:34,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_automaton_state_0_6 [2022-02-20 22:45:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_efm_disable [2022-02-20 22:45:34,432 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_efm_disable [2022-02-20 22:45:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-02-20 22:45:34,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-02-20 22:45:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure request_irq [2022-02-20 22:45:34,433 INFO L138 BoogieDeclarations]: Found implementation of procedure request_irq [2022-02-20 22:45:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 22:45:34,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 22:45:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure pnp_port_len [2022-02-20 22:45:34,433 INFO L138 BoogieDeclarations]: Found implementation of procedure pnp_port_len [2022-02-20 22:45:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_cir_wake_reg_read [2022-02-20 22:45:34,434 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_cir_wake_reg_read [2022-02-20 22:45:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2022-02-20 22:45:34,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2022-02-20 22:45:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-02-20 22:45:34,434 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-02-20 22:45:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_clear_tx_fifo [2022-02-20 22:45:34,435 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_clear_tx_fifo [2022-02-20 22:45:34,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-02-20 22:45:34,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-02-20 22:45:34,435 INFO L130 BoogieDeclarations]: Found specification of procedure ir_raw_event_handle [2022-02-20 22:45:34,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_raw_event_handle [2022-02-20 22:45:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-02-20 22:45:34,436 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-02-20 22:45:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure rc_unregister_device [2022-02-20 22:45:34,436 INFO L138 BoogieDeclarations]: Found implementation of procedure rc_unregister_device [2022-02-20 22:45:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_clear_cir_wake_fifo [2022-02-20 22:45:34,437 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_clear_cir_wake_fifo [2022-02-20 22:45:34,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 22:45:34,437 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_process_rx_ir_data [2022-02-20 22:45:34,437 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_process_rx_ir_data [2022-02-20 22:45:34,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 22:45:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-02-20 22:45:34,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-02-20 22:45:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_cr_write [2022-02-20 22:45:34,438 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_cr_write [2022-02-20 22:45:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_remove [2022-02-20 22:45:34,438 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_remove [2022-02-20 22:45:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_47 [2022-02-20 22:45:34,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_47 [2022-02-20 22:45:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_45 [2022-02-20 22:45:34,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_45 [2022-02-20 22:45:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-02-20 22:45:34,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-02-20 22:45:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-02-20 22:45:34,441 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-02-20 22:45:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 22:45:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 22:45:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_cir_regs_init [2022-02-20 22:45:34,442 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_cir_regs_init [2022-02-20 22:45:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_cir_tx_inactive [2022-02-20 22:45:34,443 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_cir_tx_inactive [2022-02-20 22:45:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_lock_of_NOT_ARG_SIGN [2022-02-20 22:45:34,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_lock_of_NOT_ARG_SIGN [2022-02-20 22:45:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_clear_cir_fifo [2022-02-20 22:45:34,443 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_clear_cir_fifo [2022-02-20 22:45:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-02-20 22:45:34,444 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-02-20 22:45:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_request_irq [2022-02-20 22:45:34,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_request_irq [2022-02-20 22:45:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-02-20 22:45:34,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-02-20 22:45:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-02-20 22:45:34,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-02-20 22:45:34,445 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_cir_reg_read [2022-02-20 22:45:34,445 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_cir_reg_read [2022-02-20 22:45:34,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_nvt_lock_of_nvt_dev [2022-02-20 22:45:34,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_nvt_lock_of_nvt_dev [2022-02-20 22:45:34,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 22:45:34,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 22:45:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_get_rx_ir_data [2022-02-20 22:45:34,446 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_get_rx_ir_data [2022-02-20 22:45:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-02-20 22:45:34,446 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-02-20 22:45:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure pnp_get_resource [2022-02-20 22:45:34,447 INFO L138 BoogieDeclarations]: Found implementation of procedure pnp_get_resource [2022-02-20 22:45:34,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 22:45:34,447 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_cir_reg_write [2022-02-20 22:45:34,448 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_cir_reg_write [2022-02-20 22:45:34,448 INFO L130 BoogieDeclarations]: Found specification of procedure pnp_resource_valid [2022-02-20 22:45:34,448 INFO L138 BoogieDeclarations]: Found implementation of procedure pnp_resource_valid [2022-02-20 22:45:34,449 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-02-20 22:45:34,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-02-20 22:45:34,449 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_set_cir_iren [2022-02-20 22:45:34,449 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_set_cir_iren [2022-02-20 22:45:34,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 22:45:34,449 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2022-02-20 22:45:34,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2022-02-20 22:45:34,450 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-02-20 22:45:34,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-02-20 22:45:34,450 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-02-20 22:45:34,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-02-20 22:45:34,450 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_set_reg_bit [2022-02-20 22:45:34,450 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_set_reg_bit [2022-02-20 22:45:34,451 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-02-20 22:45:34,451 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-02-20 22:45:34,451 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 22:45:34,451 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 22:45:34,451 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_cir_wake_regs_init [2022-02-20 22:45:34,452 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_cir_wake_regs_init [2022-02-20 22:45:34,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 22:45:34,452 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_cr_read [2022-02-20 22:45:34,452 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_cr_read [2022-02-20 22:45:34,453 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_enable_wake [2022-02-20 22:45:34,453 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_enable_wake [2022-02-20 22:45:34,454 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~$Pointer$~TO~int [2022-02-20 22:45:34,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~$Pointer$~TO~int [2022-02-20 22:45:34,456 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-02-20 22:45:34,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-02-20 22:45:34,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 22:45:34,457 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_0 [2022-02-20 22:45:34,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_0 [2022-02-20 22:45:34,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 22:45:34,458 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-02-20 22:45:34,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-02-20 22:45:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 22:45:34,463 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_cir_wake_reg_write [2022-02-20 22:45:34,464 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_cir_wake_reg_write [2022-02-20 22:45:34,464 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_efm_enable [2022-02-20 22:45:34,464 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_efm_enable [2022-02-20 22:45:34,464 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_disable_cir [2022-02-20 22:45:34,464 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_disable_cir [2022-02-20 22:45:34,464 INFO L130 BoogieDeclarations]: Found specification of procedure pnp_port_start [2022-02-20 22:45:34,464 INFO L138 BoogieDeclarations]: Found implementation of procedure pnp_port_start [2022-02-20 22:45:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_select_logical_dev [2022-02-20 22:45:34,465 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_select_logical_dev [2022-02-20 22:45:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-02-20 22:45:34,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-02-20 22:45:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2022-02-20 22:45:34,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2022-02-20 22:45:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_automaton_state_1_6 [2022-02-20 22:45:34,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_automaton_state_1_6 [2022-02-20 22:45:34,466 INFO L130 BoogieDeclarations]: Found specification of procedure nvt_shutdown [2022-02-20 22:45:34,466 INFO L138 BoogieDeclarations]: Found implementation of procedure nvt_shutdown [2022-02-20 22:45:34,466 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-02-20 22:45:34,466 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-02-20 22:45:34,466 INFO L130 BoogieDeclarations]: Found specification of procedure pnp_get_drvdata [2022-02-20 22:45:34,466 INFO L138 BoogieDeclarations]: Found implementation of procedure pnp_get_drvdata [2022-02-20 22:45:34,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 22:45:34,467 INFO L130 BoogieDeclarations]: Found specification of procedure __request_region [2022-02-20 22:45:34,467 INFO L138 BoogieDeclarations]: Found implementation of procedure __request_region [2022-02-20 22:45:34,467 INFO L130 BoogieDeclarations]: Found specification of procedure pnp_port_valid [2022-02-20 22:45:34,467 INFO L138 BoogieDeclarations]: Found implementation of procedure pnp_port_valid [2022-02-20 22:45:34,468 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-02-20 22:45:34,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-02-20 22:45:34,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 22:45:34,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 22:45:35,023 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 22:45:35,029 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 22:45:35,494 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 22:45:38,825 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2022-02-20 22:45:38,887 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 22:45:38,904 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 22:45:38,904 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 22:45:38,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:45:38 BoogieIcfgContainer [2022-02-20 22:45:38,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 22:45:38,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 22:45:38,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 22:45:38,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 22:45:38,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 10:45:32" (1/3) ... [2022-02-20 22:45:38,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d126ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:45:38, skipping insertion in model container [2022-02-20 22:45:38,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:45:34" (2/3) ... [2022-02-20 22:45:38,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d126ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:45:38, skipping insertion in model container [2022-02-20 22:45:38,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:45:38" (3/3) ... [2022-02-20 22:45:38,913 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-media-rc-nuvoton-cir.cil.i [2022-02-20 22:45:38,917 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 22:45:38,918 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-02-20 22:45:38,959 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 22:45:38,964 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:45:38,964 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 22:45:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 1073 states, 632 states have (on average 1.2373417721518987) internal successors, (782), 646 states have internal predecessors, (782), 368 states have call successors, (368), 71 states have call predecessors, (368), 70 states have return successors, (364), 363 states have call predecessors, (364), 364 states have call successors, (364) [2022-02-20 22:45:39,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 22:45:39,015 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:45:39,016 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-02-20 22:45:39,017 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 22:45:39,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:45:39,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1302694362, now seen corresponding path program 1 times [2022-02-20 22:45:39,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:45:39,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243087903] [2022-02-20 22:45:39,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:45:39,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:45:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:45:39,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 22:45:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:45:39,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:45:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:45:39,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {1076#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {1076#true} is VALID [2022-02-20 22:45:39,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-02-20 22:45:39,488 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1076#true} {1076#true} #1936#return; {1076#true} is VALID [2022-02-20 22:45:39,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {1113#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~4.base, ~res~4.offset;havoc ~tmp~50.base, ~tmp~50.offset;havoc ~tmp___0~16;havoc ~tmp___1~6; {1076#true} is VALID [2022-02-20 22:45:39,489 INFO L272 TraceCheckUtils]: 1: Hoare triple {1076#true} call #t~ret426 := ldv_undef_int(); {1076#true} is VALID [2022-02-20 22:45:39,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {1076#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {1076#true} is VALID [2022-02-20 22:45:39,489 INFO L290 TraceCheckUtils]: 3: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-02-20 22:45:39,489 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1076#true} {1076#true} #1936#return; {1076#true} is VALID [2022-02-20 22:45:39,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {1076#true} assume -2147483648 <= #t~ret426 && #t~ret426 <= 2147483647;~tmp___1~6 := #t~ret426;havoc #t~ret426; {1076#true} is VALID [2022-02-20 22:45:39,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {1076#true} assume !(0 != ~tmp___1~6);#res.base, #res.offset := 0, 0; {1076#true} is VALID [2022-02-20 22:45:39,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-02-20 22:45:39,491 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1076#true} {1076#true} #2106#return; {1076#true} is VALID [2022-02-20 22:45:39,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:45:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:45:39,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:45:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:45:39,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {1076#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {1076#true} is VALID [2022-02-20 22:45:39,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-02-20 22:45:39,538 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1076#true} {1076#true} #1936#return; {1076#true} is VALID [2022-02-20 22:45:39,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {1113#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~4.base, ~res~4.offset;havoc ~tmp~50.base, ~tmp~50.offset;havoc ~tmp___0~16;havoc ~tmp___1~6; {1076#true} is VALID [2022-02-20 22:45:39,539 INFO L272 TraceCheckUtils]: 1: Hoare triple {1076#true} call #t~ret426 := ldv_undef_int(); {1076#true} is VALID [2022-02-20 22:45:39,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {1076#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {1076#true} is VALID [2022-02-20 22:45:39,540 INFO L290 TraceCheckUtils]: 3: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-02-20 22:45:39,540 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1076#true} {1076#true} #1936#return; {1076#true} is VALID [2022-02-20 22:45:39,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {1076#true} assume -2147483648 <= #t~ret426 && #t~ret426 <= 2147483647;~tmp___1~6 := #t~ret426;havoc #t~ret426; {1076#true} is VALID [2022-02-20 22:45:39,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {1076#true} assume !(0 != ~tmp___1~6);#res.base, #res.offset := 0, 0; {1076#true} is VALID [2022-02-20 22:45:39,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-02-20 22:45:39,541 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1076#true} {1076#true} #2108#return; {1076#true} is VALID [2022-02-20 22:45:39,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-20 22:45:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:45:39,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:45:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:45:39,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {1076#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {1076#true} is VALID [2022-02-20 22:45:39,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-02-20 22:45:39,571 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1076#true} {1076#true} #1936#return; {1076#true} is VALID [2022-02-20 22:45:39,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {1113#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~4.base, ~res~4.offset;havoc ~tmp~50.base, ~tmp~50.offset;havoc ~tmp___0~16;havoc ~tmp___1~6; {1076#true} is VALID [2022-02-20 22:45:39,572 INFO L272 TraceCheckUtils]: 1: Hoare triple {1076#true} call #t~ret426 := ldv_undef_int(); {1076#true} is VALID [2022-02-20 22:45:39,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {1076#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {1076#true} is VALID [2022-02-20 22:45:39,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-02-20 22:45:39,572 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1076#true} {1076#true} #1936#return; {1076#true} is VALID [2022-02-20 22:45:39,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {1076#true} assume -2147483648 <= #t~ret426 && #t~ret426 <= 2147483647;~tmp___1~6 := #t~ret426;havoc #t~ret426; {1076#true} is VALID [2022-02-20 22:45:39,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {1076#true} assume !(0 != ~tmp___1~6);#res.base, #res.offset := 0, 0; {1076#true} is VALID [2022-02-20 22:45:39,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-02-20 22:45:39,573 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1076#true} {1076#true} #2110#return; {1076#true} is VALID [2022-02-20 22:45:39,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 22:45:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:45:39,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {1076#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {1076#true} is VALID [2022-02-20 22:45:39,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-02-20 22:45:39,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1076#true} {1105#(= 7 ~ldv_statevar_8~0)} #2112#return; {1105#(= 7 ~ldv_statevar_8~0)} is VALID [2022-02-20 22:45:39,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 22:45:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:45:39,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {1076#true} ~expression := #in~expression; {1076#true} is VALID [2022-02-20 22:45:39,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#true} assume !(0 == ~expression); {1076#true} is VALID [2022-02-20 22:45:39,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-02-20 22:45:39,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1076#true} {1077#false} #2124#return; {1077#false} is VALID [2022-02-20 22:45:39,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {1076#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(54, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(41, 3);call #Ultimate.allocInit(41, 4);call #Ultimate.allocInit(41, 5);call #Ultimate.allocInit(39, 6);call #Ultimate.allocInit(12, 7);call #Ultimate.allocInit(34, 8);call #Ultimate.allocInit(34, 9);call #Ultimate.allocInit(34, 10);call #Ultimate.allocInit(34, 11);call #Ultimate.allocInit(34, 12);call #Ultimate.allocInit(34, 13);call #Ultimate.allocInit(34, 14);call #Ultimate.allocInit(34, 15);call #Ultimate.allocInit(34, 16);call #Ultimate.allocInit(34, 17);call #Ultimate.allocInit(34, 18);call #Ultimate.allocInit(34, 19);call #Ultimate.allocInit(34, 20);call #Ultimate.allocInit(34, 21);call #Ultimate.allocInit(34, 22);call #Ultimate.allocInit(34, 23);call #Ultimate.allocInit(59, 24);call #Ultimate.allocInit(12, 25);call #Ultimate.allocInit(46, 26);call #Ultimate.allocInit(46, 27);call #Ultimate.allocInit(46, 28);call #Ultimate.allocInit(43, 29);call #Ultimate.allocInit(12, 30);call #Ultimate.allocInit(39, 31);call #Ultimate.allocInit(39, 32);call #Ultimate.allocInit(39, 33);call #Ultimate.allocInit(39, 34);call #Ultimate.allocInit(39, 35);call #Ultimate.allocInit(39, 36);call #Ultimate.allocInit(39, 37);call #Ultimate.allocInit(39, 38);call #Ultimate.allocInit(39, 39);call #Ultimate.allocInit(39, 40);call #Ultimate.allocInit(39, 41);call #Ultimate.allocInit(39, 42);call #Ultimate.allocInit(39, 43);call #Ultimate.allocInit(41, 44);call #Ultimate.allocInit(39, 45);call #Ultimate.allocInit(39, 46);call #Ultimate.allocInit(47, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(27, 49);call #Ultimate.allocInit(6, 50);call write~init~int(32, 50, 0, 1);call write~init~int(37, 50, 1, 1);call write~init~int(48, 50, 2, 1);call write~init~int(50, 50, 3, 1);call write~init~int(120, 50, 4, 1);call write~init~int(0, 50, 5, 1);call #Ultimate.allocInit(2, 51);call write~init~int(10, 51, 0, 1);call write~init~int(0, 51, 1, 1);call #Ultimate.allocInit(9, 52);call #Ultimate.allocInit(9, 53);call #Ultimate.allocInit(11, 54);call #Ultimate.allocInit(9, 55);call #Ultimate.allocInit(70, 56);call #Ultimate.allocInit(42, 57);call #Ultimate.allocInit(69, 58);call #Ultimate.allocInit(74, 59);call #Ultimate.allocInit(34, 60);call #Ultimate.allocInit(15, 61);call #Ultimate.allocInit(16, 62);call #Ultimate.allocInit(8, 63);call #Ultimate.allocInit(2, 64);call write~init~int(10, 64, 0, 1);call write~init~int(0, 64, 1, 1);call #Ultimate.allocInit(25, 65);call #Ultimate.allocInit(23, 66);call #Ultimate.allocInit(43, 67);call #Ultimate.allocInit(43, 68);call #Ultimate.allocInit(6, 69);call write~init~int(112, 69, 0, 1);call write~init~int(117, 69, 1, 1);call write~init~int(108, 69, 2, 1);call write~init~int(115, 69, 3, 1);call write~init~int(101, 69, 4, 1);call write~init~int(0, 69, 5, 1);call #Ultimate.allocInit(6, 70);call write~init~int(115, 70, 0, 1);call write~init~int(112, 70, 1, 1);call write~init~int(97, 70, 2, 1);call write~init~int(99, 70, 3, 1);call write~init~int(101, 70, 4, 1);call write~init~int(0, 70, 5, 1);call #Ultimate.allocInit(57, 71);call #Ultimate.allocInit(59, 72);call #Ultimate.allocInit(23, 73);call #Ultimate.allocInit(23, 74);call #Ultimate.allocInit(55, 75);call #Ultimate.allocInit(60, 76);call #Ultimate.allocInit(31, 77);call #Ultimate.allocInit(19, 78);call #Ultimate.allocInit(59, 79);call #Ultimate.allocInit(5, 80);call write~init~int(32, 80, 0, 1);call write~init~int(82, 80, 1, 1);call write~init~int(68, 80, 2, 1);call write~init~int(82, 80, 3, 1);call write~init~int(0, 80, 4, 1);call #Ultimate.allocInit(1, 81);call write~init~int(0, 81, 0, 1);call #Ultimate.allocInit(5, 82);call write~init~int(32, 82, 0, 1);call write~init~int(82, 82, 1, 1);call write~init~int(84, 82, 2, 1);call write~init~int(82, 82, 3, 1);call write~init~int(0, 82, 4, 1);call #Ultimate.allocInit(1, 83);call write~init~int(0, 83, 0, 1);call #Ultimate.allocInit(4, 84);call write~init~int(32, 84, 0, 1);call write~init~int(80, 84, 1, 1);call write~init~int(69, 84, 2, 1);call write~init~int(0, 84, 3, 1);call #Ultimate.allocInit(1, 85);call write~init~int(0, 85, 0, 1);call #Ultimate.allocInit(5, 86);call write~init~int(32, 86, 0, 1);call write~init~int(82, 86, 1, 1);call write~init~int(70, 86, 2, 1);call write~init~int(79, 86, 3, 1);call write~init~int(0, 86, 4, 1);call #Ultimate.allocInit(1, 87);call write~init~int(0, 87, 0, 1);call #Ultimate.allocInit(4, 88);call write~init~int(32, 88, 0, 1);call write~init~int(84, 88, 1, 1);call write~init~int(69, 88, 2, 1);call write~init~int(0, 88, 3, 1);call #Ultimate.allocInit(1, 89);call write~init~int(0, 89, 0, 1);call #Ultimate.allocInit(5, 90);call write~init~int(32, 90, 0, 1);call write~init~int(84, 90, 1, 1);call write~init~int(84, 90, 2, 1);call write~init~int(82, 90, 3, 1);call write~init~int(0, 90, 4, 1);call #Ultimate.allocInit(1, 91);call write~init~int(0, 91, 0, 1);call #Ultimate.allocInit(5, 92);call write~init~int(32, 92, 0, 1);call write~init~int(84, 92, 1, 1);call write~init~int(70, 92, 2, 1);call write~init~int(85, 92, 3, 1);call write~init~int(0, 92, 4, 1);call #Ultimate.allocInit(1, 93);call write~init~int(0, 93, 0, 1);call #Ultimate.allocInit(4, 94);call write~init~int(32, 94, 0, 1);call write~init~int(71, 94, 1, 1);call write~init~int(72, 94, 2, 1);call write~init~int(0, 94, 3, 1);call #Ultimate.allocInit(1, 95);call write~init~int(0, 95, 0, 1);call #Ultimate.allocInit(3, 96);call write~init~int(32, 96, 0, 1);call write~init~int(63, 96, 1, 1);call write~init~int(0, 96, 2, 1);call #Ultimate.allocInit(1, 97);call write~init~int(0, 97, 0, 1);call #Ultimate.allocInit(25, 98);call #Ultimate.allocInit(12, 99);call #Ultimate.allocInit(37, 100);call #Ultimate.allocInit(12, 101);call #Ultimate.allocInit(43, 102);call #Ultimate.allocInit(12, 103);call #Ultimate.allocInit(23, 104);call #Ultimate.allocInit(12, 105);call #Ultimate.allocInit(25, 106);call #Ultimate.allocInit(17, 107);call #Ultimate.allocInit(44, 108);call #Ultimate.allocInit(17, 109);call #Ultimate.allocInit(41, 110);call #Ultimate.allocInit(23, 111);call #Ultimate.allocInit(17, 112);call #Ultimate.allocInit(24, 113);call #Ultimate.allocInit(24, 114);call #Ultimate.allocInit(20, 115);call #Ultimate.allocInit(26, 116);call #Ultimate.allocInit(26, 117);call #Ultimate.allocInit(25, 118);call #Ultimate.allocInit(24, 119);call #Ultimate.allocInit(15, 120);call #Ultimate.allocInit(45, 121);call #Ultimate.allocInit(13, 122);call #Ultimate.allocInit(12, 123);call #Ultimate.allocInit(11, 124);call #Ultimate.allocInit(12, 125);call #Ultimate.allocInit(12, 126);call #Ultimate.allocInit(12, 127);call #Ultimate.allocInit(12, 128);call #Ultimate.allocInit(51, 129);call #Ultimate.allocInit(25, 130);call #Ultimate.allocInit(12, 131);call #Ultimate.allocInit(25, 132);call #Ultimate.allocInit(11, 133);call #Ultimate.allocInit(12, 134);call #Ultimate.allocInit(1, 135);call write~init~int(0, 135, 0, 1);call #Ultimate.allocInit(2, 136);call write~init~int(48, 136, 0, 1);call write~init~int(0, 136, 1, 1);call #Ultimate.allocInit(88, 137);~debug~0 := 0;~#nvt_ids~0.base, ~#nvt_ids~0.offset := 138, 0;call #Ultimate.allocInit(48, 138);call write~init~int(87, ~#nvt_ids~0.base, ~#nvt_ids~0.offset, 1);call write~init~int(69, ~#nvt_ids~0.base, 1 + ~#nvt_ids~0.offset, 1);call write~init~int(67, ~#nvt_ids~0.base, 2 + ~#nvt_ids~0.offset, 1);call write~init~int(48, ~#nvt_ids~0.base, 3 + ~#nvt_ids~0.offset, 1);call write~init~int(53, ~#nvt_ids~0.base, 4 + ~#nvt_ids~0.offset, 1);call write~init~int(51, ~#nvt_ids~0.base, 5 + ~#nvt_ids~0.offset, 1);call write~init~int(48, ~#nvt_ids~0.base, 6 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 7 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 8 + ~#nvt_ids~0.offset, 8);call write~init~int(78, ~#nvt_ids~0.base, 16 + ~#nvt_ids~0.offset, 1);call write~init~int(84, ~#nvt_ids~0.base, 17 + ~#nvt_ids~0.offset, 1);call write~init~int(78, ~#nvt_ids~0.base, 18 + ~#nvt_ids~0.offset, 1);call write~init~int(48, ~#nvt_ids~0.base, 19 + ~#nvt_ids~0.offset, 1);call write~init~int(53, ~#nvt_ids~0.base, 20 + ~#nvt_ids~0.offset, 1);call write~init~int(51, ~#nvt_ids~0.base, 21 + ~#nvt_ids~0.offset, 1);call write~init~int(48, ~#nvt_ids~0.base, 22 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 23 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 24 + ~#nvt_ids~0.offset, 8);call write~init~int(0, ~#nvt_ids~0.base, 32 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 33 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 34 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 35 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 36 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 37 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 38 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 39 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 40 + ~#nvt_ids~0.offset, 8);~#nvt_driver~0.base, ~#nvt_driver~0.offset := 139, 0;call #Ultimate.allocInit(173, 139);call write~init~$Pointer$(134, 0, ~#nvt_driver~0.base, ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(~#nvt_ids~0.base, ~#nvt_ids~0.offset, ~#nvt_driver~0.base, 8 + ~#nvt_driver~0.offset, 8);call write~init~int(1, ~#nvt_driver~0.base, 16 + ~#nvt_driver~0.offset, 4);call write~init~$Pointer$(#funAddr~nvt_probe.base, #funAddr~nvt_probe.offset, ~#nvt_driver~0.base, 20 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~nvt_remove.base, #funAddr~nvt_remove.offset, ~#nvt_driver~0.base, 28 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~nvt_shutdown.base, #funAddr~nvt_shutdown.offset, ~#nvt_driver~0.base, 36 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~nvt_suspend.base, #funAddr~nvt_suspend.offset, ~#nvt_driver~0.base, 44 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~nvt_resume.base, #funAddr~nvt_resume.offset, ~#nvt_driver~0.base, 52 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 60 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 68 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 76 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 84 + ~#nvt_driver~0.offset, 8);call write~init~int(0, ~#nvt_driver~0.base, 92 + ~#nvt_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 93 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 101 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 109 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 117 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 125 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 133 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 141 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 149 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 157 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 165 + ~#nvt_driver~0.offset, 8);~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[0 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[1 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[2 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[3 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[4 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[5 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[6 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[7 := 0];~__mod_pnp_device_table~0.driver_data := 0;~ldv_0_data_data~0.base, ~ldv_0_data_data~0.offset := 0, 0;~ldv_0_line_line~0 := 0;~ldv_0_ret_val_default~0 := 0;~ldv_0_thread_thread~0.base, ~ldv_0_thread_thread~0.offset := 0, 0;~ldv_1_data_data~0.base, ~ldv_1_data_data~0.offset := 0, 0;~ldv_1_line_line~0 := 0;~ldv_1_ret_val_default~0 := 0;~ldv_1_thread_thread~0.base, ~ldv_1_thread_thread~0.offset := 0, 0;~ldv_2_container_struct_pnp_driver~0.base, ~ldv_2_container_struct_pnp_driver~0.offset := 0, 0;~#ldv_2_resource_struct_pm_message~0.base, ~#ldv_2_resource_struct_pm_message~0.offset := 140, 0;call #Ultimate.allocInit(4, 140);call write~init~int(0, ~#ldv_2_resource_struct_pm_message~0.base, ~#ldv_2_resource_struct_pm_message~0.offset, 4);~ldv_2_resource_struct_pnp_dev_ptr~0.base, ~ldv_2_resource_struct_pnp_dev_ptr~0.offset := 0, 0;~ldv_2_resource_struct_pnp_device_id~0.base, ~ldv_2_resource_struct_pnp_device_id~0.offset := 0, 0;~ldv_2_ret_default~0 := 0;~ldv_8_ret_default~0 := 0;~ldv_statevar_0~0 := 0;~ldv_statevar_1~0 := 0;~ldv_statevar_2~0 := 0;~ldv_statevar_8~0 := 0;~ldv_0_callback_handler~0.base, ~ldv_0_callback_handler~0.offset := #funAddr~nvt_cir_isr.base, #funAddr~nvt_cir_isr.offset;~ldv_1_callback_handler~0.base, ~ldv_1_callback_handler~0.offset := #funAddr~nvt_cir_wake_isr.base, #funAddr~nvt_cir_wake_isr.offset;~ldv_2_callback_remove~0.base, ~ldv_2_callback_remove~0.offset := #funAddr~nvt_remove.base, #funAddr~nvt_remove.offset;~ldv_8_exit_nvt_exit_default~0.base, ~ldv_8_exit_nvt_exit_default~0.offset := #funAddr~nvt_exit.base, #funAddr~nvt_exit.offset;~ldv_8_init_nvt_init_default~0.base, ~ldv_8_init_nvt_init_default~0.offset := #funAddr~nvt_init.base, #funAddr~nvt_init.offset;~ldv_spin_alloc_lock_of_task_struct~0 := 1;~ldv_spin_i_lock_of_inode~0 := 1;~ldv_spin_lock~0 := 1;~ldv_spin_lock_of_NOT_ARG_SIGN~0 := 1;~ldv_spin_node_size_lock_of_pglist_data~0 := 1;~ldv_spin_nvt_lock_of_nvt_dev~0 := 1;~ldv_spin_ptl~0 := 1;~ldv_spin_siglock_of_sighand_struct~0 := 1; {1076#true} is VALID [2022-02-20 22:45:39,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret360#1, main_~tmp~29#1;havoc main_~tmp~29#1;assume { :begin_inline_ldv_initialize } true; {1076#true} is VALID [2022-02-20 22:45:39,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {1076#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_initialize_external_data } true;assume { :begin_inline_ldv_allocate_external_0 } true;havoc ldv_allocate_external_0_#t~ret347#1.base, ldv_allocate_external_0_#t~ret347#1.offset, ldv_allocate_external_0_#t~ret348#1.base, ldv_allocate_external_0_#t~ret348#1.offset, ldv_allocate_external_0_#t~ret349#1.base, ldv_allocate_external_0_#t~ret349#1.offset; {1076#true} is VALID [2022-02-20 22:45:39,616 INFO L272 TraceCheckUtils]: 3: Hoare triple {1076#true} call ldv_allocate_external_0_#t~ret347#1.base, ldv_allocate_external_0_#t~ret347#1.offset := ldv_malloc(0); {1113#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:45:39,617 INFO L290 TraceCheckUtils]: 4: Hoare triple {1113#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~4.base, ~res~4.offset;havoc ~tmp~50.base, ~tmp~50.offset;havoc ~tmp___0~16;havoc ~tmp___1~6; {1076#true} is VALID [2022-02-20 22:45:39,617 INFO L272 TraceCheckUtils]: 5: Hoare triple {1076#true} call #t~ret426 := ldv_undef_int(); {1076#true} is VALID [2022-02-20 22:45:39,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {1076#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {1076#true} is VALID [2022-02-20 22:45:39,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-02-20 22:45:39,617 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1076#true} {1076#true} #1936#return; {1076#true} is VALID [2022-02-20 22:45:39,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#true} assume -2147483648 <= #t~ret426 && #t~ret426 <= 2147483647;~tmp___1~6 := #t~ret426;havoc #t~ret426; {1076#true} is VALID [2022-02-20 22:45:39,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {1076#true} assume !(0 != ~tmp___1~6);#res.base, #res.offset := 0, 0; {1076#true} is VALID [2022-02-20 22:45:39,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-02-20 22:45:39,618 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1076#true} {1076#true} #2106#return; {1076#true} is VALID [2022-02-20 22:45:39,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {1076#true} ~ldv_0_data_data~0.base, ~ldv_0_data_data~0.offset := ldv_allocate_external_0_#t~ret347#1.base, ldv_allocate_external_0_#t~ret347#1.offset;havoc ldv_allocate_external_0_#t~ret347#1.base, ldv_allocate_external_0_#t~ret347#1.offset;~ldv_0_thread_thread~0.base, ~ldv_0_thread_thread~0.offset := 0, 0; {1076#true} is VALID [2022-02-20 22:45:39,619 INFO L272 TraceCheckUtils]: 14: Hoare triple {1076#true} call ldv_allocate_external_0_#t~ret348#1.base, ldv_allocate_external_0_#t~ret348#1.offset := ldv_malloc(0); {1113#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:45:39,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {1113#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~4.base, ~res~4.offset;havoc ~tmp~50.base, ~tmp~50.offset;havoc ~tmp___0~16;havoc ~tmp___1~6; {1076#true} is VALID [2022-02-20 22:45:39,620 INFO L272 TraceCheckUtils]: 16: Hoare triple {1076#true} call #t~ret426 := ldv_undef_int(); {1076#true} is VALID [2022-02-20 22:45:39,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {1076#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {1076#true} is VALID [2022-02-20 22:45:39,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-02-20 22:45:39,621 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1076#true} {1076#true} #1936#return; {1076#true} is VALID [2022-02-20 22:45:39,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {1076#true} assume -2147483648 <= #t~ret426 && #t~ret426 <= 2147483647;~tmp___1~6 := #t~ret426;havoc #t~ret426; {1076#true} is VALID [2022-02-20 22:45:39,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {1076#true} assume !(0 != ~tmp___1~6);#res.base, #res.offset := 0, 0; {1076#true} is VALID [2022-02-20 22:45:39,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-02-20 22:45:39,621 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1076#true} {1076#true} #2108#return; {1076#true} is VALID [2022-02-20 22:45:39,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {1076#true} ~ldv_1_data_data~0.base, ~ldv_1_data_data~0.offset := ldv_allocate_external_0_#t~ret348#1.base, ldv_allocate_external_0_#t~ret348#1.offset;havoc ldv_allocate_external_0_#t~ret348#1.base, ldv_allocate_external_0_#t~ret348#1.offset;~ldv_1_thread_thread~0.base, ~ldv_1_thread_thread~0.offset := 0, 0; {1076#true} is VALID [2022-02-20 22:45:39,622 INFO L272 TraceCheckUtils]: 25: Hoare triple {1076#true} call ldv_allocate_external_0_#t~ret349#1.base, ldv_allocate_external_0_#t~ret349#1.offset := ldv_malloc(1598); {1113#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:45:39,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {1113#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~4.base, ~res~4.offset;havoc ~tmp~50.base, ~tmp~50.offset;havoc ~tmp___0~16;havoc ~tmp___1~6; {1076#true} is VALID [2022-02-20 22:45:39,622 INFO L272 TraceCheckUtils]: 27: Hoare triple {1076#true} call #t~ret426 := ldv_undef_int(); {1076#true} is VALID [2022-02-20 22:45:39,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {1076#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {1076#true} is VALID [2022-02-20 22:45:39,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-02-20 22:45:39,623 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1076#true} {1076#true} #1936#return; {1076#true} is VALID [2022-02-20 22:45:39,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {1076#true} assume -2147483648 <= #t~ret426 && #t~ret426 <= 2147483647;~tmp___1~6 := #t~ret426;havoc #t~ret426; {1076#true} is VALID [2022-02-20 22:45:39,624 INFO L290 TraceCheckUtils]: 32: Hoare triple {1076#true} assume !(0 != ~tmp___1~6);#res.base, #res.offset := 0, 0; {1076#true} is VALID [2022-02-20 22:45:39,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-02-20 22:45:39,624 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1076#true} {1076#true} #2110#return; {1076#true} is VALID [2022-02-20 22:45:39,624 INFO L290 TraceCheckUtils]: 35: Hoare triple {1076#true} ~ldv_2_resource_struct_pnp_dev_ptr~0.base, ~ldv_2_resource_struct_pnp_dev_ptr~0.offset := ldv_allocate_external_0_#t~ret349#1.base, ldv_allocate_external_0_#t~ret349#1.offset;havoc ldv_allocate_external_0_#t~ret349#1.base, ldv_allocate_external_0_#t~ret349#1.offset; {1076#true} is VALID [2022-02-20 22:45:39,625 INFO L290 TraceCheckUtils]: 36: Hoare triple {1076#true} assume { :end_inline_ldv_allocate_external_0 } true; {1076#true} is VALID [2022-02-20 22:45:39,625 INFO L290 TraceCheckUtils]: 37: Hoare triple {1076#true} assume { :end_inline_ldv_initialize_external_data } true;~ldv_statevar_8~0 := 7;~ldv_statevar_0~0 := 6;~ldv_statevar_1~0 := 6;~ldv_2_ret_default~0 := 1;~ldv_statevar_2~0 := 19; {1105#(= 7 ~ldv_statevar_8~0)} is VALID [2022-02-20 22:45:39,625 INFO L272 TraceCheckUtils]: 38: Hoare triple {1105#(= 7 ~ldv_statevar_8~0)} call main_#t~ret360#1 := ldv_undef_int(); {1076#true} is VALID [2022-02-20 22:45:39,626 INFO L290 TraceCheckUtils]: 39: Hoare triple {1076#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {1076#true} is VALID [2022-02-20 22:45:39,626 INFO L290 TraceCheckUtils]: 40: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-02-20 22:45:39,627 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1076#true} {1105#(= 7 ~ldv_statevar_8~0)} #2112#return; {1105#(= 7 ~ldv_statevar_8~0)} is VALID [2022-02-20 22:45:39,627 INFO L290 TraceCheckUtils]: 42: Hoare triple {1105#(= 7 ~ldv_statevar_8~0)} assume -2147483648 <= main_#t~ret360#1 && main_#t~ret360#1 <= 2147483647;main_~tmp~29#1 := main_#t~ret360#1;havoc main_#t~ret360#1; {1105#(= 7 ~ldv_statevar_8~0)} is VALID [2022-02-20 22:45:39,627 INFO L290 TraceCheckUtils]: 43: Hoare triple {1105#(= 7 ~ldv_statevar_8~0)} assume 0 == main_~tmp~29#1; {1105#(= 7 ~ldv_statevar_8~0)} is VALID [2022-02-20 22:45:39,628 INFO L290 TraceCheckUtils]: 44: Hoare triple {1105#(= 7 ~ldv_statevar_8~0)} assume { :begin_inline_ldv_entry_EMGentry_8 } true;ldv_entry_EMGentry_8_#in~arg0#1.base, ldv_entry_EMGentry_8_#in~arg0#1.offset := 0, 0;havoc ldv_entry_EMGentry_8_#t~ret357#1, ldv_entry_EMGentry_8_#t~ret358#1, ldv_entry_EMGentry_8_#t~ret359#1, ldv_entry_EMGentry_8_~arg0#1.base, ldv_entry_EMGentry_8_~arg0#1.offset, ldv_entry_EMGentry_8_~tmp~28#1;ldv_entry_EMGentry_8_~arg0#1.base, ldv_entry_EMGentry_8_~arg0#1.offset := ldv_entry_EMGentry_8_#in~arg0#1.base, ldv_entry_EMGentry_8_#in~arg0#1.offset;havoc ldv_entry_EMGentry_8_~tmp~28#1; {1105#(= 7 ~ldv_statevar_8~0)} is VALID [2022-02-20 22:45:39,629 INFO L290 TraceCheckUtils]: 45: Hoare triple {1105#(= 7 ~ldv_statevar_8~0)} assume !(4 == ~ldv_statevar_8~0); {1105#(= 7 ~ldv_statevar_8~0)} is VALID [2022-02-20 22:45:39,630 INFO L290 TraceCheckUtils]: 46: Hoare triple {1105#(= 7 ~ldv_statevar_8~0)} assume 6 == ~ldv_statevar_8~0; {1077#false} is VALID [2022-02-20 22:45:39,630 INFO L272 TraceCheckUtils]: 47: Hoare triple {1077#false} call ldv_assume((if 0 != ~ldv_8_ret_default~0 then 1 else 0)); {1076#true} is VALID [2022-02-20 22:45:39,630 INFO L290 TraceCheckUtils]: 48: Hoare triple {1076#true} ~expression := #in~expression; {1076#true} is VALID [2022-02-20 22:45:39,630 INFO L290 TraceCheckUtils]: 49: Hoare triple {1076#true} assume !(0 == ~expression); {1076#true} is VALID [2022-02-20 22:45:39,631 INFO L290 TraceCheckUtils]: 50: Hoare triple {1076#true} assume true; {1076#true} is VALID [2022-02-20 22:45:39,631 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {1076#true} {1077#false} #2124#return; {1077#false} is VALID [2022-02-20 22:45:39,631 INFO L272 TraceCheckUtils]: 52: Hoare triple {1077#false} call ldv_check_final_state(); {1077#false} is VALID [2022-02-20 22:45:39,631 INFO L272 TraceCheckUtils]: 53: Hoare triple {1077#false} call ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit((if 1 == ~ldv_spin_alloc_lock_of_task_struct~0 then 1 else 0)); {1077#false} is VALID [2022-02-20 22:45:39,631 INFO L290 TraceCheckUtils]: 54: Hoare triple {1077#false} ~expr := #in~expr; {1077#false} is VALID [2022-02-20 22:45:39,632 INFO L290 TraceCheckUtils]: 55: Hoare triple {1077#false} assume 0 == ~expr; {1077#false} is VALID [2022-02-20 22:45:39,632 INFO L290 TraceCheckUtils]: 56: Hoare triple {1077#false} assume !false; {1077#false} is VALID [2022-02-20 22:45:39,632 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-02-20 22:45:39,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:45:39,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243087903] [2022-02-20 22:45:39,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243087903] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:45:39,634 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:45:39,634 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 22:45:39,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538495878] [2022-02-20 22:45:39,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:45:39,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 57 [2022-02-20 22:45:39,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:45:39,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 22:45:39,700 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:45:39,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 22:45:39,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:45:39,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 22:45:39,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 22:45:39,741 INFO L87 Difference]: Start difference. First operand has 1073 states, 632 states have (on average 1.2373417721518987) internal successors, (782), 646 states have internal predecessors, (782), 368 states have call successors, (368), 71 states have call predecessors, (368), 70 states have return successors, (364), 363 states have call predecessors, (364), 364 states have call successors, (364) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 22:45:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:45:54,986 INFO L93 Difference]: Finished difference Result 3210 states and 4628 transitions. [2022-02-20 22:45:54,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 22:45:54,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 57 [2022-02-20 22:45:54,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:45:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 22:45:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4628 transitions. [2022-02-20 22:45:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 22:45:55,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4628 transitions. [2022-02-20 22:45:55,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 4628 transitions. [2022-02-20 22:45:59,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4628 edges. 4628 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:45:59,815 INFO L225 Difference]: With dead ends: 3210 [2022-02-20 22:45:59,816 INFO L226 Difference]: Without dead ends: 2139 [2022-02-20 22:45:59,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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:45:59,835 INFO L933 BasicCegarLoop]: 1651 mSDtfsCounter, 1511 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 1067 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1850 SdHoareTripleChecker+Valid, 3045 SdHoareTripleChecker+Invalid, 2472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1067 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-02-20 22:45:59,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1850 Valid, 3045 Invalid, 2472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1067 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-02-20 22:45:59,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2022-02-20 22:46:00,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2055. [2022-02-20 22:46:00,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:46:00,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2139 states. Second operand has 2055 states, 1211 states have (on average 1.23121387283237) internal successors, (1491), 1237 states have internal predecessors, (1491), 704 states have call successors, (704), 138 states have call predecessors, (704), 137 states have return successors, (701), 699 states have call predecessors, (701), 701 states have call successors, (701) [2022-02-20 22:46:00,063 INFO L74 IsIncluded]: Start isIncluded. First operand 2139 states. Second operand has 2055 states, 1211 states have (on average 1.23121387283237) internal successors, (1491), 1237 states have internal predecessors, (1491), 704 states have call successors, (704), 138 states have call predecessors, (704), 137 states have return successors, (701), 699 states have call predecessors, (701), 701 states have call successors, (701) [2022-02-20 22:46:00,069 INFO L87 Difference]: Start difference. First operand 2139 states. Second operand has 2055 states, 1211 states have (on average 1.23121387283237) internal successors, (1491), 1237 states have internal predecessors, (1491), 704 states have call successors, (704), 138 states have call predecessors, (704), 137 states have return successors, (701), 699 states have call predecessors, (701), 701 states have call successors, (701) [2022-02-20 22:46:00,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:46:00,314 INFO L93 Difference]: Finished difference Result 2139 states and 3025 transitions. [2022-02-20 22:46:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 3025 transitions. [2022-02-20 22:46:00,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:46:00,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:46:00,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 2055 states, 1211 states have (on average 1.23121387283237) internal successors, (1491), 1237 states have internal predecessors, (1491), 704 states have call successors, (704), 138 states have call predecessors, (704), 137 states have return successors, (701), 699 states have call predecessors, (701), 701 states have call successors, (701) Second operand 2139 states. [2022-02-20 22:46:00,347 INFO L87 Difference]: Start difference. First operand has 2055 states, 1211 states have (on average 1.23121387283237) internal successors, (1491), 1237 states have internal predecessors, (1491), 704 states have call successors, (704), 138 states have call predecessors, (704), 137 states have return successors, (701), 699 states have call predecessors, (701), 701 states have call successors, (701) Second operand 2139 states. [2022-02-20 22:46:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:46:00,578 INFO L93 Difference]: Finished difference Result 2139 states and 3025 transitions. [2022-02-20 22:46:00,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 3025 transitions. [2022-02-20 22:46:00,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:46:00,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:46:00,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:46:00,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:46:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 1211 states have (on average 1.23121387283237) internal successors, (1491), 1237 states have internal predecessors, (1491), 704 states have call successors, (704), 138 states have call predecessors, (704), 137 states have return successors, (701), 699 states have call predecessors, (701), 701 states have call successors, (701) [2022-02-20 22:46:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 2896 transitions. [2022-02-20 22:46:00,898 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 2896 transitions. Word has length 57 [2022-02-20 22:46:00,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:46:00,898 INFO L470 AbstractCegarLoop]: Abstraction has 2055 states and 2896 transitions. [2022-02-20 22:46:00,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 22:46:00,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2896 transitions. [2022-02-20 22:46:00,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 22:46:00,902 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:46:00,902 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1] [2022-02-20 22:46:00,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 22:46:00,903 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 22:46:00,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:46:00,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1668427310, now seen corresponding path program 1 times [2022-02-20 22:46:00,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:46:00,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143779285] [2022-02-20 22:46:00,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:46:00,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:46:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:01,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 22:46:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:01,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:46:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:01,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {13331#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {13331#true} is VALID [2022-02-20 22:46:01,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {13331#true} assume true; {13331#true} is VALID [2022-02-20 22:46:01,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13331#true} {13331#true} #1936#return; {13331#true} is VALID [2022-02-20 22:46:01,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {13371#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~4.base, ~res~4.offset;havoc ~tmp~50.base, ~tmp~50.offset;havoc ~tmp___0~16;havoc ~tmp___1~6; {13331#true} is VALID [2022-02-20 22:46:01,068 INFO L272 TraceCheckUtils]: 1: Hoare triple {13331#true} call #t~ret426 := ldv_undef_int(); {13331#true} is VALID [2022-02-20 22:46:01,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {13331#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {13331#true} is VALID [2022-02-20 22:46:01,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {13331#true} assume true; {13331#true} is VALID [2022-02-20 22:46:01,068 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13331#true} {13331#true} #1936#return; {13331#true} is VALID [2022-02-20 22:46:01,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {13331#true} assume -2147483648 <= #t~ret426 && #t~ret426 <= 2147483647;~tmp___1~6 := #t~ret426;havoc #t~ret426; {13331#true} is VALID [2022-02-20 22:46:01,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {13331#true} assume !(0 != ~tmp___1~6);#res.base, #res.offset := 0, 0; {13331#true} is VALID [2022-02-20 22:46:01,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {13331#true} assume true; {13331#true} is VALID [2022-02-20 22:46:01,069 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {13331#true} {13331#true} #2106#return; {13331#true} is VALID [2022-02-20 22:46:01,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:46:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:01,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:46:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:01,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {13331#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {13331#true} is VALID [2022-02-20 22:46:01,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {13331#true} assume true; {13331#true} is VALID [2022-02-20 22:46:01,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13331#true} {13331#true} #1936#return; {13331#true} is VALID [2022-02-20 22:46:01,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {13371#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~4.base, ~res~4.offset;havoc ~tmp~50.base, ~tmp~50.offset;havoc ~tmp___0~16;havoc ~tmp___1~6; {13331#true} is VALID [2022-02-20 22:46:01,093 INFO L272 TraceCheckUtils]: 1: Hoare triple {13331#true} call #t~ret426 := ldv_undef_int(); {13331#true} is VALID [2022-02-20 22:46:01,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {13331#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {13331#true} is VALID [2022-02-20 22:46:01,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {13331#true} assume true; {13331#true} is VALID [2022-02-20 22:46:01,094 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13331#true} {13331#true} #1936#return; {13331#true} is VALID [2022-02-20 22:46:01,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {13331#true} assume -2147483648 <= #t~ret426 && #t~ret426 <= 2147483647;~tmp___1~6 := #t~ret426;havoc #t~ret426; {13331#true} is VALID [2022-02-20 22:46:01,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {13331#true} assume !(0 != ~tmp___1~6);#res.base, #res.offset := 0, 0; {13331#true} is VALID [2022-02-20 22:46:01,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {13331#true} assume true; {13331#true} is VALID [2022-02-20 22:46:01,095 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {13331#true} {13331#true} #2108#return; {13331#true} is VALID [2022-02-20 22:46:01,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-20 22:46:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:01,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:46:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:01,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {13331#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {13331#true} is VALID [2022-02-20 22:46:01,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {13331#true} assume true; {13331#true} is VALID [2022-02-20 22:46:01,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13331#true} {13331#true} #1936#return; {13331#true} is VALID [2022-02-20 22:46:01,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {13371#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~4.base, ~res~4.offset;havoc ~tmp~50.base, ~tmp~50.offset;havoc ~tmp___0~16;havoc ~tmp___1~6; {13331#true} is VALID [2022-02-20 22:46:01,114 INFO L272 TraceCheckUtils]: 1: Hoare triple {13331#true} call #t~ret426 := ldv_undef_int(); {13331#true} is VALID [2022-02-20 22:46:01,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {13331#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {13331#true} is VALID [2022-02-20 22:46:01,114 INFO L290 TraceCheckUtils]: 3: Hoare triple {13331#true} assume true; {13331#true} is VALID [2022-02-20 22:46:01,114 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13331#true} {13331#true} #1936#return; {13331#true} is VALID [2022-02-20 22:46:01,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {13331#true} assume -2147483648 <= #t~ret426 && #t~ret426 <= 2147483647;~tmp___1~6 := #t~ret426;havoc #t~ret426; {13331#true} is VALID [2022-02-20 22:46:01,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {13331#true} assume !(0 != ~tmp___1~6);#res.base, #res.offset := 0, 0; {13331#true} is VALID [2022-02-20 22:46:01,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {13331#true} assume true; {13331#true} is VALID [2022-02-20 22:46:01,115 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {13331#true} {13331#true} #2110#return; {13331#true} is VALID [2022-02-20 22:46:01,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 22:46:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:01,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {13331#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {13331#true} is VALID [2022-02-20 22:46:01,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {13331#true} assume true; {13331#true} is VALID [2022-02-20 22:46:01,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13331#true} {13360#(= 19 ~ldv_statevar_2~0)} #2112#return; {13360#(= 19 ~ldv_statevar_2~0)} is VALID [2022-02-20 22:46:01,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-20 22:46:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:01,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {13331#true} ~pdev#1.base, ~pdev#1.offset := #in~pdev#1.base, #in~pdev#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;assume { :begin_inline_ldv_dev_get_drvdata_25 } true;ldv_dev_get_drvdata_25_#in~dev#1.base, ldv_dev_get_drvdata_25_#in~dev#1.offset := ~pdev#1.base, ~pdev#1.offset;havoc ldv_dev_get_drvdata_25_#res#1.base, ldv_dev_get_drvdata_25_#res#1.offset;havoc ldv_dev_get_drvdata_25_#t~ret396#1.base, ldv_dev_get_drvdata_25_#t~ret396#1.offset, ldv_dev_get_drvdata_25_~dev#1.base, ldv_dev_get_drvdata_25_~dev#1.offset, ldv_dev_get_drvdata_25_~tmp~38#1.base, ldv_dev_get_drvdata_25_~tmp~38#1.offset;ldv_dev_get_drvdata_25_~dev#1.base, ldv_dev_get_drvdata_25_~dev#1.offset := ldv_dev_get_drvdata_25_#in~dev#1.base, ldv_dev_get_drvdata_25_#in~dev#1.offset;havoc ldv_dev_get_drvdata_25_~tmp~38#1.base, ldv_dev_get_drvdata_25_~tmp~38#1.offset;assume { :begin_inline_ldv_dev_get_drvdata } true;ldv_dev_get_drvdata_#in~dev#1.base, ldv_dev_get_drvdata_#in~dev#1.offset := ldv_dev_get_drvdata_25_~dev#1.base, ldv_dev_get_drvdata_25_~dev#1.offset;havoc ldv_dev_get_drvdata_#res#1.base, ldv_dev_get_drvdata_#res#1.offset;havoc ldv_dev_get_drvdata_#t~mem405#1.base, ldv_dev_get_drvdata_#t~mem405#1.offset, ldv_dev_get_drvdata_#t~short406#1, ldv_dev_get_drvdata_#t~mem407#1.base, ldv_dev_get_drvdata_#t~mem407#1.offset, ldv_dev_get_drvdata_#t~mem408#1.base, ldv_dev_get_drvdata_#t~mem408#1.offset, ldv_dev_get_drvdata_~dev#1.base, ldv_dev_get_drvdata_~dev#1.offset;ldv_dev_get_drvdata_~dev#1.base, ldv_dev_get_drvdata_~dev#1.offset := ldv_dev_get_drvdata_#in~dev#1.base, ldv_dev_get_drvdata_#in~dev#1.offset;ldv_dev_get_drvdata_#t~short406#1 := 0 != (ldv_dev_get_drvdata_~dev#1.base + ldv_dev_get_drvdata_~dev#1.offset) % 18446744073709551616; {13331#true} is VALID [2022-02-20 22:46:01,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {13331#true} assume ldv_dev_get_drvdata_#t~short406#1;call ldv_dev_get_drvdata_#t~mem405#1.base, ldv_dev_get_drvdata_#t~mem405#1.offset := read~$Pointer$(ldv_dev_get_drvdata_~dev#1.base, 8 + ldv_dev_get_drvdata_~dev#1.offset, 8);ldv_dev_get_drvdata_#t~short406#1 := 0 != (ldv_dev_get_drvdata_#t~mem405#1.base + ldv_dev_get_drvdata_#t~mem405#1.offset) % 18446744073709551616; {13331#true} is VALID [2022-02-20 22:46:01,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {13331#true} assume ldv_dev_get_drvdata_#t~short406#1;havoc ldv_dev_get_drvdata_#t~mem405#1.base, ldv_dev_get_drvdata_#t~mem405#1.offset;havoc ldv_dev_get_drvdata_#t~short406#1;call ldv_dev_get_drvdata_#t~mem407#1.base, ldv_dev_get_drvdata_#t~mem407#1.offset := read~$Pointer$(ldv_dev_get_drvdata_~dev#1.base, 8 + ldv_dev_get_drvdata_~dev#1.offset, 8);call ldv_dev_get_drvdata_#t~mem408#1.base, ldv_dev_get_drvdata_#t~mem408#1.offset := read~$Pointer$(ldv_dev_get_drvdata_#t~mem407#1.base, ldv_dev_get_drvdata_#t~mem407#1.offset, 8);ldv_dev_get_drvdata_#res#1.base, ldv_dev_get_drvdata_#res#1.offset := ldv_dev_get_drvdata_#t~mem408#1.base, ldv_dev_get_drvdata_#t~mem408#1.offset;havoc ldv_dev_get_drvdata_#t~mem407#1.base, ldv_dev_get_drvdata_#t~mem407#1.offset;havoc ldv_dev_get_drvdata_#t~mem408#1.base, ldv_dev_get_drvdata_#t~mem408#1.offset; {13331#true} is VALID [2022-02-20 22:46:01,142 INFO L290 TraceCheckUtils]: 3: Hoare triple {13331#true} ldv_dev_get_drvdata_25_#t~ret396#1.base, ldv_dev_get_drvdata_25_#t~ret396#1.offset := ldv_dev_get_drvdata_#res#1.base, ldv_dev_get_drvdata_#res#1.offset;assume { :end_inline_ldv_dev_get_drvdata } true;ldv_dev_get_drvdata_25_~tmp~38#1.base, ldv_dev_get_drvdata_25_~tmp~38#1.offset := ldv_dev_get_drvdata_25_#t~ret396#1.base, ldv_dev_get_drvdata_25_#t~ret396#1.offset;havoc ldv_dev_get_drvdata_25_#t~ret396#1.base, ldv_dev_get_drvdata_25_#t~ret396#1.offset;ldv_dev_get_drvdata_25_#res#1.base, ldv_dev_get_drvdata_25_#res#1.offset := ldv_dev_get_drvdata_25_~tmp~38#1.base, ldv_dev_get_drvdata_25_~tmp~38#1.offset; {13331#true} is VALID [2022-02-20 22:46:01,142 INFO L290 TraceCheckUtils]: 4: Hoare triple {13331#true} #t~ret61#1.base, #t~ret61#1.offset := ldv_dev_get_drvdata_25_#res#1.base, ldv_dev_get_drvdata_25_#res#1.offset;assume { :end_inline_ldv_dev_get_drvdata_25 } true;~tmp~6#1.base, ~tmp~6#1.offset := #t~ret61#1.base, #t~ret61#1.offset;havoc #t~ret61#1.base, #t~ret61#1.offset;#res#1.base, #res#1.offset := ~tmp~6#1.base, ~tmp~6#1.offset; {13331#true} is VALID [2022-02-20 22:46:01,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {13331#true} assume true; {13331#true} is VALID [2022-02-20 22:46:01,143 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {13331#true} {13332#false} #2270#return; {13332#false} is VALID [2022-02-20 22:46:01,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {13331#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(54, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(41, 3);call #Ultimate.allocInit(41, 4);call #Ultimate.allocInit(41, 5);call #Ultimate.allocInit(39, 6);call #Ultimate.allocInit(12, 7);call #Ultimate.allocInit(34, 8);call #Ultimate.allocInit(34, 9);call #Ultimate.allocInit(34, 10);call #Ultimate.allocInit(34, 11);call #Ultimate.allocInit(34, 12);call #Ultimate.allocInit(34, 13);call #Ultimate.allocInit(34, 14);call #Ultimate.allocInit(34, 15);call #Ultimate.allocInit(34, 16);call #Ultimate.allocInit(34, 17);call #Ultimate.allocInit(34, 18);call #Ultimate.allocInit(34, 19);call #Ultimate.allocInit(34, 20);call #Ultimate.allocInit(34, 21);call #Ultimate.allocInit(34, 22);call #Ultimate.allocInit(34, 23);call #Ultimate.allocInit(59, 24);call #Ultimate.allocInit(12, 25);call #Ultimate.allocInit(46, 26);call #Ultimate.allocInit(46, 27);call #Ultimate.allocInit(46, 28);call #Ultimate.allocInit(43, 29);call #Ultimate.allocInit(12, 30);call #Ultimate.allocInit(39, 31);call #Ultimate.allocInit(39, 32);call #Ultimate.allocInit(39, 33);call #Ultimate.allocInit(39, 34);call #Ultimate.allocInit(39, 35);call #Ultimate.allocInit(39, 36);call #Ultimate.allocInit(39, 37);call #Ultimate.allocInit(39, 38);call #Ultimate.allocInit(39, 39);call #Ultimate.allocInit(39, 40);call #Ultimate.allocInit(39, 41);call #Ultimate.allocInit(39, 42);call #Ultimate.allocInit(39, 43);call #Ultimate.allocInit(41, 44);call #Ultimate.allocInit(39, 45);call #Ultimate.allocInit(39, 46);call #Ultimate.allocInit(47, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(27, 49);call #Ultimate.allocInit(6, 50);call write~init~int(32, 50, 0, 1);call write~init~int(37, 50, 1, 1);call write~init~int(48, 50, 2, 1);call write~init~int(50, 50, 3, 1);call write~init~int(120, 50, 4, 1);call write~init~int(0, 50, 5, 1);call #Ultimate.allocInit(2, 51);call write~init~int(10, 51, 0, 1);call write~init~int(0, 51, 1, 1);call #Ultimate.allocInit(9, 52);call #Ultimate.allocInit(9, 53);call #Ultimate.allocInit(11, 54);call #Ultimate.allocInit(9, 55);call #Ultimate.allocInit(70, 56);call #Ultimate.allocInit(42, 57);call #Ultimate.allocInit(69, 58);call #Ultimate.allocInit(74, 59);call #Ultimate.allocInit(34, 60);call #Ultimate.allocInit(15, 61);call #Ultimate.allocInit(16, 62);call #Ultimate.allocInit(8, 63);call #Ultimate.allocInit(2, 64);call write~init~int(10, 64, 0, 1);call write~init~int(0, 64, 1, 1);call #Ultimate.allocInit(25, 65);call #Ultimate.allocInit(23, 66);call #Ultimate.allocInit(43, 67);call #Ultimate.allocInit(43, 68);call #Ultimate.allocInit(6, 69);call write~init~int(112, 69, 0, 1);call write~init~int(117, 69, 1, 1);call write~init~int(108, 69, 2, 1);call write~init~int(115, 69, 3, 1);call write~init~int(101, 69, 4, 1);call write~init~int(0, 69, 5, 1);call #Ultimate.allocInit(6, 70);call write~init~int(115, 70, 0, 1);call write~init~int(112, 70, 1, 1);call write~init~int(97, 70, 2, 1);call write~init~int(99, 70, 3, 1);call write~init~int(101, 70, 4, 1);call write~init~int(0, 70, 5, 1);call #Ultimate.allocInit(57, 71);call #Ultimate.allocInit(59, 72);call #Ultimate.allocInit(23, 73);call #Ultimate.allocInit(23, 74);call #Ultimate.allocInit(55, 75);call #Ultimate.allocInit(60, 76);call #Ultimate.allocInit(31, 77);call #Ultimate.allocInit(19, 78);call #Ultimate.allocInit(59, 79);call #Ultimate.allocInit(5, 80);call write~init~int(32, 80, 0, 1);call write~init~int(82, 80, 1, 1);call write~init~int(68, 80, 2, 1);call write~init~int(82, 80, 3, 1);call write~init~int(0, 80, 4, 1);call #Ultimate.allocInit(1, 81);call write~init~int(0, 81, 0, 1);call #Ultimate.allocInit(5, 82);call write~init~int(32, 82, 0, 1);call write~init~int(82, 82, 1, 1);call write~init~int(84, 82, 2, 1);call write~init~int(82, 82, 3, 1);call write~init~int(0, 82, 4, 1);call #Ultimate.allocInit(1, 83);call write~init~int(0, 83, 0, 1);call #Ultimate.allocInit(4, 84);call write~init~int(32, 84, 0, 1);call write~init~int(80, 84, 1, 1);call write~init~int(69, 84, 2, 1);call write~init~int(0, 84, 3, 1);call #Ultimate.allocInit(1, 85);call write~init~int(0, 85, 0, 1);call #Ultimate.allocInit(5, 86);call write~init~int(32, 86, 0, 1);call write~init~int(82, 86, 1, 1);call write~init~int(70, 86, 2, 1);call write~init~int(79, 86, 3, 1);call write~init~int(0, 86, 4, 1);call #Ultimate.allocInit(1, 87);call write~init~int(0, 87, 0, 1);call #Ultimate.allocInit(4, 88);call write~init~int(32, 88, 0, 1);call write~init~int(84, 88, 1, 1);call write~init~int(69, 88, 2, 1);call write~init~int(0, 88, 3, 1);call #Ultimate.allocInit(1, 89);call write~init~int(0, 89, 0, 1);call #Ultimate.allocInit(5, 90);call write~init~int(32, 90, 0, 1);call write~init~int(84, 90, 1, 1);call write~init~int(84, 90, 2, 1);call write~init~int(82, 90, 3, 1);call write~init~int(0, 90, 4, 1);call #Ultimate.allocInit(1, 91);call write~init~int(0, 91, 0, 1);call #Ultimate.allocInit(5, 92);call write~init~int(32, 92, 0, 1);call write~init~int(84, 92, 1, 1);call write~init~int(70, 92, 2, 1);call write~init~int(85, 92, 3, 1);call write~init~int(0, 92, 4, 1);call #Ultimate.allocInit(1, 93);call write~init~int(0, 93, 0, 1);call #Ultimate.allocInit(4, 94);call write~init~int(32, 94, 0, 1);call write~init~int(71, 94, 1, 1);call write~init~int(72, 94, 2, 1);call write~init~int(0, 94, 3, 1);call #Ultimate.allocInit(1, 95);call write~init~int(0, 95, 0, 1);call #Ultimate.allocInit(3, 96);call write~init~int(32, 96, 0, 1);call write~init~int(63, 96, 1, 1);call write~init~int(0, 96, 2, 1);call #Ultimate.allocInit(1, 97);call write~init~int(0, 97, 0, 1);call #Ultimate.allocInit(25, 98);call #Ultimate.allocInit(12, 99);call #Ultimate.allocInit(37, 100);call #Ultimate.allocInit(12, 101);call #Ultimate.allocInit(43, 102);call #Ultimate.allocInit(12, 103);call #Ultimate.allocInit(23, 104);call #Ultimate.allocInit(12, 105);call #Ultimate.allocInit(25, 106);call #Ultimate.allocInit(17, 107);call #Ultimate.allocInit(44, 108);call #Ultimate.allocInit(17, 109);call #Ultimate.allocInit(41, 110);call #Ultimate.allocInit(23, 111);call #Ultimate.allocInit(17, 112);call #Ultimate.allocInit(24, 113);call #Ultimate.allocInit(24, 114);call #Ultimate.allocInit(20, 115);call #Ultimate.allocInit(26, 116);call #Ultimate.allocInit(26, 117);call #Ultimate.allocInit(25, 118);call #Ultimate.allocInit(24, 119);call #Ultimate.allocInit(15, 120);call #Ultimate.allocInit(45, 121);call #Ultimate.allocInit(13, 122);call #Ultimate.allocInit(12, 123);call #Ultimate.allocInit(11, 124);call #Ultimate.allocInit(12, 125);call #Ultimate.allocInit(12, 126);call #Ultimate.allocInit(12, 127);call #Ultimate.allocInit(12, 128);call #Ultimate.allocInit(51, 129);call #Ultimate.allocInit(25, 130);call #Ultimate.allocInit(12, 131);call #Ultimate.allocInit(25, 132);call #Ultimate.allocInit(11, 133);call #Ultimate.allocInit(12, 134);call #Ultimate.allocInit(1, 135);call write~init~int(0, 135, 0, 1);call #Ultimate.allocInit(2, 136);call write~init~int(48, 136, 0, 1);call write~init~int(0, 136, 1, 1);call #Ultimate.allocInit(88, 137);~debug~0 := 0;~#nvt_ids~0.base, ~#nvt_ids~0.offset := 138, 0;call #Ultimate.allocInit(48, 138);call write~init~int(87, ~#nvt_ids~0.base, ~#nvt_ids~0.offset, 1);call write~init~int(69, ~#nvt_ids~0.base, 1 + ~#nvt_ids~0.offset, 1);call write~init~int(67, ~#nvt_ids~0.base, 2 + ~#nvt_ids~0.offset, 1);call write~init~int(48, ~#nvt_ids~0.base, 3 + ~#nvt_ids~0.offset, 1);call write~init~int(53, ~#nvt_ids~0.base, 4 + ~#nvt_ids~0.offset, 1);call write~init~int(51, ~#nvt_ids~0.base, 5 + ~#nvt_ids~0.offset, 1);call write~init~int(48, ~#nvt_ids~0.base, 6 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 7 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 8 + ~#nvt_ids~0.offset, 8);call write~init~int(78, ~#nvt_ids~0.base, 16 + ~#nvt_ids~0.offset, 1);call write~init~int(84, ~#nvt_ids~0.base, 17 + ~#nvt_ids~0.offset, 1);call write~init~int(78, ~#nvt_ids~0.base, 18 + ~#nvt_ids~0.offset, 1);call write~init~int(48, ~#nvt_ids~0.base, 19 + ~#nvt_ids~0.offset, 1);call write~init~int(53, ~#nvt_ids~0.base, 20 + ~#nvt_ids~0.offset, 1);call write~init~int(51, ~#nvt_ids~0.base, 21 + ~#nvt_ids~0.offset, 1);call write~init~int(48, ~#nvt_ids~0.base, 22 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 23 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 24 + ~#nvt_ids~0.offset, 8);call write~init~int(0, ~#nvt_ids~0.base, 32 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 33 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 34 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 35 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 36 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 37 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 38 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 39 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 40 + ~#nvt_ids~0.offset, 8);~#nvt_driver~0.base, ~#nvt_driver~0.offset := 139, 0;call #Ultimate.allocInit(173, 139);call write~init~$Pointer$(134, 0, ~#nvt_driver~0.base, ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(~#nvt_ids~0.base, ~#nvt_ids~0.offset, ~#nvt_driver~0.base, 8 + ~#nvt_driver~0.offset, 8);call write~init~int(1, ~#nvt_driver~0.base, 16 + ~#nvt_driver~0.offset, 4);call write~init~$Pointer$(#funAddr~nvt_probe.base, #funAddr~nvt_probe.offset, ~#nvt_driver~0.base, 20 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~nvt_remove.base, #funAddr~nvt_remove.offset, ~#nvt_driver~0.base, 28 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~nvt_shutdown.base, #funAddr~nvt_shutdown.offset, ~#nvt_driver~0.base, 36 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~nvt_suspend.base, #funAddr~nvt_suspend.offset, ~#nvt_driver~0.base, 44 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~nvt_resume.base, #funAddr~nvt_resume.offset, ~#nvt_driver~0.base, 52 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 60 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 68 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 76 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 84 + ~#nvt_driver~0.offset, 8);call write~init~int(0, ~#nvt_driver~0.base, 92 + ~#nvt_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 93 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 101 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 109 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 117 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 125 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 133 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 141 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 149 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 157 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 165 + ~#nvt_driver~0.offset, 8);~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[0 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[1 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[2 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[3 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[4 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[5 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[6 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[7 := 0];~__mod_pnp_device_table~0.driver_data := 0;~ldv_0_data_data~0.base, ~ldv_0_data_data~0.offset := 0, 0;~ldv_0_line_line~0 := 0;~ldv_0_ret_val_default~0 := 0;~ldv_0_thread_thread~0.base, ~ldv_0_thread_thread~0.offset := 0, 0;~ldv_1_data_data~0.base, ~ldv_1_data_data~0.offset := 0, 0;~ldv_1_line_line~0 := 0;~ldv_1_ret_val_default~0 := 0;~ldv_1_thread_thread~0.base, ~ldv_1_thread_thread~0.offset := 0, 0;~ldv_2_container_struct_pnp_driver~0.base, ~ldv_2_container_struct_pnp_driver~0.offset := 0, 0;~#ldv_2_resource_struct_pm_message~0.base, ~#ldv_2_resource_struct_pm_message~0.offset := 140, 0;call #Ultimate.allocInit(4, 140);call write~init~int(0, ~#ldv_2_resource_struct_pm_message~0.base, ~#ldv_2_resource_struct_pm_message~0.offset, 4);~ldv_2_resource_struct_pnp_dev_ptr~0.base, ~ldv_2_resource_struct_pnp_dev_ptr~0.offset := 0, 0;~ldv_2_resource_struct_pnp_device_id~0.base, ~ldv_2_resource_struct_pnp_device_id~0.offset := 0, 0;~ldv_2_ret_default~0 := 0;~ldv_8_ret_default~0 := 0;~ldv_statevar_0~0 := 0;~ldv_statevar_1~0 := 0;~ldv_statevar_2~0 := 0;~ldv_statevar_8~0 := 0;~ldv_0_callback_handler~0.base, ~ldv_0_callback_handler~0.offset := #funAddr~nvt_cir_isr.base, #funAddr~nvt_cir_isr.offset;~ldv_1_callback_handler~0.base, ~ldv_1_callback_handler~0.offset := #funAddr~nvt_cir_wake_isr.base, #funAddr~nvt_cir_wake_isr.offset;~ldv_2_callback_remove~0.base, ~ldv_2_callback_remove~0.offset := #funAddr~nvt_remove.base, #funAddr~nvt_remove.offset;~ldv_8_exit_nvt_exit_default~0.base, ~ldv_8_exit_nvt_exit_default~0.offset := #funAddr~nvt_exit.base, #funAddr~nvt_exit.offset;~ldv_8_init_nvt_init_default~0.base, ~ldv_8_init_nvt_init_default~0.offset := #funAddr~nvt_init.base, #funAddr~nvt_init.offset;~ldv_spin_alloc_lock_of_task_struct~0 := 1;~ldv_spin_i_lock_of_inode~0 := 1;~ldv_spin_lock~0 := 1;~ldv_spin_lock_of_NOT_ARG_SIGN~0 := 1;~ldv_spin_node_size_lock_of_pglist_data~0 := 1;~ldv_spin_nvt_lock_of_nvt_dev~0 := 1;~ldv_spin_ptl~0 := 1;~ldv_spin_siglock_of_sighand_struct~0 := 1; {13331#true} is VALID [2022-02-20 22:46:01,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {13331#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret360#1, main_~tmp~29#1;havoc main_~tmp~29#1;assume { :begin_inline_ldv_initialize } true; {13331#true} is VALID [2022-02-20 22:46:01,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {13331#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_initialize_external_data } true;assume { :begin_inline_ldv_allocate_external_0 } true;havoc ldv_allocate_external_0_#t~ret347#1.base, ldv_allocate_external_0_#t~ret347#1.offset, ldv_allocate_external_0_#t~ret348#1.base, ldv_allocate_external_0_#t~ret348#1.offset, ldv_allocate_external_0_#t~ret349#1.base, ldv_allocate_external_0_#t~ret349#1.offset; {13331#true} is VALID [2022-02-20 22:46:01,144 INFO L272 TraceCheckUtils]: 3: Hoare triple {13331#true} call ldv_allocate_external_0_#t~ret347#1.base, ldv_allocate_external_0_#t~ret347#1.offset := ldv_malloc(0); {13371#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:46:01,145 INFO L290 TraceCheckUtils]: 4: Hoare triple {13371#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~4.base, ~res~4.offset;havoc ~tmp~50.base, ~tmp~50.offset;havoc ~tmp___0~16;havoc ~tmp___1~6; {13331#true} is VALID [2022-02-20 22:46:01,145 INFO L272 TraceCheckUtils]: 5: Hoare triple {13331#true} call #t~ret426 := ldv_undef_int(); {13331#true} is VALID [2022-02-20 22:46:01,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {13331#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {13331#true} is VALID [2022-02-20 22:46:01,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {13331#true} assume true; {13331#true} is VALID [2022-02-20 22:46:01,145 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {13331#true} {13331#true} #1936#return; {13331#true} is VALID [2022-02-20 22:46:01,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {13331#true} assume -2147483648 <= #t~ret426 && #t~ret426 <= 2147483647;~tmp___1~6 := #t~ret426;havoc #t~ret426; {13331#true} is VALID [2022-02-20 22:46:01,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {13331#true} assume !(0 != ~tmp___1~6);#res.base, #res.offset := 0, 0; {13331#true} is VALID [2022-02-20 22:46:01,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {13331#true} assume true; {13331#true} is VALID [2022-02-20 22:46:01,146 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13331#true} {13331#true} #2106#return; {13331#true} is VALID [2022-02-20 22:46:01,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {13331#true} ~ldv_0_data_data~0.base, ~ldv_0_data_data~0.offset := ldv_allocate_external_0_#t~ret347#1.base, ldv_allocate_external_0_#t~ret347#1.offset;havoc ldv_allocate_external_0_#t~ret347#1.base, ldv_allocate_external_0_#t~ret347#1.offset;~ldv_0_thread_thread~0.base, ~ldv_0_thread_thread~0.offset := 0, 0; {13331#true} is VALID [2022-02-20 22:46:01,147 INFO L272 TraceCheckUtils]: 14: Hoare triple {13331#true} call ldv_allocate_external_0_#t~ret348#1.base, ldv_allocate_external_0_#t~ret348#1.offset := ldv_malloc(0); {13371#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:46:01,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {13371#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~4.base, ~res~4.offset;havoc ~tmp~50.base, ~tmp~50.offset;havoc ~tmp___0~16;havoc ~tmp___1~6; {13331#true} is VALID [2022-02-20 22:46:01,147 INFO L272 TraceCheckUtils]: 16: Hoare triple {13331#true} call #t~ret426 := ldv_undef_int(); {13331#true} is VALID [2022-02-20 22:46:01,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {13331#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {13331#true} is VALID [2022-02-20 22:46:01,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {13331#true} assume true; {13331#true} is VALID [2022-02-20 22:46:01,148 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {13331#true} {13331#true} #1936#return; {13331#true} is VALID [2022-02-20 22:46:01,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {13331#true} assume -2147483648 <= #t~ret426 && #t~ret426 <= 2147483647;~tmp___1~6 := #t~ret426;havoc #t~ret426; {13331#true} is VALID [2022-02-20 22:46:01,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {13331#true} assume !(0 != ~tmp___1~6);#res.base, #res.offset := 0, 0; {13331#true} is VALID [2022-02-20 22:46:01,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {13331#true} assume true; {13331#true} is VALID [2022-02-20 22:46:01,149 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13331#true} {13331#true} #2108#return; {13331#true} is VALID [2022-02-20 22:46:01,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {13331#true} ~ldv_1_data_data~0.base, ~ldv_1_data_data~0.offset := ldv_allocate_external_0_#t~ret348#1.base, ldv_allocate_external_0_#t~ret348#1.offset;havoc ldv_allocate_external_0_#t~ret348#1.base, ldv_allocate_external_0_#t~ret348#1.offset;~ldv_1_thread_thread~0.base, ~ldv_1_thread_thread~0.offset := 0, 0; {13331#true} is VALID [2022-02-20 22:46:01,149 INFO L272 TraceCheckUtils]: 25: Hoare triple {13331#true} call ldv_allocate_external_0_#t~ret349#1.base, ldv_allocate_external_0_#t~ret349#1.offset := ldv_malloc(1598); {13371#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:46:01,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {13371#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~4.base, ~res~4.offset;havoc ~tmp~50.base, ~tmp~50.offset;havoc ~tmp___0~16;havoc ~tmp___1~6; {13331#true} is VALID [2022-02-20 22:46:01,150 INFO L272 TraceCheckUtils]: 27: Hoare triple {13331#true} call #t~ret426 := ldv_undef_int(); {13331#true} is VALID [2022-02-20 22:46:01,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {13331#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {13331#true} is VALID [2022-02-20 22:46:01,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {13331#true} assume true; {13331#true} is VALID [2022-02-20 22:46:01,150 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {13331#true} {13331#true} #1936#return; {13331#true} is VALID [2022-02-20 22:46:01,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {13331#true} assume -2147483648 <= #t~ret426 && #t~ret426 <= 2147483647;~tmp___1~6 := #t~ret426;havoc #t~ret426; {13331#true} is VALID [2022-02-20 22:46:01,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {13331#true} assume !(0 != ~tmp___1~6);#res.base, #res.offset := 0, 0; {13331#true} is VALID [2022-02-20 22:46:01,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {13331#true} assume true; {13331#true} is VALID [2022-02-20 22:46:01,151 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13331#true} {13331#true} #2110#return; {13331#true} is VALID [2022-02-20 22:46:01,151 INFO L290 TraceCheckUtils]: 35: Hoare triple {13331#true} ~ldv_2_resource_struct_pnp_dev_ptr~0.base, ~ldv_2_resource_struct_pnp_dev_ptr~0.offset := ldv_allocate_external_0_#t~ret349#1.base, ldv_allocate_external_0_#t~ret349#1.offset;havoc ldv_allocate_external_0_#t~ret349#1.base, ldv_allocate_external_0_#t~ret349#1.offset; {13331#true} is VALID [2022-02-20 22:46:01,151 INFO L290 TraceCheckUtils]: 36: Hoare triple {13331#true} assume { :end_inline_ldv_allocate_external_0 } true; {13331#true} is VALID [2022-02-20 22:46:01,152 INFO L290 TraceCheckUtils]: 37: Hoare triple {13331#true} assume { :end_inline_ldv_initialize_external_data } true;~ldv_statevar_8~0 := 7;~ldv_statevar_0~0 := 6;~ldv_statevar_1~0 := 6;~ldv_2_ret_default~0 := 1;~ldv_statevar_2~0 := 19; {13360#(= 19 ~ldv_statevar_2~0)} is VALID [2022-02-20 22:46:01,152 INFO L272 TraceCheckUtils]: 38: Hoare triple {13360#(= 19 ~ldv_statevar_2~0)} call main_#t~ret360#1 := ldv_undef_int(); {13331#true} is VALID [2022-02-20 22:46:01,152 INFO L290 TraceCheckUtils]: 39: Hoare triple {13331#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {13331#true} is VALID [2022-02-20 22:46:01,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {13331#true} assume true; {13331#true} is VALID [2022-02-20 22:46:01,153 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13331#true} {13360#(= 19 ~ldv_statevar_2~0)} #2112#return; {13360#(= 19 ~ldv_statevar_2~0)} is VALID [2022-02-20 22:46:01,153 INFO L290 TraceCheckUtils]: 42: Hoare triple {13360#(= 19 ~ldv_statevar_2~0)} assume -2147483648 <= main_#t~ret360#1 && main_#t~ret360#1 <= 2147483647;main_~tmp~29#1 := main_#t~ret360#1;havoc main_#t~ret360#1; {13360#(= 19 ~ldv_statevar_2~0)} is VALID [2022-02-20 22:46:01,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {13360#(= 19 ~ldv_statevar_2~0)} assume !(0 == main_~tmp~29#1); {13360#(= 19 ~ldv_statevar_2~0)} is VALID [2022-02-20 22:46:01,154 INFO L290 TraceCheckUtils]: 44: Hoare triple {13360#(= 19 ~ldv_statevar_2~0)} assume !(1 == main_~tmp~29#1); {13360#(= 19 ~ldv_statevar_2~0)} is VALID [2022-02-20 22:46:01,154 INFO L290 TraceCheckUtils]: 45: Hoare triple {13360#(= 19 ~ldv_statevar_2~0)} assume !(2 == main_~tmp~29#1); {13360#(= 19 ~ldv_statevar_2~0)} is VALID [2022-02-20 22:46:01,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {13360#(= 19 ~ldv_statevar_2~0)} assume 3 == main_~tmp~29#1; {13360#(= 19 ~ldv_statevar_2~0)} is VALID [2022-02-20 22:46:01,155 INFO L290 TraceCheckUtils]: 47: Hoare triple {13360#(= 19 ~ldv_statevar_2~0)} assume { :begin_inline_ldv_struct_pnp_driver_base_instance_2 } true;ldv_struct_pnp_driver_base_instance_2_#in~arg0#1.base, ldv_struct_pnp_driver_base_instance_2_#in~arg0#1.offset := 0, 0;havoc ldv_struct_pnp_driver_base_instance_2_#t~ret375#1, ldv_struct_pnp_driver_base_instance_2_#t~mem376#1.base, ldv_struct_pnp_driver_base_instance_2_#t~mem376#1.offset, ldv_struct_pnp_driver_base_instance_2_#t~ret377#1, ldv_struct_pnp_driver_base_instance_2_#t~ret378#1, ldv_struct_pnp_driver_base_instance_2_#t~mem379#1.base, ldv_struct_pnp_driver_base_instance_2_#t~mem379#1.offset, ldv_struct_pnp_driver_base_instance_2_#t~mem380#1.base, ldv_struct_pnp_driver_base_instance_2_#t~mem380#1.offset, ldv_struct_pnp_driver_base_instance_2_#t~mem381#1, ldv_struct_pnp_driver_base_instance_2_#t~ret382#1, ldv_struct_pnp_driver_base_instance_2_#t~ret383#1, ldv_struct_pnp_driver_base_instance_2_#t~ret384#1, ldv_struct_pnp_driver_base_instance_2_#t~ret385#1, ldv_struct_pnp_driver_base_instance_2_#t~ret386#1, ldv_struct_pnp_driver_base_instance_2_#t~ret387#1, ldv_struct_pnp_driver_base_instance_2_#t~mem388#1.base, ldv_struct_pnp_driver_base_instance_2_#t~mem388#1.offset, ldv_struct_pnp_driver_base_instance_2_#t~ret389#1, ldv_struct_pnp_driver_base_instance_2_#t~ret390#1, ldv_struct_pnp_driver_base_instance_2_#t~ret391#1, ldv_struct_pnp_driver_base_instance_2_#t~ret392#1.base, ldv_struct_pnp_driver_base_instance_2_#t~ret392#1.offset, ldv_struct_pnp_driver_base_instance_2_#t~ret393#1.base, ldv_struct_pnp_driver_base_instance_2_#t~ret393#1.offset, ldv_struct_pnp_driver_base_instance_2_#t~ret394#1, ldv_struct_pnp_driver_base_instance_2_~arg0#1.base, ldv_struct_pnp_driver_base_instance_2_~arg0#1.offset, ldv_struct_pnp_driver_base_instance_2_~tmp~36#1, ldv_struct_pnp_driver_base_instance_2_~tmp___0~11#1, ldv_struct_pnp_driver_base_instance_2_~tmp___1~5#1, ldv_struct_pnp_driver_base_instance_2_~tmp___2~3#1, ldv_struct_pnp_driver_base_instance_2_~tmp___3~3#1.base, ldv_struct_pnp_driver_base_instance_2_~tmp___3~3#1.offset, ldv_struct_pnp_driver_base_instance_2_~tmp___4~3#1.base, ldv_struct_pnp_driver_base_instance_2_~tmp___4~3#1.offset, ldv_struct_pnp_driver_base_instance_2_~tmp___5~3#1;ldv_struct_pnp_driver_base_instance_2_~arg0#1.base, ldv_struct_pnp_driver_base_instance_2_~arg0#1.offset := ldv_struct_pnp_driver_base_instance_2_#in~arg0#1.base, ldv_struct_pnp_driver_base_instance_2_#in~arg0#1.offset;havoc ldv_struct_pnp_driver_base_instance_2_~tmp~36#1;havoc ldv_struct_pnp_driver_base_instance_2_~tmp___0~11#1;havoc ldv_struct_pnp_driver_base_instance_2_~tmp___1~5#1;havoc ldv_struct_pnp_driver_base_instance_2_~tmp___2~3#1;havoc ldv_struct_pnp_driver_base_instance_2_~tmp___3~3#1.base, ldv_struct_pnp_driver_base_instance_2_~tmp___3~3#1.offset;havoc ldv_struct_pnp_driver_base_instance_2_~tmp___4~3#1.base, ldv_struct_pnp_driver_base_instance_2_~tmp___4~3#1.offset;havoc ldv_struct_pnp_driver_base_instance_2_~tmp___5~3#1; {13360#(= 19 ~ldv_statevar_2~0)} is VALID [2022-02-20 22:46:01,156 INFO L290 TraceCheckUtils]: 48: Hoare triple {13360#(= 19 ~ldv_statevar_2~0)} assume !(1 == ~ldv_statevar_2~0); {13360#(= 19 ~ldv_statevar_2~0)} is VALID [2022-02-20 22:46:01,156 INFO L290 TraceCheckUtils]: 49: Hoare triple {13360#(= 19 ~ldv_statevar_2~0)} assume !(2 == ~ldv_statevar_2~0); {13360#(= 19 ~ldv_statevar_2~0)} is VALID [2022-02-20 22:46:01,156 INFO L290 TraceCheckUtils]: 50: Hoare triple {13360#(= 19 ~ldv_statevar_2~0)} assume !(3 == ~ldv_statevar_2~0); {13360#(= 19 ~ldv_statevar_2~0)} is VALID [2022-02-20 22:46:01,157 INFO L290 TraceCheckUtils]: 51: Hoare triple {13360#(= 19 ~ldv_statevar_2~0)} assume !(4 == ~ldv_statevar_2~0); {13360#(= 19 ~ldv_statevar_2~0)} is VALID [2022-02-20 22:46:01,157 INFO L290 TraceCheckUtils]: 52: Hoare triple {13360#(= 19 ~ldv_statevar_2~0)} assume !(6 == ~ldv_statevar_2~0); {13360#(= 19 ~ldv_statevar_2~0)} is VALID [2022-02-20 22:46:01,158 INFO L290 TraceCheckUtils]: 53: Hoare triple {13360#(= 19 ~ldv_statevar_2~0)} assume 7 == ~ldv_statevar_2~0; {13332#false} is VALID [2022-02-20 22:46:01,158 INFO L290 TraceCheckUtils]: 54: Hoare triple {13332#false} call ldv_struct_pnp_driver_base_instance_2_#t~mem380#1.base, ldv_struct_pnp_driver_base_instance_2_#t~mem380#1.offset := read~$Pointer$(~ldv_2_container_struct_pnp_driver~0.base, 44 + ~ldv_2_container_struct_pnp_driver~0.offset, 8);call ldv_struct_pnp_driver_base_instance_2_#t~mem381#1 := read~int(~#ldv_2_resource_struct_pm_message~0.base, ~#ldv_2_resource_struct_pm_message~0.offset, 4);assume { :begin_inline_ldv_base_instance_suspend_2_7 } true;ldv_base_instance_suspend_2_7_#in~arg0#1.base, ldv_base_instance_suspend_2_7_#in~arg0#1.offset, ldv_base_instance_suspend_2_7_#in~arg1#1.base, ldv_base_instance_suspend_2_7_#in~arg1#1.offset, ldv_base_instance_suspend_2_7_#in~arg2#1.event := ldv_struct_pnp_driver_base_instance_2_#t~mem380#1.base, ldv_struct_pnp_driver_base_instance_2_#t~mem380#1.offset, ~ldv_2_resource_struct_pnp_dev_ptr~0.base, ~ldv_2_resource_struct_pnp_dev_ptr~0.offset, ldv_struct_pnp_driver_base_instance_2_#t~mem381#1;havoc ldv_base_instance_suspend_2_7_#res#1;havoc ldv_base_instance_suspend_2_7_#t~mem352#1, ldv_base_instance_suspend_2_7_#t~ret353#1, ldv_base_instance_suspend_2_7_~arg0#1.base, ldv_base_instance_suspend_2_7_~arg0#1.offset, ldv_base_instance_suspend_2_7_~arg1#1.base, ldv_base_instance_suspend_2_7_~arg1#1.offset, ldv_base_instance_suspend_2_7_~#arg2#1.base, ldv_base_instance_suspend_2_7_~#arg2#1.offset, ldv_base_instance_suspend_2_7_~tmp~24#1;ldv_base_instance_suspend_2_7_~arg0#1.base, ldv_base_instance_suspend_2_7_~arg0#1.offset := ldv_base_instance_suspend_2_7_#in~arg0#1.base, ldv_base_instance_suspend_2_7_#in~arg0#1.offset;ldv_base_instance_suspend_2_7_~arg1#1.base, ldv_base_instance_suspend_2_7_~arg1#1.offset := ldv_base_instance_suspend_2_7_#in~arg1#1.base, ldv_base_instance_suspend_2_7_#in~arg1#1.offset;call ldv_base_instance_suspend_2_7_~#arg2#1.base, ldv_base_instance_suspend_2_7_~#arg2#1.offset := #Ultimate.allocOnStack(4);call write~int(ldv_base_instance_suspend_2_7_#in~arg2#1.event, ldv_base_instance_suspend_2_7_~#arg2#1.base, ldv_base_instance_suspend_2_7_~#arg2#1.offset, 4);havoc ldv_base_instance_suspend_2_7_~tmp~24#1;call ldv_base_instance_suspend_2_7_#t~mem352#1 := read~int(ldv_base_instance_suspend_2_7_~#arg2#1.base, ldv_base_instance_suspend_2_7_~#arg2#1.offset, 4);assume { :begin_inline_nvt_suspend } true;nvt_suspend_#in~pdev#1.base, nvt_suspend_#in~pdev#1.offset, nvt_suspend_#in~state#1.event := ldv_base_instance_suspend_2_7_~arg1#1.base, ldv_base_instance_suspend_2_7_~arg1#1.offset, ldv_base_instance_suspend_2_7_#t~mem352#1;havoc nvt_suspend_#res#1;havoc nvt_suspend_#t~ret340#1.base, nvt_suspend_#t~ret340#1.offset, nvt_suspend_#t~nondet341#1, nvt_suspend_~pdev#1.base, nvt_suspend_~pdev#1.offset, nvt_suspend_~state#1.event, nvt_suspend_~nvt~8#1.base, nvt_suspend_~nvt~8#1.offset, nvt_suspend_~tmp~18#1.base, nvt_suspend_~tmp~18#1.offset, nvt_suspend_~flags~9#1;nvt_suspend_~pdev#1.base, nvt_suspend_~pdev#1.offset := nvt_suspend_#in~pdev#1.base, nvt_suspend_#in~pdev#1.offset;nvt_suspend_~state#1.event := nvt_suspend_#in~state#1.event;havoc nvt_suspend_~nvt~8#1.base, nvt_suspend_~nvt~8#1.offset;havoc nvt_suspend_~tmp~18#1.base, nvt_suspend_~tmp~18#1.offset;havoc nvt_suspend_~flags~9#1; {13332#false} is VALID [2022-02-20 22:46:01,158 INFO L272 TraceCheckUtils]: 55: Hoare triple {13332#false} call nvt_suspend_#t~ret340#1.base, nvt_suspend_#t~ret340#1.offset := pnp_get_drvdata(nvt_suspend_~pdev#1.base, nvt_suspend_~pdev#1.offset); {13331#true} is VALID [2022-02-20 22:46:01,158 INFO L290 TraceCheckUtils]: 56: Hoare triple {13331#true} ~pdev#1.base, ~pdev#1.offset := #in~pdev#1.base, #in~pdev#1.offset;havoc ~tmp~6#1.base, ~tmp~6#1.offset;assume { :begin_inline_ldv_dev_get_drvdata_25 } true;ldv_dev_get_drvdata_25_#in~dev#1.base, ldv_dev_get_drvdata_25_#in~dev#1.offset := ~pdev#1.base, ~pdev#1.offset;havoc ldv_dev_get_drvdata_25_#res#1.base, ldv_dev_get_drvdata_25_#res#1.offset;havoc ldv_dev_get_drvdata_25_#t~ret396#1.base, ldv_dev_get_drvdata_25_#t~ret396#1.offset, ldv_dev_get_drvdata_25_~dev#1.base, ldv_dev_get_drvdata_25_~dev#1.offset, ldv_dev_get_drvdata_25_~tmp~38#1.base, ldv_dev_get_drvdata_25_~tmp~38#1.offset;ldv_dev_get_drvdata_25_~dev#1.base, ldv_dev_get_drvdata_25_~dev#1.offset := ldv_dev_get_drvdata_25_#in~dev#1.base, ldv_dev_get_drvdata_25_#in~dev#1.offset;havoc ldv_dev_get_drvdata_25_~tmp~38#1.base, ldv_dev_get_drvdata_25_~tmp~38#1.offset;assume { :begin_inline_ldv_dev_get_drvdata } true;ldv_dev_get_drvdata_#in~dev#1.base, ldv_dev_get_drvdata_#in~dev#1.offset := ldv_dev_get_drvdata_25_~dev#1.base, ldv_dev_get_drvdata_25_~dev#1.offset;havoc ldv_dev_get_drvdata_#res#1.base, ldv_dev_get_drvdata_#res#1.offset;havoc ldv_dev_get_drvdata_#t~mem405#1.base, ldv_dev_get_drvdata_#t~mem405#1.offset, ldv_dev_get_drvdata_#t~short406#1, ldv_dev_get_drvdata_#t~mem407#1.base, ldv_dev_get_drvdata_#t~mem407#1.offset, ldv_dev_get_drvdata_#t~mem408#1.base, ldv_dev_get_drvdata_#t~mem408#1.offset, ldv_dev_get_drvdata_~dev#1.base, ldv_dev_get_drvdata_~dev#1.offset;ldv_dev_get_drvdata_~dev#1.base, ldv_dev_get_drvdata_~dev#1.offset := ldv_dev_get_drvdata_#in~dev#1.base, ldv_dev_get_drvdata_#in~dev#1.offset;ldv_dev_get_drvdata_#t~short406#1 := 0 != (ldv_dev_get_drvdata_~dev#1.base + ldv_dev_get_drvdata_~dev#1.offset) % 18446744073709551616; {13331#true} is VALID [2022-02-20 22:46:01,159 INFO L290 TraceCheckUtils]: 57: Hoare triple {13331#true} assume ldv_dev_get_drvdata_#t~short406#1;call ldv_dev_get_drvdata_#t~mem405#1.base, ldv_dev_get_drvdata_#t~mem405#1.offset := read~$Pointer$(ldv_dev_get_drvdata_~dev#1.base, 8 + ldv_dev_get_drvdata_~dev#1.offset, 8);ldv_dev_get_drvdata_#t~short406#1 := 0 != (ldv_dev_get_drvdata_#t~mem405#1.base + ldv_dev_get_drvdata_#t~mem405#1.offset) % 18446744073709551616; {13331#true} is VALID [2022-02-20 22:46:01,159 INFO L290 TraceCheckUtils]: 58: Hoare triple {13331#true} assume ldv_dev_get_drvdata_#t~short406#1;havoc ldv_dev_get_drvdata_#t~mem405#1.base, ldv_dev_get_drvdata_#t~mem405#1.offset;havoc ldv_dev_get_drvdata_#t~short406#1;call ldv_dev_get_drvdata_#t~mem407#1.base, ldv_dev_get_drvdata_#t~mem407#1.offset := read~$Pointer$(ldv_dev_get_drvdata_~dev#1.base, 8 + ldv_dev_get_drvdata_~dev#1.offset, 8);call ldv_dev_get_drvdata_#t~mem408#1.base, ldv_dev_get_drvdata_#t~mem408#1.offset := read~$Pointer$(ldv_dev_get_drvdata_#t~mem407#1.base, ldv_dev_get_drvdata_#t~mem407#1.offset, 8);ldv_dev_get_drvdata_#res#1.base, ldv_dev_get_drvdata_#res#1.offset := ldv_dev_get_drvdata_#t~mem408#1.base, ldv_dev_get_drvdata_#t~mem408#1.offset;havoc ldv_dev_get_drvdata_#t~mem407#1.base, ldv_dev_get_drvdata_#t~mem407#1.offset;havoc ldv_dev_get_drvdata_#t~mem408#1.base, ldv_dev_get_drvdata_#t~mem408#1.offset; {13331#true} is VALID [2022-02-20 22:46:01,159 INFO L290 TraceCheckUtils]: 59: Hoare triple {13331#true} ldv_dev_get_drvdata_25_#t~ret396#1.base, ldv_dev_get_drvdata_25_#t~ret396#1.offset := ldv_dev_get_drvdata_#res#1.base, ldv_dev_get_drvdata_#res#1.offset;assume { :end_inline_ldv_dev_get_drvdata } true;ldv_dev_get_drvdata_25_~tmp~38#1.base, ldv_dev_get_drvdata_25_~tmp~38#1.offset := ldv_dev_get_drvdata_25_#t~ret396#1.base, ldv_dev_get_drvdata_25_#t~ret396#1.offset;havoc ldv_dev_get_drvdata_25_#t~ret396#1.base, ldv_dev_get_drvdata_25_#t~ret396#1.offset;ldv_dev_get_drvdata_25_#res#1.base, ldv_dev_get_drvdata_25_#res#1.offset := ldv_dev_get_drvdata_25_~tmp~38#1.base, ldv_dev_get_drvdata_25_~tmp~38#1.offset; {13331#true} is VALID [2022-02-20 22:46:01,159 INFO L290 TraceCheckUtils]: 60: Hoare triple {13331#true} #t~ret61#1.base, #t~ret61#1.offset := ldv_dev_get_drvdata_25_#res#1.base, ldv_dev_get_drvdata_25_#res#1.offset;assume { :end_inline_ldv_dev_get_drvdata_25 } true;~tmp~6#1.base, ~tmp~6#1.offset := #t~ret61#1.base, #t~ret61#1.offset;havoc #t~ret61#1.base, #t~ret61#1.offset;#res#1.base, #res#1.offset := ~tmp~6#1.base, ~tmp~6#1.offset; {13331#true} is VALID [2022-02-20 22:46:01,159 INFO L290 TraceCheckUtils]: 61: Hoare triple {13331#true} assume true; {13331#true} is VALID [2022-02-20 22:46:01,159 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {13331#true} {13332#false} #2270#return; {13332#false} is VALID [2022-02-20 22:46:01,160 INFO L290 TraceCheckUtils]: 63: Hoare triple {13332#false} nvt_suspend_~tmp~18#1.base, nvt_suspend_~tmp~18#1.offset := nvt_suspend_#t~ret340#1.base, nvt_suspend_#t~ret340#1.offset;havoc nvt_suspend_#t~ret340#1.base, nvt_suspend_#t~ret340#1.offset;nvt_suspend_~nvt~8#1.base, nvt_suspend_~nvt~8#1.offset := nvt_suspend_~tmp~18#1.base, nvt_suspend_~tmp~18#1.offset; {13332#false} is VALID [2022-02-20 22:46:01,160 INFO L290 TraceCheckUtils]: 64: Hoare triple {13332#false} assume 0 != ~debug~0;havoc nvt_suspend_#t~nondet341#1; {13332#false} is VALID [2022-02-20 22:46:01,160 INFO L290 TraceCheckUtils]: 65: Hoare triple {13332#false} assume { :begin_inline_ldv___ldv_spin_lock_73 } true;ldv___ldv_spin_lock_73_#in~ldv_func_arg1#1.base, ldv___ldv_spin_lock_73_#in~ldv_func_arg1#1.offset := nvt_suspend_~nvt~8#1.base, 16 + nvt_suspend_~nvt~8#1.offset;havoc ldv___ldv_spin_lock_73_~ldv_func_arg1#1.base, ldv___ldv_spin_lock_73_~ldv_func_arg1#1.offset;ldv___ldv_spin_lock_73_~ldv_func_arg1#1.base, ldv___ldv_spin_lock_73_~ldv_func_arg1#1.offset := ldv___ldv_spin_lock_73_#in~ldv_func_arg1#1.base, ldv___ldv_spin_lock_73_#in~ldv_func_arg1#1.offset; {13332#false} is VALID [2022-02-20 22:46:01,160 INFO L272 TraceCheckUtils]: 66: Hoare triple {13332#false} call ldv_spin_lock_nvt_lock_of_nvt_dev(); {13332#false} is VALID [2022-02-20 22:46:01,160 INFO L272 TraceCheckUtils]: 67: Hoare triple {13332#false} call ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock((if 1 == ~ldv_spin_nvt_lock_of_nvt_dev~0 then 1 else 0)); {13332#false} is VALID [2022-02-20 22:46:01,161 INFO L290 TraceCheckUtils]: 68: Hoare triple {13332#false} ~expr := #in~expr; {13332#false} is VALID [2022-02-20 22:46:01,161 INFO L290 TraceCheckUtils]: 69: Hoare triple {13332#false} assume 0 == ~expr; {13332#false} is VALID [2022-02-20 22:46:01,161 INFO L290 TraceCheckUtils]: 70: Hoare triple {13332#false} assume !false; {13332#false} is VALID [2022-02-20 22:46:01,161 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-02-20 22:46:01,162 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:46:01,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143779285] [2022-02-20 22:46:01,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143779285] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:46:01,162 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:46:01,162 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 22:46:01,162 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599367837] [2022-02-20 22:46:01,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:46:01,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 71 [2022-02-20 22:46:01,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:46:01,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 22:46:01,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:46:01,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 22:46:01,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:46:01,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 22:46:01,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 22:46:01,222 INFO L87 Difference]: Start difference. First operand 2055 states and 2896 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 22:46:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:46:14,240 INFO L93 Difference]: Finished difference Result 3950 states and 5567 transitions. [2022-02-20 22:46:14,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 22:46:14,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 71 [2022-02-20 22:46:14,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:46:14,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 22:46:14,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3634 transitions. [2022-02-20 22:46:14,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 22:46:14,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3634 transitions. [2022-02-20 22:46:14,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 3634 transitions. [2022-02-20 22:46:17,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3634 edges. 3634 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:46:17,653 INFO L225 Difference]: With dead ends: 3950 [2022-02-20 22:46:17,653 INFO L226 Difference]: Without dead ends: 1906 [2022-02-20 22:46:17,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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:46:17,662 INFO L933 BasicCegarLoop]: 1477 mSDtfsCounter, 747 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 615 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 615 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 22:46:17,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [928 Valid, 2818 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [615 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 22:46:17,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2022-02-20 22:46:17,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1829. [2022-02-20 22:46:17,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:46:17,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1906 states. Second operand has 1829 states, 1140 states have (on average 1.2578947368421052) internal successors, (1434), 1178 states have internal predecessors, (1434), 555 states have call successors, (555), 132 states have call predecessors, (555), 131 states have return successors, (552), 548 states have call predecessors, (552), 552 states have call successors, (552) [2022-02-20 22:46:17,750 INFO L74 IsIncluded]: Start isIncluded. First operand 1906 states. Second operand has 1829 states, 1140 states have (on average 1.2578947368421052) internal successors, (1434), 1178 states have internal predecessors, (1434), 555 states have call successors, (555), 132 states have call predecessors, (555), 131 states have return successors, (552), 548 states have call predecessors, (552), 552 states have call successors, (552) [2022-02-20 22:46:17,757 INFO L87 Difference]: Start difference. First operand 1906 states. Second operand has 1829 states, 1140 states have (on average 1.2578947368421052) internal successors, (1434), 1178 states have internal predecessors, (1434), 555 states have call successors, (555), 132 states have call predecessors, (555), 131 states have return successors, (552), 548 states have call predecessors, (552), 552 states have call successors, (552) [2022-02-20 22:46:17,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:46:17,885 INFO L93 Difference]: Finished difference Result 1906 states and 2657 transitions. [2022-02-20 22:46:17,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2657 transitions. [2022-02-20 22:46:17,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:46:17,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:46:17,902 INFO L74 IsIncluded]: Start isIncluded. First operand has 1829 states, 1140 states have (on average 1.2578947368421052) internal successors, (1434), 1178 states have internal predecessors, (1434), 555 states have call successors, (555), 132 states have call predecessors, (555), 131 states have return successors, (552), 548 states have call predecessors, (552), 552 states have call successors, (552) Second operand 1906 states. [2022-02-20 22:46:17,909 INFO L87 Difference]: Start difference. First operand has 1829 states, 1140 states have (on average 1.2578947368421052) internal successors, (1434), 1178 states have internal predecessors, (1434), 555 states have call successors, (555), 132 states have call predecessors, (555), 131 states have return successors, (552), 548 states have call predecessors, (552), 552 states have call successors, (552) Second operand 1906 states. [2022-02-20 22:46:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:46:18,043 INFO L93 Difference]: Finished difference Result 1906 states and 2657 transitions. [2022-02-20 22:46:18,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2657 transitions. [2022-02-20 22:46:18,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:46:18,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:46:18,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:46:18,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:46:18,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1140 states have (on average 1.2578947368421052) internal successors, (1434), 1178 states have internal predecessors, (1434), 555 states have call successors, (555), 132 states have call predecessors, (555), 131 states have return successors, (552), 548 states have call predecessors, (552), 552 states have call successors, (552) [2022-02-20 22:46:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2541 transitions. [2022-02-20 22:46:18,304 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2541 transitions. Word has length 71 [2022-02-20 22:46:18,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:46:18,304 INFO L470 AbstractCegarLoop]: Abstraction has 1829 states and 2541 transitions. [2022-02-20 22:46:18,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 22:46:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2541 transitions. [2022-02-20 22:46:18,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-02-20 22:46:18,307 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:46:18,308 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-02-20 22:46:18,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 22:46:18,308 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 22:46:18,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:46:18,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1262481058, now seen corresponding path program 1 times [2022-02-20 22:46:18,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:46:18,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749661341] [2022-02-20 22:46:18,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:46:18,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:46:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:18,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 22:46:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:18,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:46:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:18,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {25786#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {25786#true} is VALID [2022-02-20 22:46:18,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25786#true} {25786#true} #1936#return; {25786#true} is VALID [2022-02-20 22:46:18,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {25849#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~4.base, ~res~4.offset;havoc ~tmp~50.base, ~tmp~50.offset;havoc ~tmp___0~16;havoc ~tmp___1~6; {25786#true} is VALID [2022-02-20 22:46:18,520 INFO L272 TraceCheckUtils]: 1: Hoare triple {25786#true} call #t~ret426 := ldv_undef_int(); {25786#true} is VALID [2022-02-20 22:46:18,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {25786#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {25786#true} is VALID [2022-02-20 22:46:18,520 INFO L290 TraceCheckUtils]: 3: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,520 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25786#true} {25786#true} #1936#return; {25786#true} is VALID [2022-02-20 22:46:18,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {25786#true} assume -2147483648 <= #t~ret426 && #t~ret426 <= 2147483647;~tmp___1~6 := #t~ret426;havoc #t~ret426; {25786#true} is VALID [2022-02-20 22:46:18,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {25786#true} assume !(0 != ~tmp___1~6);#res.base, #res.offset := 0, 0; {25786#true} is VALID [2022-02-20 22:46:18,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,521 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {25786#true} {25786#true} #2106#return; {25786#true} is VALID [2022-02-20 22:46:18,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:46:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:18,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:46:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:18,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {25786#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {25786#true} is VALID [2022-02-20 22:46:18,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25786#true} {25786#true} #1936#return; {25786#true} is VALID [2022-02-20 22:46:18,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {25849#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~4.base, ~res~4.offset;havoc ~tmp~50.base, ~tmp~50.offset;havoc ~tmp___0~16;havoc ~tmp___1~6; {25786#true} is VALID [2022-02-20 22:46:18,546 INFO L272 TraceCheckUtils]: 1: Hoare triple {25786#true} call #t~ret426 := ldv_undef_int(); {25786#true} is VALID [2022-02-20 22:46:18,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {25786#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {25786#true} is VALID [2022-02-20 22:46:18,547 INFO L290 TraceCheckUtils]: 3: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,548 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25786#true} {25786#true} #1936#return; {25786#true} is VALID [2022-02-20 22:46:18,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {25786#true} assume -2147483648 <= #t~ret426 && #t~ret426 <= 2147483647;~tmp___1~6 := #t~ret426;havoc #t~ret426; {25786#true} is VALID [2022-02-20 22:46:18,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {25786#true} assume !(0 != ~tmp___1~6);#res.base, #res.offset := 0, 0; {25786#true} is VALID [2022-02-20 22:46:18,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,553 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {25786#true} {25786#true} #2108#return; {25786#true} is VALID [2022-02-20 22:46:18,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-20 22:46:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:18,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:46:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:18,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {25786#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {25786#true} is VALID [2022-02-20 22:46:18,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25786#true} {25786#true} #1936#return; {25786#true} is VALID [2022-02-20 22:46:18,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {25849#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~4.base, ~res~4.offset;havoc ~tmp~50.base, ~tmp~50.offset;havoc ~tmp___0~16;havoc ~tmp___1~6; {25786#true} is VALID [2022-02-20 22:46:18,578 INFO L272 TraceCheckUtils]: 1: Hoare triple {25786#true} call #t~ret426 := ldv_undef_int(); {25786#true} is VALID [2022-02-20 22:46:18,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {25786#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {25786#true} is VALID [2022-02-20 22:46:18,578 INFO L290 TraceCheckUtils]: 3: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,578 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {25786#true} {25786#true} #1936#return; {25786#true} is VALID [2022-02-20 22:46:18,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {25786#true} assume -2147483648 <= #t~ret426 && #t~ret426 <= 2147483647;~tmp___1~6 := #t~ret426;havoc #t~ret426; {25786#true} is VALID [2022-02-20 22:46:18,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {25786#true} assume !(0 != ~tmp___1~6);#res.base, #res.offset := 0, 0; {25786#true} is VALID [2022-02-20 22:46:18,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,583 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {25786#true} {25786#true} #2110#return; {25786#true} is VALID [2022-02-20 22:46:18,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 22:46:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:18,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {25786#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {25786#true} is VALID [2022-02-20 22:46:18,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,595 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25786#true} {25786#true} #2112#return; {25786#true} is VALID [2022-02-20 22:46:18,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 22:46:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:18,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {25786#true} ~expression := #in~expression; {25786#true} is VALID [2022-02-20 22:46:18,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {25786#true} assume !(0 == ~expression); {25786#true} is VALID [2022-02-20 22:46:18,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25786#true} {25786#true} #2130#return; {25786#true} is VALID [2022-02-20 22:46:18,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-20 22:46:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:18,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {25786#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {25786#true} is VALID [2022-02-20 22:46:18,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,622 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25786#true} {25786#true} #2132#return; {25786#true} is VALID [2022-02-20 22:46:18,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-02-20 22:46:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:18,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {25786#true} ~expression := #in~expression; {25786#true} is VALID [2022-02-20 22:46:18,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {25786#true} assume !(0 == ~expression); {25786#true} is VALID [2022-02-20 22:46:18,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25786#true} {25786#true} #2138#return; {25786#true} is VALID [2022-02-20 22:46:18,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-02-20 22:46:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:18,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:46:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:18,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {25786#true} ~expression := #in~expression; {25786#true} is VALID [2022-02-20 22:46:18,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {25786#true} assume !(0 == ~expression); {25786#true} is VALID [2022-02-20 22:46:18,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25786#true} {25786#true} #2036#return; {25786#true} is VALID [2022-02-20 22:46:18,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {25786#true} ~val := #in~val; {25786#true} is VALID [2022-02-20 22:46:18,662 INFO L272 TraceCheckUtils]: 1: Hoare triple {25786#true} call ldv_assume((if ~val <= 0 then 1 else 0)); {25786#true} is VALID [2022-02-20 22:46:18,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {25786#true} ~expression := #in~expression; {25786#true} is VALID [2022-02-20 22:46:18,662 INFO L290 TraceCheckUtils]: 3: Hoare triple {25786#true} assume !(0 == ~expression); {25786#true} is VALID [2022-02-20 22:46:18,663 INFO L290 TraceCheckUtils]: 4: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,663 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {25786#true} {25786#true} #2036#return; {25786#true} is VALID [2022-02-20 22:46:18,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {25786#true} #res := ~val; {25786#true} is VALID [2022-02-20 22:46:18,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,663 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {25786#true} {25786#true} #2140#return; {25786#true} is VALID [2022-02-20 22:46:18,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-02-20 22:46:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:18,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {25786#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {25786#true} is VALID [2022-02-20 22:46:18,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25786#true} {25786#true} #2142#return; {25786#true} is VALID [2022-02-20 22:46:18,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-02-20 22:46:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:18,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {25786#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {25786#true} is VALID [2022-02-20 22:46:18,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,682 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25786#true} {25841#(= ~ldv_statevar_8~0 4)} #2112#return; {25841#(= ~ldv_statevar_8~0 4)} is VALID [2022-02-20 22:46:18,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-02-20 22:46:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:46:18,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {25786#true} ~expression := #in~expression; {25786#true} is VALID [2022-02-20 22:46:18,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {25786#true} assume !(0 == ~expression); {25786#true} is VALID [2022-02-20 22:46:18,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25786#true} {25787#false} #2124#return; {25787#false} is VALID [2022-02-20 22:46:18,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {25786#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(54, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(41, 3);call #Ultimate.allocInit(41, 4);call #Ultimate.allocInit(41, 5);call #Ultimate.allocInit(39, 6);call #Ultimate.allocInit(12, 7);call #Ultimate.allocInit(34, 8);call #Ultimate.allocInit(34, 9);call #Ultimate.allocInit(34, 10);call #Ultimate.allocInit(34, 11);call #Ultimate.allocInit(34, 12);call #Ultimate.allocInit(34, 13);call #Ultimate.allocInit(34, 14);call #Ultimate.allocInit(34, 15);call #Ultimate.allocInit(34, 16);call #Ultimate.allocInit(34, 17);call #Ultimate.allocInit(34, 18);call #Ultimate.allocInit(34, 19);call #Ultimate.allocInit(34, 20);call #Ultimate.allocInit(34, 21);call #Ultimate.allocInit(34, 22);call #Ultimate.allocInit(34, 23);call #Ultimate.allocInit(59, 24);call #Ultimate.allocInit(12, 25);call #Ultimate.allocInit(46, 26);call #Ultimate.allocInit(46, 27);call #Ultimate.allocInit(46, 28);call #Ultimate.allocInit(43, 29);call #Ultimate.allocInit(12, 30);call #Ultimate.allocInit(39, 31);call #Ultimate.allocInit(39, 32);call #Ultimate.allocInit(39, 33);call #Ultimate.allocInit(39, 34);call #Ultimate.allocInit(39, 35);call #Ultimate.allocInit(39, 36);call #Ultimate.allocInit(39, 37);call #Ultimate.allocInit(39, 38);call #Ultimate.allocInit(39, 39);call #Ultimate.allocInit(39, 40);call #Ultimate.allocInit(39, 41);call #Ultimate.allocInit(39, 42);call #Ultimate.allocInit(39, 43);call #Ultimate.allocInit(41, 44);call #Ultimate.allocInit(39, 45);call #Ultimate.allocInit(39, 46);call #Ultimate.allocInit(47, 47);call #Ultimate.allocInit(12, 48);call #Ultimate.allocInit(27, 49);call #Ultimate.allocInit(6, 50);call write~init~int(32, 50, 0, 1);call write~init~int(37, 50, 1, 1);call write~init~int(48, 50, 2, 1);call write~init~int(50, 50, 3, 1);call write~init~int(120, 50, 4, 1);call write~init~int(0, 50, 5, 1);call #Ultimate.allocInit(2, 51);call write~init~int(10, 51, 0, 1);call write~init~int(0, 51, 1, 1);call #Ultimate.allocInit(9, 52);call #Ultimate.allocInit(9, 53);call #Ultimate.allocInit(11, 54);call #Ultimate.allocInit(9, 55);call #Ultimate.allocInit(70, 56);call #Ultimate.allocInit(42, 57);call #Ultimate.allocInit(69, 58);call #Ultimate.allocInit(74, 59);call #Ultimate.allocInit(34, 60);call #Ultimate.allocInit(15, 61);call #Ultimate.allocInit(16, 62);call #Ultimate.allocInit(8, 63);call #Ultimate.allocInit(2, 64);call write~init~int(10, 64, 0, 1);call write~init~int(0, 64, 1, 1);call #Ultimate.allocInit(25, 65);call #Ultimate.allocInit(23, 66);call #Ultimate.allocInit(43, 67);call #Ultimate.allocInit(43, 68);call #Ultimate.allocInit(6, 69);call write~init~int(112, 69, 0, 1);call write~init~int(117, 69, 1, 1);call write~init~int(108, 69, 2, 1);call write~init~int(115, 69, 3, 1);call write~init~int(101, 69, 4, 1);call write~init~int(0, 69, 5, 1);call #Ultimate.allocInit(6, 70);call write~init~int(115, 70, 0, 1);call write~init~int(112, 70, 1, 1);call write~init~int(97, 70, 2, 1);call write~init~int(99, 70, 3, 1);call write~init~int(101, 70, 4, 1);call write~init~int(0, 70, 5, 1);call #Ultimate.allocInit(57, 71);call #Ultimate.allocInit(59, 72);call #Ultimate.allocInit(23, 73);call #Ultimate.allocInit(23, 74);call #Ultimate.allocInit(55, 75);call #Ultimate.allocInit(60, 76);call #Ultimate.allocInit(31, 77);call #Ultimate.allocInit(19, 78);call #Ultimate.allocInit(59, 79);call #Ultimate.allocInit(5, 80);call write~init~int(32, 80, 0, 1);call write~init~int(82, 80, 1, 1);call write~init~int(68, 80, 2, 1);call write~init~int(82, 80, 3, 1);call write~init~int(0, 80, 4, 1);call #Ultimate.allocInit(1, 81);call write~init~int(0, 81, 0, 1);call #Ultimate.allocInit(5, 82);call write~init~int(32, 82, 0, 1);call write~init~int(82, 82, 1, 1);call write~init~int(84, 82, 2, 1);call write~init~int(82, 82, 3, 1);call write~init~int(0, 82, 4, 1);call #Ultimate.allocInit(1, 83);call write~init~int(0, 83, 0, 1);call #Ultimate.allocInit(4, 84);call write~init~int(32, 84, 0, 1);call write~init~int(80, 84, 1, 1);call write~init~int(69, 84, 2, 1);call write~init~int(0, 84, 3, 1);call #Ultimate.allocInit(1, 85);call write~init~int(0, 85, 0, 1);call #Ultimate.allocInit(5, 86);call write~init~int(32, 86, 0, 1);call write~init~int(82, 86, 1, 1);call write~init~int(70, 86, 2, 1);call write~init~int(79, 86, 3, 1);call write~init~int(0, 86, 4, 1);call #Ultimate.allocInit(1, 87);call write~init~int(0, 87, 0, 1);call #Ultimate.allocInit(4, 88);call write~init~int(32, 88, 0, 1);call write~init~int(84, 88, 1, 1);call write~init~int(69, 88, 2, 1);call write~init~int(0, 88, 3, 1);call #Ultimate.allocInit(1, 89);call write~init~int(0, 89, 0, 1);call #Ultimate.allocInit(5, 90);call write~init~int(32, 90, 0, 1);call write~init~int(84, 90, 1, 1);call write~init~int(84, 90, 2, 1);call write~init~int(82, 90, 3, 1);call write~init~int(0, 90, 4, 1);call #Ultimate.allocInit(1, 91);call write~init~int(0, 91, 0, 1);call #Ultimate.allocInit(5, 92);call write~init~int(32, 92, 0, 1);call write~init~int(84, 92, 1, 1);call write~init~int(70, 92, 2, 1);call write~init~int(85, 92, 3, 1);call write~init~int(0, 92, 4, 1);call #Ultimate.allocInit(1, 93);call write~init~int(0, 93, 0, 1);call #Ultimate.allocInit(4, 94);call write~init~int(32, 94, 0, 1);call write~init~int(71, 94, 1, 1);call write~init~int(72, 94, 2, 1);call write~init~int(0, 94, 3, 1);call #Ultimate.allocInit(1, 95);call write~init~int(0, 95, 0, 1);call #Ultimate.allocInit(3, 96);call write~init~int(32, 96, 0, 1);call write~init~int(63, 96, 1, 1);call write~init~int(0, 96, 2, 1);call #Ultimate.allocInit(1, 97);call write~init~int(0, 97, 0, 1);call #Ultimate.allocInit(25, 98);call #Ultimate.allocInit(12, 99);call #Ultimate.allocInit(37, 100);call #Ultimate.allocInit(12, 101);call #Ultimate.allocInit(43, 102);call #Ultimate.allocInit(12, 103);call #Ultimate.allocInit(23, 104);call #Ultimate.allocInit(12, 105);call #Ultimate.allocInit(25, 106);call #Ultimate.allocInit(17, 107);call #Ultimate.allocInit(44, 108);call #Ultimate.allocInit(17, 109);call #Ultimate.allocInit(41, 110);call #Ultimate.allocInit(23, 111);call #Ultimate.allocInit(17, 112);call #Ultimate.allocInit(24, 113);call #Ultimate.allocInit(24, 114);call #Ultimate.allocInit(20, 115);call #Ultimate.allocInit(26, 116);call #Ultimate.allocInit(26, 117);call #Ultimate.allocInit(25, 118);call #Ultimate.allocInit(24, 119);call #Ultimate.allocInit(15, 120);call #Ultimate.allocInit(45, 121);call #Ultimate.allocInit(13, 122);call #Ultimate.allocInit(12, 123);call #Ultimate.allocInit(11, 124);call #Ultimate.allocInit(12, 125);call #Ultimate.allocInit(12, 126);call #Ultimate.allocInit(12, 127);call #Ultimate.allocInit(12, 128);call #Ultimate.allocInit(51, 129);call #Ultimate.allocInit(25, 130);call #Ultimate.allocInit(12, 131);call #Ultimate.allocInit(25, 132);call #Ultimate.allocInit(11, 133);call #Ultimate.allocInit(12, 134);call #Ultimate.allocInit(1, 135);call write~init~int(0, 135, 0, 1);call #Ultimate.allocInit(2, 136);call write~init~int(48, 136, 0, 1);call write~init~int(0, 136, 1, 1);call #Ultimate.allocInit(88, 137);~debug~0 := 0;~#nvt_ids~0.base, ~#nvt_ids~0.offset := 138, 0;call #Ultimate.allocInit(48, 138);call write~init~int(87, ~#nvt_ids~0.base, ~#nvt_ids~0.offset, 1);call write~init~int(69, ~#nvt_ids~0.base, 1 + ~#nvt_ids~0.offset, 1);call write~init~int(67, ~#nvt_ids~0.base, 2 + ~#nvt_ids~0.offset, 1);call write~init~int(48, ~#nvt_ids~0.base, 3 + ~#nvt_ids~0.offset, 1);call write~init~int(53, ~#nvt_ids~0.base, 4 + ~#nvt_ids~0.offset, 1);call write~init~int(51, ~#nvt_ids~0.base, 5 + ~#nvt_ids~0.offset, 1);call write~init~int(48, ~#nvt_ids~0.base, 6 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 7 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 8 + ~#nvt_ids~0.offset, 8);call write~init~int(78, ~#nvt_ids~0.base, 16 + ~#nvt_ids~0.offset, 1);call write~init~int(84, ~#nvt_ids~0.base, 17 + ~#nvt_ids~0.offset, 1);call write~init~int(78, ~#nvt_ids~0.base, 18 + ~#nvt_ids~0.offset, 1);call write~init~int(48, ~#nvt_ids~0.base, 19 + ~#nvt_ids~0.offset, 1);call write~init~int(53, ~#nvt_ids~0.base, 20 + ~#nvt_ids~0.offset, 1);call write~init~int(51, ~#nvt_ids~0.base, 21 + ~#nvt_ids~0.offset, 1);call write~init~int(48, ~#nvt_ids~0.base, 22 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 23 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 24 + ~#nvt_ids~0.offset, 8);call write~init~int(0, ~#nvt_ids~0.base, 32 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 33 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 34 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 35 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 36 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 37 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 38 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 39 + ~#nvt_ids~0.offset, 1);call write~init~int(0, ~#nvt_ids~0.base, 40 + ~#nvt_ids~0.offset, 8);~#nvt_driver~0.base, ~#nvt_driver~0.offset := 139, 0;call #Ultimate.allocInit(173, 139);call write~init~$Pointer$(134, 0, ~#nvt_driver~0.base, ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(~#nvt_ids~0.base, ~#nvt_ids~0.offset, ~#nvt_driver~0.base, 8 + ~#nvt_driver~0.offset, 8);call write~init~int(1, ~#nvt_driver~0.base, 16 + ~#nvt_driver~0.offset, 4);call write~init~$Pointer$(#funAddr~nvt_probe.base, #funAddr~nvt_probe.offset, ~#nvt_driver~0.base, 20 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~nvt_remove.base, #funAddr~nvt_remove.offset, ~#nvt_driver~0.base, 28 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~nvt_shutdown.base, #funAddr~nvt_shutdown.offset, ~#nvt_driver~0.base, 36 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~nvt_suspend.base, #funAddr~nvt_suspend.offset, ~#nvt_driver~0.base, 44 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~nvt_resume.base, #funAddr~nvt_resume.offset, ~#nvt_driver~0.base, 52 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 60 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 68 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 76 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 84 + ~#nvt_driver~0.offset, 8);call write~init~int(0, ~#nvt_driver~0.base, 92 + ~#nvt_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 93 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 101 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 109 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 117 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 125 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 133 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 141 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 149 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 157 + ~#nvt_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#nvt_driver~0.base, 165 + ~#nvt_driver~0.offset, 8);~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[0 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[1 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[2 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[3 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[4 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[5 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[6 := 0];~__mod_pnp_device_table~0.id := ~__mod_pnp_device_table~0.id[7 := 0];~__mod_pnp_device_table~0.driver_data := 0;~ldv_0_data_data~0.base, ~ldv_0_data_data~0.offset := 0, 0;~ldv_0_line_line~0 := 0;~ldv_0_ret_val_default~0 := 0;~ldv_0_thread_thread~0.base, ~ldv_0_thread_thread~0.offset := 0, 0;~ldv_1_data_data~0.base, ~ldv_1_data_data~0.offset := 0, 0;~ldv_1_line_line~0 := 0;~ldv_1_ret_val_default~0 := 0;~ldv_1_thread_thread~0.base, ~ldv_1_thread_thread~0.offset := 0, 0;~ldv_2_container_struct_pnp_driver~0.base, ~ldv_2_container_struct_pnp_driver~0.offset := 0, 0;~#ldv_2_resource_struct_pm_message~0.base, ~#ldv_2_resource_struct_pm_message~0.offset := 140, 0;call #Ultimate.allocInit(4, 140);call write~init~int(0, ~#ldv_2_resource_struct_pm_message~0.base, ~#ldv_2_resource_struct_pm_message~0.offset, 4);~ldv_2_resource_struct_pnp_dev_ptr~0.base, ~ldv_2_resource_struct_pnp_dev_ptr~0.offset := 0, 0;~ldv_2_resource_struct_pnp_device_id~0.base, ~ldv_2_resource_struct_pnp_device_id~0.offset := 0, 0;~ldv_2_ret_default~0 := 0;~ldv_8_ret_default~0 := 0;~ldv_statevar_0~0 := 0;~ldv_statevar_1~0 := 0;~ldv_statevar_2~0 := 0;~ldv_statevar_8~0 := 0;~ldv_0_callback_handler~0.base, ~ldv_0_callback_handler~0.offset := #funAddr~nvt_cir_isr.base, #funAddr~nvt_cir_isr.offset;~ldv_1_callback_handler~0.base, ~ldv_1_callback_handler~0.offset := #funAddr~nvt_cir_wake_isr.base, #funAddr~nvt_cir_wake_isr.offset;~ldv_2_callback_remove~0.base, ~ldv_2_callback_remove~0.offset := #funAddr~nvt_remove.base, #funAddr~nvt_remove.offset;~ldv_8_exit_nvt_exit_default~0.base, ~ldv_8_exit_nvt_exit_default~0.offset := #funAddr~nvt_exit.base, #funAddr~nvt_exit.offset;~ldv_8_init_nvt_init_default~0.base, ~ldv_8_init_nvt_init_default~0.offset := #funAddr~nvt_init.base, #funAddr~nvt_init.offset;~ldv_spin_alloc_lock_of_task_struct~0 := 1;~ldv_spin_i_lock_of_inode~0 := 1;~ldv_spin_lock~0 := 1;~ldv_spin_lock_of_NOT_ARG_SIGN~0 := 1;~ldv_spin_node_size_lock_of_pglist_data~0 := 1;~ldv_spin_nvt_lock_of_nvt_dev~0 := 1;~ldv_spin_ptl~0 := 1;~ldv_spin_siglock_of_sighand_struct~0 := 1; {25786#true} is VALID [2022-02-20 22:46:18,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {25786#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret360#1, main_~tmp~29#1;havoc main_~tmp~29#1;assume { :begin_inline_ldv_initialize } true; {25786#true} is VALID [2022-02-20 22:46:18,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {25786#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_ldv_initialize_external_data } true;assume { :begin_inline_ldv_allocate_external_0 } true;havoc ldv_allocate_external_0_#t~ret347#1.base, ldv_allocate_external_0_#t~ret347#1.offset, ldv_allocate_external_0_#t~ret348#1.base, ldv_allocate_external_0_#t~ret348#1.offset, ldv_allocate_external_0_#t~ret349#1.base, ldv_allocate_external_0_#t~ret349#1.offset; {25786#true} is VALID [2022-02-20 22:46:18,693 INFO L272 TraceCheckUtils]: 3: Hoare triple {25786#true} call ldv_allocate_external_0_#t~ret347#1.base, ldv_allocate_external_0_#t~ret347#1.offset := ldv_malloc(0); {25849#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:46:18,694 INFO L290 TraceCheckUtils]: 4: Hoare triple {25849#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~4.base, ~res~4.offset;havoc ~tmp~50.base, ~tmp~50.offset;havoc ~tmp___0~16;havoc ~tmp___1~6; {25786#true} is VALID [2022-02-20 22:46:18,694 INFO L272 TraceCheckUtils]: 5: Hoare triple {25786#true} call #t~ret426 := ldv_undef_int(); {25786#true} is VALID [2022-02-20 22:46:18,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {25786#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {25786#true} is VALID [2022-02-20 22:46:18,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,694 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {25786#true} {25786#true} #1936#return; {25786#true} is VALID [2022-02-20 22:46:18,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {25786#true} assume -2147483648 <= #t~ret426 && #t~ret426 <= 2147483647;~tmp___1~6 := #t~ret426;havoc #t~ret426; {25786#true} is VALID [2022-02-20 22:46:18,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {25786#true} assume !(0 != ~tmp___1~6);#res.base, #res.offset := 0, 0; {25786#true} is VALID [2022-02-20 22:46:18,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,696 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {25786#true} {25786#true} #2106#return; {25786#true} is VALID [2022-02-20 22:46:18,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {25786#true} ~ldv_0_data_data~0.base, ~ldv_0_data_data~0.offset := ldv_allocate_external_0_#t~ret347#1.base, ldv_allocate_external_0_#t~ret347#1.offset;havoc ldv_allocate_external_0_#t~ret347#1.base, ldv_allocate_external_0_#t~ret347#1.offset;~ldv_0_thread_thread~0.base, ~ldv_0_thread_thread~0.offset := 0, 0; {25786#true} is VALID [2022-02-20 22:46:18,697 INFO L272 TraceCheckUtils]: 14: Hoare triple {25786#true} call ldv_allocate_external_0_#t~ret348#1.base, ldv_allocate_external_0_#t~ret348#1.offset := ldv_malloc(0); {25849#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:46:18,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {25849#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~4.base, ~res~4.offset;havoc ~tmp~50.base, ~tmp~50.offset;havoc ~tmp___0~16;havoc ~tmp___1~6; {25786#true} is VALID [2022-02-20 22:46:18,697 INFO L272 TraceCheckUtils]: 16: Hoare triple {25786#true} call #t~ret426 := ldv_undef_int(); {25786#true} is VALID [2022-02-20 22:46:18,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {25786#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {25786#true} is VALID [2022-02-20 22:46:18,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,698 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {25786#true} {25786#true} #1936#return; {25786#true} is VALID [2022-02-20 22:46:18,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {25786#true} assume -2147483648 <= #t~ret426 && #t~ret426 <= 2147483647;~tmp___1~6 := #t~ret426;havoc #t~ret426; {25786#true} is VALID [2022-02-20 22:46:18,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {25786#true} assume !(0 != ~tmp___1~6);#res.base, #res.offset := 0, 0; {25786#true} is VALID [2022-02-20 22:46:18,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,698 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {25786#true} {25786#true} #2108#return; {25786#true} is VALID [2022-02-20 22:46:18,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {25786#true} ~ldv_1_data_data~0.base, ~ldv_1_data_data~0.offset := ldv_allocate_external_0_#t~ret348#1.base, ldv_allocate_external_0_#t~ret348#1.offset;havoc ldv_allocate_external_0_#t~ret348#1.base, ldv_allocate_external_0_#t~ret348#1.offset;~ldv_1_thread_thread~0.base, ~ldv_1_thread_thread~0.offset := 0, 0; {25786#true} is VALID [2022-02-20 22:46:18,699 INFO L272 TraceCheckUtils]: 25: Hoare triple {25786#true} call ldv_allocate_external_0_#t~ret349#1.base, ldv_allocate_external_0_#t~ret349#1.offset := ldv_malloc(1598); {25849#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:46:18,699 INFO L290 TraceCheckUtils]: 26: Hoare triple {25849#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~res~4.base, ~res~4.offset;havoc ~tmp~50.base, ~tmp~50.offset;havoc ~tmp___0~16;havoc ~tmp___1~6; {25786#true} is VALID [2022-02-20 22:46:18,700 INFO L272 TraceCheckUtils]: 27: Hoare triple {25786#true} call #t~ret426 := ldv_undef_int(); {25786#true} is VALID [2022-02-20 22:46:18,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {25786#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {25786#true} is VALID [2022-02-20 22:46:18,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,700 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {25786#true} {25786#true} #1936#return; {25786#true} is VALID [2022-02-20 22:46:18,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {25786#true} assume -2147483648 <= #t~ret426 && #t~ret426 <= 2147483647;~tmp___1~6 := #t~ret426;havoc #t~ret426; {25786#true} is VALID [2022-02-20 22:46:18,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {25786#true} assume !(0 != ~tmp___1~6);#res.base, #res.offset := 0, 0; {25786#true} is VALID [2022-02-20 22:46:18,707 INFO L290 TraceCheckUtils]: 33: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,707 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {25786#true} {25786#true} #2110#return; {25786#true} is VALID [2022-02-20 22:46:18,707 INFO L290 TraceCheckUtils]: 35: Hoare triple {25786#true} ~ldv_2_resource_struct_pnp_dev_ptr~0.base, ~ldv_2_resource_struct_pnp_dev_ptr~0.offset := ldv_allocate_external_0_#t~ret349#1.base, ldv_allocate_external_0_#t~ret349#1.offset;havoc ldv_allocate_external_0_#t~ret349#1.base, ldv_allocate_external_0_#t~ret349#1.offset; {25786#true} is VALID [2022-02-20 22:46:18,707 INFO L290 TraceCheckUtils]: 36: Hoare triple {25786#true} assume { :end_inline_ldv_allocate_external_0 } true; {25786#true} is VALID [2022-02-20 22:46:18,707 INFO L290 TraceCheckUtils]: 37: Hoare triple {25786#true} assume { :end_inline_ldv_initialize_external_data } true;~ldv_statevar_8~0 := 7;~ldv_statevar_0~0 := 6;~ldv_statevar_1~0 := 6;~ldv_2_ret_default~0 := 1;~ldv_statevar_2~0 := 19; {25786#true} is VALID [2022-02-20 22:46:18,707 INFO L272 TraceCheckUtils]: 38: Hoare triple {25786#true} call main_#t~ret360#1 := ldv_undef_int(); {25786#true} is VALID [2022-02-20 22:46:18,708 INFO L290 TraceCheckUtils]: 39: Hoare triple {25786#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {25786#true} is VALID [2022-02-20 22:46:18,708 INFO L290 TraceCheckUtils]: 40: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,708 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {25786#true} {25786#true} #2112#return; {25786#true} is VALID [2022-02-20 22:46:18,708 INFO L290 TraceCheckUtils]: 42: Hoare triple {25786#true} assume -2147483648 <= main_#t~ret360#1 && main_#t~ret360#1 <= 2147483647;main_~tmp~29#1 := main_#t~ret360#1;havoc main_#t~ret360#1; {25786#true} is VALID [2022-02-20 22:46:18,708 INFO L290 TraceCheckUtils]: 43: Hoare triple {25786#true} assume 0 == main_~tmp~29#1; {25786#true} is VALID [2022-02-20 22:46:18,708 INFO L290 TraceCheckUtils]: 44: Hoare triple {25786#true} assume { :begin_inline_ldv_entry_EMGentry_8 } true;ldv_entry_EMGentry_8_#in~arg0#1.base, ldv_entry_EMGentry_8_#in~arg0#1.offset := 0, 0;havoc ldv_entry_EMGentry_8_#t~ret357#1, ldv_entry_EMGentry_8_#t~ret358#1, ldv_entry_EMGentry_8_#t~ret359#1, ldv_entry_EMGentry_8_~arg0#1.base, ldv_entry_EMGentry_8_~arg0#1.offset, ldv_entry_EMGentry_8_~tmp~28#1;ldv_entry_EMGentry_8_~arg0#1.base, ldv_entry_EMGentry_8_~arg0#1.offset := ldv_entry_EMGentry_8_#in~arg0#1.base, ldv_entry_EMGentry_8_#in~arg0#1.offset;havoc ldv_entry_EMGentry_8_~tmp~28#1; {25786#true} is VALID [2022-02-20 22:46:18,709 INFO L290 TraceCheckUtils]: 45: Hoare triple {25786#true} assume !(4 == ~ldv_statevar_8~0); {25786#true} is VALID [2022-02-20 22:46:18,709 INFO L290 TraceCheckUtils]: 46: Hoare triple {25786#true} assume !(6 == ~ldv_statevar_8~0); {25786#true} is VALID [2022-02-20 22:46:18,709 INFO L290 TraceCheckUtils]: 47: Hoare triple {25786#true} assume 7 == ~ldv_statevar_8~0; {25786#true} is VALID [2022-02-20 22:46:18,709 INFO L272 TraceCheckUtils]: 48: Hoare triple {25786#true} call ldv_assume((if 19 == ~ldv_statevar_2~0 then 1 else 0)); {25786#true} is VALID [2022-02-20 22:46:18,709 INFO L290 TraceCheckUtils]: 49: Hoare triple {25786#true} ~expression := #in~expression; {25786#true} is VALID [2022-02-20 22:46:18,709 INFO L290 TraceCheckUtils]: 50: Hoare triple {25786#true} assume !(0 == ~expression); {25786#true} is VALID [2022-02-20 22:46:18,709 INFO L290 TraceCheckUtils]: 51: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,710 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {25786#true} {25786#true} #2130#return; {25786#true} is VALID [2022-02-20 22:46:18,710 INFO L290 TraceCheckUtils]: 53: Hoare triple {25786#true} assume { :begin_inline_ldv_EMGentry_init_nvt_init_8_7 } true;ldv_EMGentry_init_nvt_init_8_7_#in~arg0#1.base, ldv_EMGentry_init_nvt_init_8_7_#in~arg0#1.offset := ~ldv_8_init_nvt_init_default~0.base, ~ldv_8_init_nvt_init_default~0.offset;havoc ldv_EMGentry_init_nvt_init_8_7_#res#1;havoc ldv_EMGentry_init_nvt_init_8_7_#t~ret346#1, ldv_EMGentry_init_nvt_init_8_7_~arg0#1.base, ldv_EMGentry_init_nvt_init_8_7_~arg0#1.offset, ldv_EMGentry_init_nvt_init_8_7_~tmp~22#1;ldv_EMGentry_init_nvt_init_8_7_~arg0#1.base, ldv_EMGentry_init_nvt_init_8_7_~arg0#1.offset := ldv_EMGentry_init_nvt_init_8_7_#in~arg0#1.base, ldv_EMGentry_init_nvt_init_8_7_#in~arg0#1.offset;havoc ldv_EMGentry_init_nvt_init_8_7_~tmp~22#1;assume { :begin_inline_nvt_init } true;havoc nvt_init_#res#1;havoc nvt_init_#t~ret345#1, nvt_init_~tmp~21#1;havoc nvt_init_~tmp~21#1;assume { :begin_inline_ldv_pnp_register_driver_77 } true;ldv_pnp_register_driver_77_#in~ldv_func_arg1#1.base, ldv_pnp_register_driver_77_#in~ldv_func_arg1#1.offset := ~#nvt_driver~0.base, ~#nvt_driver~0.offset;havoc ldv_pnp_register_driver_77_#res#1;havoc ldv_pnp_register_driver_77_#t~ret403#1, ldv_pnp_register_driver_77_#t~ret404#1, ldv_pnp_register_driver_77_~ldv_func_arg1#1.base, ldv_pnp_register_driver_77_~ldv_func_arg1#1.offset, ldv_pnp_register_driver_77_~ldv_func_res~2#1, ldv_pnp_register_driver_77_~tmp~43#1, ldv_pnp_register_driver_77_~tmp___0~14#1;ldv_pnp_register_driver_77_~ldv_func_arg1#1.base, ldv_pnp_register_driver_77_~ldv_func_arg1#1.offset := ldv_pnp_register_driver_77_#in~ldv_func_arg1#1.base, ldv_pnp_register_driver_77_#in~ldv_func_arg1#1.offset;havoc ldv_pnp_register_driver_77_~ldv_func_res~2#1;havoc ldv_pnp_register_driver_77_~tmp~43#1;havoc ldv_pnp_register_driver_77_~tmp___0~14#1;assume { :begin_inline_pnp_register_driver } true;pnp_register_driver_#in~arg0#1.base, pnp_register_driver_#in~arg0#1.offset := ldv_pnp_register_driver_77_~ldv_func_arg1#1.base, ldv_pnp_register_driver_77_~ldv_func_arg1#1.offset;havoc pnp_register_driver_#res#1;havoc pnp_register_driver_#t~nondet491#1, pnp_register_driver_~arg0#1.base, pnp_register_driver_~arg0#1.offset;pnp_register_driver_~arg0#1.base, pnp_register_driver_~arg0#1.offset := pnp_register_driver_#in~arg0#1.base, pnp_register_driver_#in~arg0#1.offset;assume -2147483648 <= pnp_register_driver_#t~nondet491#1 && pnp_register_driver_#t~nondet491#1 <= 2147483647;pnp_register_driver_#res#1 := pnp_register_driver_#t~nondet491#1;havoc pnp_register_driver_#t~nondet491#1; {25786#true} is VALID [2022-02-20 22:46:18,710 INFO L290 TraceCheckUtils]: 54: Hoare triple {25786#true} ldv_pnp_register_driver_77_#t~ret403#1 := pnp_register_driver_#res#1;assume { :end_inline_pnp_register_driver } true;assume -2147483648 <= ldv_pnp_register_driver_77_#t~ret403#1 && ldv_pnp_register_driver_77_#t~ret403#1 <= 2147483647;ldv_pnp_register_driver_77_~tmp~43#1 := ldv_pnp_register_driver_77_#t~ret403#1;havoc ldv_pnp_register_driver_77_#t~ret403#1;ldv_pnp_register_driver_77_~ldv_func_res~2#1 := ldv_pnp_register_driver_77_~tmp~43#1;assume { :begin_inline_ldv_pnp_register_driver } true;ldv_pnp_register_driver_#in~arg0#1, ldv_pnp_register_driver_#in~arg1#1.base, ldv_pnp_register_driver_#in~arg1#1.offset := ldv_pnp_register_driver_77_~ldv_func_res~2#1, ldv_pnp_register_driver_77_~ldv_func_arg1#1.base, ldv_pnp_register_driver_77_~ldv_func_arg1#1.offset;havoc ldv_pnp_register_driver_#res#1;havoc ldv_pnp_register_driver_#t~ret373#1, ldv_pnp_register_driver_~arg0#1, ldv_pnp_register_driver_~arg1#1.base, ldv_pnp_register_driver_~arg1#1.offset, ldv_pnp_register_driver_~ldv_7_struct_pnp_driver_struct_pnp_driver~0#1.base, ldv_pnp_register_driver_~ldv_7_struct_pnp_driver_struct_pnp_driver~0#1.offset, ldv_pnp_register_driver_~tmp~34#1;ldv_pnp_register_driver_~arg0#1 := ldv_pnp_register_driver_#in~arg0#1;ldv_pnp_register_driver_~arg1#1.base, ldv_pnp_register_driver_~arg1#1.offset := ldv_pnp_register_driver_#in~arg1#1.base, ldv_pnp_register_driver_#in~arg1#1.offset;havoc ldv_pnp_register_driver_~ldv_7_struct_pnp_driver_struct_pnp_driver~0#1.base, ldv_pnp_register_driver_~ldv_7_struct_pnp_driver_struct_pnp_driver~0#1.offset;havoc ldv_pnp_register_driver_~tmp~34#1; {25786#true} is VALID [2022-02-20 22:46:18,710 INFO L272 TraceCheckUtils]: 55: Hoare triple {25786#true} call ldv_pnp_register_driver_#t~ret373#1 := ldv_undef_int(); {25786#true} is VALID [2022-02-20 22:46:18,710 INFO L290 TraceCheckUtils]: 56: Hoare triple {25786#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {25786#true} is VALID [2022-02-20 22:46:18,711 INFO L290 TraceCheckUtils]: 57: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,711 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {25786#true} {25786#true} #2132#return; {25786#true} is VALID [2022-02-20 22:46:18,711 INFO L290 TraceCheckUtils]: 59: Hoare triple {25786#true} assume -2147483648 <= ldv_pnp_register_driver_#t~ret373#1 && ldv_pnp_register_driver_#t~ret373#1 <= 2147483647;ldv_pnp_register_driver_~tmp~34#1 := ldv_pnp_register_driver_#t~ret373#1;havoc ldv_pnp_register_driver_#t~ret373#1; {25786#true} is VALID [2022-02-20 22:46:18,711 INFO L290 TraceCheckUtils]: 60: Hoare triple {25786#true} assume !(0 != ldv_pnp_register_driver_~tmp~34#1); {25786#true} is VALID [2022-02-20 22:46:18,711 INFO L272 TraceCheckUtils]: 61: Hoare triple {25786#true} call ldv_assume((if 0 != ldv_pnp_register_driver_~arg0#1 then 1 else 0)); {25786#true} is VALID [2022-02-20 22:46:18,711 INFO L290 TraceCheckUtils]: 62: Hoare triple {25786#true} ~expression := #in~expression; {25786#true} is VALID [2022-02-20 22:46:18,712 INFO L290 TraceCheckUtils]: 63: Hoare triple {25786#true} assume !(0 == ~expression); {25786#true} is VALID [2022-02-20 22:46:18,712 INFO L290 TraceCheckUtils]: 64: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,712 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {25786#true} {25786#true} #2138#return; {25786#true} is VALID [2022-02-20 22:46:18,712 INFO L290 TraceCheckUtils]: 66: Hoare triple {25786#true} ldv_pnp_register_driver_#res#1 := ldv_pnp_register_driver_~arg0#1; {25786#true} is VALID [2022-02-20 22:46:18,712 INFO L290 TraceCheckUtils]: 67: Hoare triple {25786#true} ldv_pnp_register_driver_77_#t~ret404#1 := ldv_pnp_register_driver_#res#1;assume { :end_inline_ldv_pnp_register_driver } true;assume -2147483648 <= ldv_pnp_register_driver_77_#t~ret404#1 && ldv_pnp_register_driver_77_#t~ret404#1 <= 2147483647;ldv_pnp_register_driver_77_~tmp___0~14#1 := ldv_pnp_register_driver_77_#t~ret404#1;havoc ldv_pnp_register_driver_77_#t~ret404#1;ldv_pnp_register_driver_77_#res#1 := ldv_pnp_register_driver_77_~tmp___0~14#1; {25786#true} is VALID [2022-02-20 22:46:18,712 INFO L290 TraceCheckUtils]: 68: Hoare triple {25786#true} nvt_init_#t~ret345#1 := ldv_pnp_register_driver_77_#res#1;assume { :end_inline_ldv_pnp_register_driver_77 } true;assume -2147483648 <= nvt_init_#t~ret345#1 && nvt_init_#t~ret345#1 <= 2147483647;nvt_init_~tmp~21#1 := nvt_init_#t~ret345#1;havoc nvt_init_#t~ret345#1;nvt_init_#res#1 := nvt_init_~tmp~21#1; {25786#true} is VALID [2022-02-20 22:46:18,713 INFO L290 TraceCheckUtils]: 69: Hoare triple {25786#true} ldv_EMGentry_init_nvt_init_8_7_#t~ret346#1 := nvt_init_#res#1;assume { :end_inline_nvt_init } true;assume -2147483648 <= ldv_EMGentry_init_nvt_init_8_7_#t~ret346#1 && ldv_EMGentry_init_nvt_init_8_7_#t~ret346#1 <= 2147483647;ldv_EMGentry_init_nvt_init_8_7_~tmp~22#1 := ldv_EMGentry_init_nvt_init_8_7_#t~ret346#1;havoc ldv_EMGentry_init_nvt_init_8_7_#t~ret346#1;ldv_EMGentry_init_nvt_init_8_7_#res#1 := ldv_EMGentry_init_nvt_init_8_7_~tmp~22#1; {25786#true} is VALID [2022-02-20 22:46:18,714 INFO L290 TraceCheckUtils]: 70: Hoare triple {25786#true} ldv_entry_EMGentry_8_#t~ret357#1 := ldv_EMGentry_init_nvt_init_8_7_#res#1;assume { :end_inline_ldv_EMGentry_init_nvt_init_8_7 } true;assume -2147483648 <= ldv_entry_EMGentry_8_#t~ret357#1 && ldv_entry_EMGentry_8_#t~ret357#1 <= 2147483647;~ldv_8_ret_default~0 := ldv_entry_EMGentry_8_#t~ret357#1;havoc ldv_entry_EMGentry_8_#t~ret357#1;assume { :begin_inline_ldv_post_init } true;ldv_post_init_#in~init_ret_val#1 := ~ldv_8_ret_default~0;havoc ldv_post_init_#res#1;havoc ldv_post_init_#t~ret414#1, ldv_post_init_~init_ret_val#1, ldv_post_init_~tmp~47#1;ldv_post_init_~init_ret_val#1 := ldv_post_init_#in~init_ret_val#1;havoc ldv_post_init_~tmp~47#1; {25786#true} is VALID [2022-02-20 22:46:18,714 INFO L272 TraceCheckUtils]: 71: Hoare triple {25786#true} call ldv_post_init_#t~ret414#1 := ldv_filter_positive_int(ldv_post_init_~init_ret_val#1); {25786#true} is VALID [2022-02-20 22:46:18,715 INFO L290 TraceCheckUtils]: 72: Hoare triple {25786#true} ~val := #in~val; {25786#true} is VALID [2022-02-20 22:46:18,717 INFO L272 TraceCheckUtils]: 73: Hoare triple {25786#true} call ldv_assume((if ~val <= 0 then 1 else 0)); {25786#true} is VALID [2022-02-20 22:46:18,718 INFO L290 TraceCheckUtils]: 74: Hoare triple {25786#true} ~expression := #in~expression; {25786#true} is VALID [2022-02-20 22:46:18,720 INFO L290 TraceCheckUtils]: 75: Hoare triple {25786#true} assume !(0 == ~expression); {25786#true} is VALID [2022-02-20 22:46:18,720 INFO L290 TraceCheckUtils]: 76: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,720 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {25786#true} {25786#true} #2036#return; {25786#true} is VALID [2022-02-20 22:46:18,720 INFO L290 TraceCheckUtils]: 78: Hoare triple {25786#true} #res := ~val; {25786#true} is VALID [2022-02-20 22:46:18,720 INFO L290 TraceCheckUtils]: 79: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,720 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {25786#true} {25786#true} #2140#return; {25786#true} is VALID [2022-02-20 22:46:18,721 INFO L290 TraceCheckUtils]: 81: Hoare triple {25786#true} assume -2147483648 <= ldv_post_init_#t~ret414#1 && ldv_post_init_#t~ret414#1 <= 2147483647;ldv_post_init_~tmp~47#1 := ldv_post_init_#t~ret414#1;havoc ldv_post_init_#t~ret414#1;ldv_post_init_#res#1 := ldv_post_init_~tmp~47#1; {25786#true} is VALID [2022-02-20 22:46:18,721 INFO L290 TraceCheckUtils]: 82: Hoare triple {25786#true} ldv_entry_EMGentry_8_#t~ret358#1 := ldv_post_init_#res#1;assume { :end_inline_ldv_post_init } true;assume -2147483648 <= ldv_entry_EMGentry_8_#t~ret358#1 && ldv_entry_EMGentry_8_#t~ret358#1 <= 2147483647;~ldv_8_ret_default~0 := ldv_entry_EMGentry_8_#t~ret358#1;havoc ldv_entry_EMGentry_8_#t~ret358#1; {25786#true} is VALID [2022-02-20 22:46:18,721 INFO L272 TraceCheckUtils]: 83: Hoare triple {25786#true} call ldv_entry_EMGentry_8_#t~ret359#1 := ldv_undef_int(); {25786#true} is VALID [2022-02-20 22:46:18,721 INFO L290 TraceCheckUtils]: 84: Hoare triple {25786#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {25786#true} is VALID [2022-02-20 22:46:18,721 INFO L290 TraceCheckUtils]: 85: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,721 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {25786#true} {25786#true} #2142#return; {25786#true} is VALID [2022-02-20 22:46:18,722 INFO L290 TraceCheckUtils]: 87: Hoare triple {25786#true} assume -2147483648 <= ldv_entry_EMGentry_8_#t~ret359#1 && ldv_entry_EMGentry_8_#t~ret359#1 <= 2147483647;ldv_entry_EMGentry_8_~tmp~28#1 := ldv_entry_EMGentry_8_#t~ret359#1;havoc ldv_entry_EMGentry_8_#t~ret359#1; {25786#true} is VALID [2022-02-20 22:46:18,722 INFO L290 TraceCheckUtils]: 88: Hoare triple {25786#true} assume 0 != ldv_entry_EMGentry_8_~tmp~28#1;~ldv_statevar_8~0 := 4; {25841#(= ~ldv_statevar_8~0 4)} is VALID [2022-02-20 22:46:18,723 INFO L290 TraceCheckUtils]: 89: Hoare triple {25841#(= ~ldv_statevar_8~0 4)} assume { :end_inline_ldv_entry_EMGentry_8 } true; {25841#(= ~ldv_statevar_8~0 4)} is VALID [2022-02-20 22:46:18,723 INFO L272 TraceCheckUtils]: 90: Hoare triple {25841#(= ~ldv_statevar_8~0 4)} call main_#t~ret360#1 := ldv_undef_int(); {25786#true} is VALID [2022-02-20 22:46:18,723 INFO L290 TraceCheckUtils]: 91: Hoare triple {25786#true} havoc ~tmp~55;assume -2147483648 <= #t~nondet437 && #t~nondet437 <= 2147483647;~tmp~55 := #t~nondet437;havoc #t~nondet437;#res := ~tmp~55; {25786#true} is VALID [2022-02-20 22:46:18,723 INFO L290 TraceCheckUtils]: 92: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,724 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {25786#true} {25841#(= ~ldv_statevar_8~0 4)} #2112#return; {25841#(= ~ldv_statevar_8~0 4)} is VALID [2022-02-20 22:46:18,724 INFO L290 TraceCheckUtils]: 94: Hoare triple {25841#(= ~ldv_statevar_8~0 4)} assume -2147483648 <= main_#t~ret360#1 && main_#t~ret360#1 <= 2147483647;main_~tmp~29#1 := main_#t~ret360#1;havoc main_#t~ret360#1; {25841#(= ~ldv_statevar_8~0 4)} is VALID [2022-02-20 22:46:18,724 INFO L290 TraceCheckUtils]: 95: Hoare triple {25841#(= ~ldv_statevar_8~0 4)} assume 0 == main_~tmp~29#1; {25841#(= ~ldv_statevar_8~0 4)} is VALID [2022-02-20 22:46:18,725 INFO L290 TraceCheckUtils]: 96: Hoare triple {25841#(= ~ldv_statevar_8~0 4)} assume { :begin_inline_ldv_entry_EMGentry_8 } true;ldv_entry_EMGentry_8_#in~arg0#1.base, ldv_entry_EMGentry_8_#in~arg0#1.offset := 0, 0;havoc ldv_entry_EMGentry_8_#t~ret357#1, ldv_entry_EMGentry_8_#t~ret358#1, ldv_entry_EMGentry_8_#t~ret359#1, ldv_entry_EMGentry_8_~arg0#1.base, ldv_entry_EMGentry_8_~arg0#1.offset, ldv_entry_EMGentry_8_~tmp~28#1;ldv_entry_EMGentry_8_~arg0#1.base, ldv_entry_EMGentry_8_~arg0#1.offset := ldv_entry_EMGentry_8_#in~arg0#1.base, ldv_entry_EMGentry_8_#in~arg0#1.offset;havoc ldv_entry_EMGentry_8_~tmp~28#1; {25841#(= ~ldv_statevar_8~0 4)} is VALID [2022-02-20 22:46:18,725 INFO L290 TraceCheckUtils]: 97: Hoare triple {25841#(= ~ldv_statevar_8~0 4)} assume !(4 == ~ldv_statevar_8~0); {25787#false} is VALID [2022-02-20 22:46:18,725 INFO L290 TraceCheckUtils]: 98: Hoare triple {25787#false} assume 6 == ~ldv_statevar_8~0; {25787#false} is VALID [2022-02-20 22:46:18,725 INFO L272 TraceCheckUtils]: 99: Hoare triple {25787#false} call ldv_assume((if 0 != ~ldv_8_ret_default~0 then 1 else 0)); {25786#true} is VALID [2022-02-20 22:46:18,725 INFO L290 TraceCheckUtils]: 100: Hoare triple {25786#true} ~expression := #in~expression; {25786#true} is VALID [2022-02-20 22:46:18,726 INFO L290 TraceCheckUtils]: 101: Hoare triple {25786#true} assume !(0 == ~expression); {25786#true} is VALID [2022-02-20 22:46:18,726 INFO L290 TraceCheckUtils]: 102: Hoare triple {25786#true} assume true; {25786#true} is VALID [2022-02-20 22:46:18,726 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25786#true} {25787#false} #2124#return; {25787#false} is VALID [2022-02-20 22:46:18,726 INFO L272 TraceCheckUtils]: 104: Hoare triple {25787#false} call ldv_check_final_state(); {25787#false} is VALID [2022-02-20 22:46:18,726 INFO L272 TraceCheckUtils]: 105: Hoare triple {25787#false} call ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit((if 1 == ~ldv_spin_alloc_lock_of_task_struct~0 then 1 else 0)); {25787#false} is VALID [2022-02-20 22:46:18,726 INFO L290 TraceCheckUtils]: 106: Hoare triple {25787#false} ~expr := #in~expr; {25787#false} is VALID [2022-02-20 22:46:18,727 INFO L290 TraceCheckUtils]: 107: Hoare triple {25787#false} assume 0 == ~expr; {25787#false} is VALID [2022-02-20 22:46:18,727 INFO L290 TraceCheckUtils]: 108: Hoare triple {25787#false} assume !false; {25787#false} is VALID [2022-02-20 22:46:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-02-20 22:46:18,728 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:46:18,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749661341] [2022-02-20 22:46:18,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749661341] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:46:18,728 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:46:18,728 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 22:46:18,728 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458828162] [2022-02-20 22:46:18,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:46:18,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 109 [2022-02-20 22:46:18,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:46:18,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-02-20 22:46:18,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:46:18,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 22:46:18,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:46:18,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 22:46:18,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 22:46:18,796 INFO L87 Difference]: Start difference. First operand 1829 states and 2541 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13)