./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-net-hippi-rrunner.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-net-hippi-rrunner.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 10193951df4eb6f67d99eaaa8758acfa57b6461ca38071389a41cbdc5c585dfb --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 15:20:53,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 15:20:53,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 15:20:53,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 15:20:53,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 15:20:53,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 15:20:53,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 15:20:53,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 15:20:53,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 15:20:53,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 15:20:53,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 15:20:53,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 15:20:53,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 15:20:53,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 15:20:53,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 15:20:53,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 15:20:53,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 15:20:53,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 15:20:53,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 15:20:53,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 15:20:53,531 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 15:20:53,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 15:20:53,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 15:20:53,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 15:20:53,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 15:20:53,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 15:20:53,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 15:20:53,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 15:20:53,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 15:20:53,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 15:20:53,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 15:20:53,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 15:20:53,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 15:20:53,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 15:20:53,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 15:20:53,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 15:20:53,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 15:20:53,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 15:20:53,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 15:20:53,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 15:20:53,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 15:20:53,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 15:20:53,546 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 15:20:53,567 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 15:20:53,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 15:20:53,567 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 15:20:53,567 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 15:20:53,568 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 15:20:53,568 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 15:20:53,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 15:20:53,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 15:20:53,569 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 15:20:53,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 15:20:53,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 15:20:53,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 15:20:53,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 15:20:53,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 15:20:53,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 15:20:53,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 15:20:53,570 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 15:20:53,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 15:20:53,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 15:20:53,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 15:20:53,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 15:20:53,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 15:20:53,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 15:20:53,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 15:20:53,571 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 15:20:53,571 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 15:20:53,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 15:20:53,572 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 15:20:53,572 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 15:20:53,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 15:20:53,572 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 -> 10193951df4eb6f67d99eaaa8758acfa57b6461ca38071389a41cbdc5c585dfb [2022-07-12 15:20:53,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 15:20:53,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 15:20:53,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 15:20:53,751 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 15:20:53,752 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 15:20:53,753 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-net-hippi-rrunner.cil.i [2022-07-12 15:20:53,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0331bcdcc/e8e9ba9c8a994150856ff711f7f93f93/FLAGe756c0b26 [2022-07-12 15:20:54,366 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 15:20:54,366 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-net-hippi-rrunner.cil.i [2022-07-12 15:20:54,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0331bcdcc/e8e9ba9c8a994150856ff711f7f93f93/FLAGe756c0b26 [2022-07-12 15:20:54,563 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0331bcdcc/e8e9ba9c8a994150856ff711f7f93f93 [2022-07-12 15:20:54,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 15:20:54,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 15:20:54,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 15:20:54,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 15:20:54,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 15:20:54,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:20:54" (1/1) ... [2022-07-12 15:20:54,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a9dd4b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:54, skipping insertion in model container [2022-07-12 15:20:54,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:20:54" (1/1) ... [2022-07-12 15:20:54,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 15:20:54,681 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 15:20:56,260 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-net-hippi-rrunner.cil.i[341176,341189] [2022-07-12 15:20:56,262 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-net-hippi-rrunner.cil.i[341345,341358] [2022-07-12 15:20:56,263 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-net-hippi-rrunner.cil.i[341512,341525] [2022-07-12 15:20:56,263 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-net-hippi-rrunner.cil.i[341680,341693] [2022-07-12 15:20:56,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 15:20:56,290 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 15:20:56,513 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-net-hippi-rrunner.cil.i[341176,341189] [2022-07-12 15:20:56,513 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-net-hippi-rrunner.cil.i[341345,341358] [2022-07-12 15:20:56,514 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-net-hippi-rrunner.cil.i[341512,341525] [2022-07-12 15:20:56,514 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-net-hippi-rrunner.cil.i[341680,341693] [2022-07-12 15:20:56,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 15:20:56,631 INFO L208 MainTranslator]: Completed translation [2022-07-12 15:20:56,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:56 WrapperNode [2022-07-12 15:20:56,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 15:20:56,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 15:20:56,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 15:20:56,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 15:20:56,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:56" (1/1) ... [2022-07-12 15:20:56,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:56" (1/1) ... [2022-07-12 15:20:56,833 INFO L137 Inliner]: procedures = 427, calls = 1735, calls flagged for inlining = 206, calls inlined = 187, statements flattened = 4765 [2022-07-12 15:20:56,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 15:20:56,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 15:20:56,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 15:20:56,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 15:20:56,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:56" (1/1) ... [2022-07-12 15:20:56,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:56" (1/1) ... [2022-07-12 15:20:56,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:56" (1/1) ... [2022-07-12 15:20:56,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:56" (1/1) ... [2022-07-12 15:20:56,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:56" (1/1) ... [2022-07-12 15:20:56,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:56" (1/1) ... [2022-07-12 15:20:57,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:56" (1/1) ... [2022-07-12 15:20:57,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 15:20:57,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 15:20:57,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 15:20:57,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 15:20:57,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:56" (1/1) ... [2022-07-12 15:20:57,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 15:20:57,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 15:20:57,069 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-07-12 15:20:57,077 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-07-12 15:20:57,097 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_skb [2022-07-12 15:20:57,097 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_skb [2022-07-12 15:20:57,098 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2022-07-12 15:20:57,098 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2022-07-12 15:20:57,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 15:20:57,098 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 15:20:57,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_82 [2022-07-12 15:20:57,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_82 [2022-07-12 15:20:57,098 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-07-12 15:20:57,098 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-07-12 15:20:57,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 15:20:57,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 15:20:57,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_EMGentry_exit_rr_driver_exit_13_2 [2022-07-12 15:20:57,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_EMGentry_exit_rr_driver_exit_13_2 [2022-07-12 15:20:57,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_lock_of_rr_private [2022-07-12 15:20:57,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_lock_of_rr_private [2022-07-12 15:20:57,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 15:20:57,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-12 15:20:57,099 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2022-07-12 15:20:57,099 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2022-07-12 15:20:57,099 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-12 15:20:57,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 15:20:57,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 15:20:57,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 15:20:57,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 15:20:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_single [2022-07-12 15:20:57,100 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_single [2022-07-12 15:20:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 15:20:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-12 15:20:57,100 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-12 15:20:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 15:20:57,100 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 15:20:57,100 INFO L130 BoogieDeclarations]: Found specification of procedure set_rraddr [2022-07-12 15:20:57,101 INFO L138 BoogieDeclarations]: Found implementation of procedure set_rraddr [2022-07-12 15:20:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-12 15:20:57,101 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-12 15:20:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure rr_read_eeprom_word [2022-07-12 15:20:57,101 INFO L138 BoogieDeclarations]: Found implementation of procedure rr_read_eeprom_word [2022-07-12 15:20:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 15:20:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-12 15:20:57,101 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-12 15:20:57,101 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-12 15:20:57,102 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-12 15:20:57,102 INFO L130 BoogieDeclarations]: Found specification of procedure rr_read_eeprom [2022-07-12 15:20:57,102 INFO L138 BoogieDeclarations]: Found implementation of procedure rr_read_eeprom [2022-07-12 15:20:57,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 15:20:57,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 15:20:57,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 15:20:57,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 15:20:57,102 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-12 15:20:57,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-12 15:20:57,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 15:20:57,103 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 15:20:57,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2022-07-12 15:20:57,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2022-07-12 15:20:57,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-07-12 15:20:57,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-07-12 15:20:57,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-12 15:20:57,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-12 15:20:57,104 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2022-07-12 15:20:57,104 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2022-07-12 15:20:57,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-07-12 15:20:57,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-07-12 15:20:57,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 15:20:57,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_1 [2022-07-12 15:20:57,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_1 [2022-07-12 15:20:57,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 15:20:57,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 15:20:57,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 15:20:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-12 15:20:57,105 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-12 15:20:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 15:20:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 15:20:57,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 15:20:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-12 15:20:57,105 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-12 15:20:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 15:20:57,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 15:20:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_lock_of_rr_private [2022-07-12 15:20:57,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_lock_of_rr_private [2022-07-12 15:20:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2022-07-12 15:20:57,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2022-07-12 15:20:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2022-07-12 15:20:57,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2022-07-12 15:20:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-12 15:20:57,107 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-12 15:20:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-12 15:20:57,107 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-12 15:20:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-12 15:20:57,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-12 15:20:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-12 15:20:57,107 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-12 15:20:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 15:20:57,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 15:20:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-12 15:20:57,108 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-12 15:20:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 15:20:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 15:20:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 15:20:57,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 15:20:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 15:20:57,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-12 15:20:57,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2022-07-12 15:20:57,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2022-07-12 15:20:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure rr_remove_one [2022-07-12 15:20:57,109 INFO L138 BoogieDeclarations]: Found implementation of procedure rr_remove_one [2022-07-12 15:20:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure pci_map_single [2022-07-12 15:20:57,109 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_map_single [2022-07-12 15:20:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 15:20:57,109 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 15:20:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-12 15:20:57,110 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-12 15:20:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure pci_alloc_consistent [2022-07-12 15:20:57,112 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_alloc_consistent [2022-07-12 15:20:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure rr_init1 [2022-07-12 15:20:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure rr_init1 [2022-07-12 15:20:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-12 15:20:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-12 15:20:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure netif_start_queue [2022-07-12 15:20:57,114 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_start_queue [2022-07-12 15:20:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 15:20:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure rr_open [2022-07-12 15:20:57,118 INFO L138 BoogieDeclarations]: Found implementation of procedure rr_open [2022-07-12 15:20:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 15:20:57,118 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-07-12 15:20:57,118 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-07-12 15:20:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 15:20:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-12 15:20:57,119 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-12 15:20:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-12 15:20:57,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-12 15:20:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-12 15:20:57,119 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-12 15:20:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 15:20:57,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 15:20:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-12 15:20:57,120 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-12 15:20:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-12 15:20:57,120 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-12 15:20:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 15:20:57,120 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 15:20:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 15:20:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 15:20:57,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 15:20:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure rr_raz_tx [2022-07-12 15:20:57,121 INFO L138 BoogieDeclarations]: Found implementation of procedure rr_raz_tx [2022-07-12 15:20:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure rr_close [2022-07-12 15:20:57,121 INFO L138 BoogieDeclarations]: Found implementation of procedure rr_close [2022-07-12 15:20:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 15:20:57,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 15:20:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure pci_iounmap [2022-07-12 15:20:57,121 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_iounmap [2022-07-12 15:20:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-12 15:20:57,121 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-12 15:20:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 15:20:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-07-12 15:20:57,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-07-12 15:20:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure rr_raz_rx [2022-07-12 15:20:57,122 INFO L138 BoogieDeclarations]: Found implementation of procedure rr_raz_rx [2022-07-12 15:20:57,671 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 15:20:57,674 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 15:21:00,291 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 15:21:01,860 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2022-07-12 15:21:01,912 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 15:21:01,925 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 15:21:01,925 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 15:21:01,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:21:01 BoogieIcfgContainer [2022-07-12 15:21:01,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 15:21:01,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 15:21:01,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 15:21:01,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 15:21:01,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:20:54" (1/3) ... [2022-07-12 15:21:01,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d3413e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:21:01, skipping insertion in model container [2022-07-12 15:21:01,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:56" (2/3) ... [2022-07-12 15:21:01,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d3413e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:21:01, skipping insertion in model container [2022-07-12 15:21:01,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:21:01" (3/3) ... [2022-07-12 15:21:01,936 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-hippi-rrunner.cil.i [2022-07-12 15:21:01,946 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 15:21:01,947 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-12 15:21:02,020 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 15:21:02,025 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7bdd2170, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@336f860a [2022-07-12 15:21:02,025 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-12 15:21:02,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 1628 states, 1086 states have (on average 1.296500920810313) internal successors, (1408), 1111 states have internal predecessors, (1408), 469 states have call successors, (469), 71 states have call predecessors, (469), 70 states have return successors, (463), 452 states have call predecessors, (463), 463 states have call successors, (463) [2022-07-12 15:21:02,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-12 15:21:02,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:02,048 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-12 15:21:02,049 INFO L420 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-07-12 15:21:02,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:02,053 INFO L85 PathProgramCache]: Analyzing trace with hash 225297271, now seen corresponding path program 1 times [2022-07-12 15:21:02,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:02,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441277694] [2022-07-12 15:21:02,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:02,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:02,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:02,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:02,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:02,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:02,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:02,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:02,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:02,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:02,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:02,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:02,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 15:21:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:02,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:02,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 15:21:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:02,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:02,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 15:21:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:02,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 15:21:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:02,728 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-07-12 15:21:02,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:02,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441277694] [2022-07-12 15:21:02,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441277694] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:02,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:02,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 15:21:02,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400811] [2022-07-12 15:21:02,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:02,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 15:21:02,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:02,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 15:21:02,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 15:21:02,808 INFO L87 Difference]: Start difference. First operand has 1628 states, 1086 states have (on average 1.296500920810313) internal successors, (1408), 1111 states have internal predecessors, (1408), 469 states have call successors, (469), 71 states have call predecessors, (469), 70 states have return successors, (463), 452 states have call predecessors, (463), 463 states have call successors, (463) Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 15:21:07,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:07,237 INFO L93 Difference]: Finished difference Result 4781 states and 7040 transitions. [2022-07-12 15:21:07,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 15:21:07,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 105 [2022-07-12 15:21:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:07,291 INFO L225 Difference]: With dead ends: 4781 [2022-07-12 15:21:07,291 INFO L226 Difference]: Without dead ends: 3162 [2022-07-12 15:21:07,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-07-12 15:21:07,314 INFO L413 NwaCegarLoop]: 2525 mSDtfsCounter, 2499 mSDsluCounter, 2314 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 1180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2904 SdHoareTripleChecker+Valid, 4839 SdHoareTripleChecker+Invalid, 3008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1180 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:07,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2904 Valid, 4839 Invalid, 3008 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1180 Valid, 1828 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-12 15:21:07,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states. [2022-07-12 15:21:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 3124. [2022-07-12 15:21:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 2101 states have (on average 1.256544502617801) internal successors, (2640), 2150 states have internal predecessors, (2640), 884 states have call successors, (884), 137 states have call predecessors, (884), 136 states have return successors, (880), 858 states have call predecessors, (880), 880 states have call successors, (880) [2022-07-12 15:21:07,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4404 transitions. [2022-07-12 15:21:07,605 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4404 transitions. Word has length 105 [2022-07-12 15:21:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:21:07,608 INFO L495 AbstractCegarLoop]: Abstraction has 3124 states and 4404 transitions. [2022-07-12 15:21:07,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 15:21:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4404 transitions. [2022-07-12 15:21:07,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 15:21:07,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:07,616 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-12 15:21:07,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 15:21:07,617 INFO L420 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-07-12 15:21:07,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:07,618 INFO L85 PathProgramCache]: Analyzing trace with hash 740995989, now seen corresponding path program 1 times [2022-07-12 15:21:07,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:07,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225648241] [2022-07-12 15:21:07,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:07,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:07,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:07,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:07,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:07,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:07,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:07,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:07,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:07,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:07,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:07,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 15:21:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:07,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:07,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 15:21:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:07,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:07,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 15:21:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:07,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 15:21:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:07,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 15:21:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:07,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 15:21:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:07,854 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-07-12 15:21:07,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:07,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225648241] [2022-07-12 15:21:07,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225648241] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:07,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:07,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 15:21:07,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875716718] [2022-07-12 15:21:07,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:07,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 15:21:07,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:07,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 15:21:07,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 15:21:07,871 INFO L87 Difference]: Start difference. First operand 3124 states and 4404 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 15:21:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:11,524 INFO L93 Difference]: Finished difference Result 8812 states and 12453 transitions. [2022-07-12 15:21:11,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 15:21:11,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 113 [2022-07-12 15:21:11,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:11,555 INFO L225 Difference]: With dead ends: 8812 [2022-07-12 15:21:11,555 INFO L226 Difference]: Without dead ends: 5707 [2022-07-12 15:21:11,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-07-12 15:21:11,567 INFO L413 NwaCegarLoop]: 2481 mSDtfsCounter, 2186 mSDsluCounter, 2339 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 1188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2536 SdHoareTripleChecker+Valid, 4820 SdHoareTripleChecker+Invalid, 2917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1188 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:11,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2536 Valid, 4820 Invalid, 2917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1188 Valid, 1729 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-12 15:21:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5707 states. [2022-07-12 15:21:11,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5707 to 5619. [2022-07-12 15:21:11,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5619 states, 3738 states have (on average 1.2495987158908508) internal successors, (4671), 3816 states have internal predecessors, (4671), 1613 states have call successors, (1613), 270 states have call predecessors, (1613), 265 states have return successors, (1625), 1568 states have call predecessors, (1625), 1609 states have call successors, (1625) [2022-07-12 15:21:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5619 states to 5619 states and 7909 transitions. [2022-07-12 15:21:11,804 INFO L78 Accepts]: Start accepts. Automaton has 5619 states and 7909 transitions. Word has length 113 [2022-07-12 15:21:11,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:21:11,804 INFO L495 AbstractCegarLoop]: Abstraction has 5619 states and 7909 transitions. [2022-07-12 15:21:11,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 15:21:11,804 INFO L276 IsEmpty]: Start isEmpty. Operand 5619 states and 7909 transitions. [2022-07-12 15:21:11,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-12 15:21:11,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:11,808 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-12 15:21:11,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 15:21:11,808 INFO L420 AbstractCegarLoop]: === Iteration 3 === 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-07-12 15:21:11,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:11,808 INFO L85 PathProgramCache]: Analyzing trace with hash 828808877, now seen corresponding path program 1 times [2022-07-12 15:21:11,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:11,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915283688] [2022-07-12 15:21:11,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:11,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:11,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:11,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:11,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:11,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:11,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:11,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:11,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:11,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:11,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:11,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:11,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 15:21:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:11,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:11,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 15:21:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:11,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:12,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 15:21:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:12,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 15:21:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-07-12 15:21:12,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:12,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915283688] [2022-07-12 15:21:12,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915283688] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:12,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:12,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 15:21:12,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805574520] [2022-07-12 15:21:12,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:12,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 15:21:12,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:12,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 15:21:12,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 15:21:12,009 INFO L87 Difference]: Start difference. First operand 5619 states and 7909 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 15:21:14,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:14,794 INFO L93 Difference]: Finished difference Result 11223 states and 15834 transitions. [2022-07-12 15:21:14,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 15:21:14,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 116 [2022-07-12 15:21:14,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:14,820 INFO L225 Difference]: With dead ends: 11223 [2022-07-12 15:21:14,820 INFO L226 Difference]: Without dead ends: 5623 [2022-07-12 15:21:14,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-07-12 15:21:14,841 INFO L413 NwaCegarLoop]: 2518 mSDtfsCounter, 1761 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 942 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2102 SdHoareTripleChecker+Valid, 4819 SdHoareTripleChecker+Invalid, 2706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 942 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:14,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2102 Valid, 4819 Invalid, 2706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [942 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-12 15:21:14,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5623 states. [2022-07-12 15:21:14,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5623 to 5523. [2022-07-12 15:21:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5523 states, 3623 states have (on average 1.242340601711289) internal successors, (4501), 3700 states have internal predecessors, (4501), 1611 states have call successors, (1611), 291 states have call predecessors, (1611), 286 states have return successors, (1615), 1565 states have call predecessors, (1615), 1607 states have call successors, (1615) [2022-07-12 15:21:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5523 states to 5523 states and 7727 transitions. [2022-07-12 15:21:15,013 INFO L78 Accepts]: Start accepts. Automaton has 5523 states and 7727 transitions. Word has length 116 [2022-07-12 15:21:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:21:15,014 INFO L495 AbstractCegarLoop]: Abstraction has 5523 states and 7727 transitions. [2022-07-12 15:21:15,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 15:21:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 5523 states and 7727 transitions. [2022-07-12 15:21:15,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-12 15:21:15,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:15,017 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-12 15:21:15,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 15:21:15,017 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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-07-12 15:21:15,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:15,018 INFO L85 PathProgramCache]: Analyzing trace with hash -944967309, now seen corresponding path program 1 times [2022-07-12 15:21:15,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:15,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320321078] [2022-07-12 15:21:15,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:15,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 15:21:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 15:21:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 15:21:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 15:21:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 15:21:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 15:21:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:15,235 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-07-12 15:21:15,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:15,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320321078] [2022-07-12 15:21:15,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320321078] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:15,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:15,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 15:21:15,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140476538] [2022-07-12 15:21:15,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:15,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 15:21:15,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:15,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 15:21:15,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 15:21:15,237 INFO L87 Difference]: Start difference. First operand 5523 states and 7727 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 15:21:18,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:18,113 INFO L93 Difference]: Finished difference Result 14677 states and 20562 transitions. [2022-07-12 15:21:18,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 15:21:18,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 133 [2022-07-12 15:21:18,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:18,156 INFO L225 Difference]: With dead ends: 14677 [2022-07-12 15:21:18,157 INFO L226 Difference]: Without dead ends: 9173 [2022-07-12 15:21:18,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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-07-12 15:21:18,172 INFO L413 NwaCegarLoop]: 2461 mSDtfsCounter, 2255 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 1761 mSolverCounterSat, 1177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2605 SdHoareTripleChecker+Valid, 4772 SdHoareTripleChecker+Invalid, 2938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1177 IncrementalHoareTripleChecker+Valid, 1761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:18,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2605 Valid, 4772 Invalid, 2938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1177 Valid, 1761 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-12 15:21:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9173 states. [2022-07-12 15:21:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9173 to 9036. [2022-07-12 15:21:18,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9036 states, 5924 states have (on average 1.237846049966239) internal successors, (7333), 6063 states have internal predecessors, (7333), 2630 states have call successors, (2630), 490 states have call predecessors, (2630), 479 states have return successors, (2642), 2533 states have call predecessors, (2642), 2626 states have call successors, (2642) [2022-07-12 15:21:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9036 states to 9036 states and 12605 transitions. [2022-07-12 15:21:18,462 INFO L78 Accepts]: Start accepts. Automaton has 9036 states and 12605 transitions. Word has length 133 [2022-07-12 15:21:18,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:21:18,463 INFO L495 AbstractCegarLoop]: Abstraction has 9036 states and 12605 transitions. [2022-07-12 15:21:18,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 15:21:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 9036 states and 12605 transitions. [2022-07-12 15:21:18,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-12 15:21:18,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:18,465 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:21:18,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 15:21:18,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === 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-07-12 15:21:18,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:18,466 INFO L85 PathProgramCache]: Analyzing trace with hash 368574642, now seen corresponding path program 1 times [2022-07-12 15:21:18,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:18,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925639635] [2022-07-12 15:21:18,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:18,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 15:21:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 15:21:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 15:21:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 15:21:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 15:21:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 15:21:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 15:21:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 15:21:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 15:21:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 15:21:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 15:21:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-07-12 15:21:18,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:18,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925639635] [2022-07-12 15:21:18,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925639635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:18,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:18,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 15:21:18,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413869068] [2022-07-12 15:21:18,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:18,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 15:21:18,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:18,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 15:21:18,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 15:21:18,682 INFO L87 Difference]: Start difference. First operand 9036 states and 12605 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 15:21:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:23,435 INFO L93 Difference]: Finished difference Result 26149 states and 36673 transitions. [2022-07-12 15:21:23,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 15:21:23,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 144 [2022-07-12 15:21:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:23,508 INFO L225 Difference]: With dead ends: 26149 [2022-07-12 15:21:23,509 INFO L226 Difference]: Without dead ends: 17132 [2022-07-12 15:21:23,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 15:21:23,546 INFO L413 NwaCegarLoop]: 3010 mSDtfsCounter, 2981 mSDsluCounter, 3510 mSDsCounter, 0 mSdLazyCounter, 3064 mSolverCounterSat, 2202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3335 SdHoareTripleChecker+Valid, 6520 SdHoareTripleChecker+Invalid, 5266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2202 IncrementalHoareTripleChecker+Valid, 3064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:23,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3335 Valid, 6520 Invalid, 5266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2202 Valid, 3064 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-12 15:21:23,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17132 states. [2022-07-12 15:21:24,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17132 to 16035. [2022-07-12 15:21:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16035 states, 10734 states have (on average 1.242873113471213) internal successors, (13341), 11016 states have internal predecessors, (13341), 4444 states have call successors, (4444), 873 states have call predecessors, (4444), 854 states have return successors, (4488), 4238 states have call predecessors, (4488), 4440 states have call successors, (4488) [2022-07-12 15:21:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16035 states to 16035 states and 22273 transitions. [2022-07-12 15:21:24,098 INFO L78 Accepts]: Start accepts. Automaton has 16035 states and 22273 transitions. Word has length 144 [2022-07-12 15:21:24,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:21:24,098 INFO L495 AbstractCegarLoop]: Abstraction has 16035 states and 22273 transitions. [2022-07-12 15:21:24,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 15:21:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 16035 states and 22273 transitions. [2022-07-12 15:21:24,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-12 15:21:24,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:24,102 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-12 15:21:24,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 15:21:24,102 INFO L420 AbstractCegarLoop]: === Iteration 6 === 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-07-12 15:21:24,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:24,102 INFO L85 PathProgramCache]: Analyzing trace with hash -784046347, now seen corresponding path program 1 times [2022-07-12 15:21:24,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:24,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059433887] [2022-07-12 15:21:24,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:24,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 15:21:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 15:21:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 15:21:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:21:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 15:21:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 15:21:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 15:21:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 15:21:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 15:21:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 15:21:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-07-12 15:21:24,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:24,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059433887] [2022-07-12 15:21:24,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059433887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:24,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:24,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 15:21:24,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448044809] [2022-07-12 15:21:24,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:24,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 15:21:24,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:24,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 15:21:24,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 15:21:24,331 INFO L87 Difference]: Start difference. First operand 16035 states and 22273 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 15:21:27,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:27,253 INFO L93 Difference]: Finished difference Result 46329 states and 64609 transitions. [2022-07-12 15:21:27,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 15:21:27,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 161 [2022-07-12 15:21:27,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:27,465 INFO L225 Difference]: With dead ends: 46329 [2022-07-12 15:21:27,466 INFO L226 Difference]: Without dead ends: 30865 [2022-07-12 15:21:27,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-07-12 15:21:27,508 INFO L413 NwaCegarLoop]: 3097 mSDtfsCounter, 2331 mSDsluCounter, 2598 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 989 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2731 SdHoareTripleChecker+Valid, 5695 SdHoareTripleChecker+Invalid, 2818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 989 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:27,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2731 Valid, 5695 Invalid, 2818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [989 Valid, 1829 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-12 15:21:27,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30865 states. [2022-07-12 15:21:28,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30865 to 30503. [2022-07-12 15:21:28,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30503 states, 20468 states have (on average 1.2439417627516123) internal successors, (25461), 20972 states have internal predecessors, (25461), 8415 states have call successors, (8415), 1646 states have call predecessors, (8415), 1617 states have return successors, (8507), 8069 states have call predecessors, (8507), 8411 states have call successors, (8507) [2022-07-12 15:21:28,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30503 states to 30503 states and 42383 transitions. [2022-07-12 15:21:28,580 INFO L78 Accepts]: Start accepts. Automaton has 30503 states and 42383 transitions. Word has length 161 [2022-07-12 15:21:28,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:21:28,581 INFO L495 AbstractCegarLoop]: Abstraction has 30503 states and 42383 transitions. [2022-07-12 15:21:28,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 15:21:28,581 INFO L276 IsEmpty]: Start isEmpty. Operand 30503 states and 42383 transitions. [2022-07-12 15:21:28,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-12 15:21:28,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:28,584 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-12 15:21:28,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 15:21:28,585 INFO L420 AbstractCegarLoop]: === Iteration 7 === 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-07-12 15:21:28,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:28,585 INFO L85 PathProgramCache]: Analyzing trace with hash -643497737, now seen corresponding path program 1 times [2022-07-12 15:21:28,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:28,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744611924] [2022-07-12 15:21:28,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:28,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 15:21:28,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 15:21:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 15:21:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:21:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 15:21:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 15:21:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 15:21:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 15:21:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 15:21:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 15:21:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-07-12 15:21:28,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:28,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744611924] [2022-07-12 15:21:28,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744611924] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:28,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:28,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:21:28,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254152781] [2022-07-12 15:21:28,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:28,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:21:28,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:28,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:21:28,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:21:28,796 INFO L87 Difference]: Start difference. First operand 30503 states and 42383 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 15:21:31,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:31,722 INFO L93 Difference]: Finished difference Result 30867 states and 43023 transitions. [2022-07-12 15:21:31,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:21:31,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 161 [2022-07-12 15:21:31,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:31,816 INFO L225 Difference]: With dead ends: 30867 [2022-07-12 15:21:31,817 INFO L226 Difference]: Without dead ends: 30865 [2022-07-12 15:21:31,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 15:21:31,830 INFO L413 NwaCegarLoop]: 2160 mSDtfsCounter, 2143 mSDsluCounter, 3688 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2448 SdHoareTripleChecker+Valid, 5848 SdHoareTripleChecker+Invalid, 3091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 789 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:31,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2448 Valid, 5848 Invalid, 3091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [789 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-12 15:21:31,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30865 states. [2022-07-12 15:21:32,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30865 to 30507. [2022-07-12 15:21:32,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30507 states, 20471 states have (on average 1.2439060133847883) internal successors, (25464), 20975 states have internal predecessors, (25464), 8415 states have call successors, (8415), 1647 states have call predecessors, (8415), 1618 states have return successors, (8507), 8069 states have call predecessors, (8507), 8411 states have call successors, (8507) [2022-07-12 15:21:32,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30507 states to 30507 states and 42386 transitions. [2022-07-12 15:21:32,890 INFO L78 Accepts]: Start accepts. Automaton has 30507 states and 42386 transitions. Word has length 161 [2022-07-12 15:21:32,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:21:32,891 INFO L495 AbstractCegarLoop]: Abstraction has 30507 states and 42386 transitions. [2022-07-12 15:21:32,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 15:21:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand 30507 states and 42386 transitions. [2022-07-12 15:21:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-12 15:21:32,893 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:32,894 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-12 15:21:32,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 15:21:32,894 INFO L420 AbstractCegarLoop]: === Iteration 8 === 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-07-12 15:21:32,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:32,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1651957304, now seen corresponding path program 1 times [2022-07-12 15:21:32,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:32,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134276160] [2022-07-12 15:21:32,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:32,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:32,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 15:21:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:33,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:33,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 15:21:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:33,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:33,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 15:21:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:33,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:21:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:33,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 15:21:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:33,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 15:21:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:33,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 15:21:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:33,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 15:21:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:33,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 15:21:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:33,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 15:21:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:33,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 15:21:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:33,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 15:21:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:33,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 15:21:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:33,238 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2022-07-12 15:21:33,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:33,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134276160] [2022-07-12 15:21:33,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134276160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:33,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:33,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 15:21:33,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15029696] [2022-07-12 15:21:33,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:33,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 15:21:33,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:33,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 15:21:33,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 15:21:33,240 INFO L87 Difference]: Start difference. First operand 30507 states and 42386 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 15:21:39,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:39,231 INFO L93 Difference]: Finished difference Result 94235 states and 132090 transitions. [2022-07-12 15:21:39,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 15:21:39,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 167 [2022-07-12 15:21:39,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:39,450 INFO L225 Difference]: With dead ends: 94235 [2022-07-12 15:21:39,450 INFO L226 Difference]: Without dead ends: 63747 [2022-07-12 15:21:39,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 15:21:39,533 INFO L413 NwaCegarLoop]: 3065 mSDtfsCounter, 3206 mSDsluCounter, 3692 mSDsCounter, 0 mSdLazyCounter, 3205 mSolverCounterSat, 2198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3595 SdHoareTripleChecker+Valid, 6757 SdHoareTripleChecker+Invalid, 5403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2198 IncrementalHoareTripleChecker+Valid, 3205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:39,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3595 Valid, 6757 Invalid, 5403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2198 Valid, 3205 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-12 15:21:39,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63747 states. [2022-07-12 15:21:41,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63747 to 59707. [2022-07-12 15:21:41,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59707 states, 40084 states have (on average 1.2438379403253168) internal successors, (49858), 41102 states have internal predecessors, (49858), 16454 states have call successors, (16454), 3223 states have call predecessors, (16454), 3166 states have return successors, (16642), 15749 states have call predecessors, (16642), 16450 states have call successors, (16642) [2022-07-12 15:21:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59707 states to 59707 states and 82954 transitions. [2022-07-12 15:21:41,967 INFO L78 Accepts]: Start accepts. Automaton has 59707 states and 82954 transitions. Word has length 167 [2022-07-12 15:21:41,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:21:41,967 INFO L495 AbstractCegarLoop]: Abstraction has 59707 states and 82954 transitions. [2022-07-12 15:21:41,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 15:21:41,968 INFO L276 IsEmpty]: Start isEmpty. Operand 59707 states and 82954 transitions. [2022-07-12 15:21:41,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-12 15:21:41,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:41,969 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-12 15:21:41,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 15:21:41,970 INFO L420 AbstractCegarLoop]: === Iteration 9 === 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-07-12 15:21:41,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:41,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1137603187, now seen corresponding path program 1 times [2022-07-12 15:21:41,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:41,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443235606] [2022-07-12 15:21:41,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:41,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 15:21:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 15:21:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 15:21:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:21:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 15:21:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 15:21:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 15:21:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 15:21:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 15:21:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 15:21:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 15:21:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-07-12 15:21:42,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:42,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443235606] [2022-07-12 15:21:42,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443235606] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:42,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:42,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:21:42,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830081066] [2022-07-12 15:21:42,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:42,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:21:42,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:42,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:21:42,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:21:42,171 INFO L87 Difference]: Start difference. First operand 59707 states and 82954 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 15:21:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:45,384 INFO L93 Difference]: Finished difference Result 60409 states and 84194 transitions. [2022-07-12 15:21:45,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:21:45,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 166 [2022-07-12 15:21:45,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:45,707 INFO L225 Difference]: With dead ends: 60409 [2022-07-12 15:21:45,708 INFO L226 Difference]: Without dead ends: 60407 [2022-07-12 15:21:45,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 15:21:45,735 INFO L413 NwaCegarLoop]: 2163 mSDtfsCounter, 2135 mSDsluCounter, 3688 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 788 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2440 SdHoareTripleChecker+Valid, 5851 SdHoareTripleChecker+Invalid, 3090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 788 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:45,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2440 Valid, 5851 Invalid, 3090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [788 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-12 15:21:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60407 states. [2022-07-12 15:21:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60407 to 59711. [2022-07-12 15:21:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59711 states, 40087 states have (on average 1.2438196921695313) internal successors, (49861), 41105 states have internal predecessors, (49861), 16454 states have call successors, (16454), 3224 states have call predecessors, (16454), 3167 states have return successors, (16642), 15749 states have call predecessors, (16642), 16450 states have call successors, (16642) [2022-07-12 15:21:47,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59711 states to 59711 states and 82957 transitions. [2022-07-12 15:21:47,764 INFO L78 Accepts]: Start accepts. Automaton has 59711 states and 82957 transitions. Word has length 166 [2022-07-12 15:21:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:21:47,764 INFO L495 AbstractCegarLoop]: Abstraction has 59711 states and 82957 transitions. [2022-07-12 15:21:47,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 15:21:47,765 INFO L276 IsEmpty]: Start isEmpty. Operand 59711 states and 82957 transitions. [2022-07-12 15:21:47,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-12 15:21:47,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:47,767 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-12 15:21:47,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 15:21:47,767 INFO L420 AbstractCegarLoop]: === Iteration 10 === 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-07-12 15:21:47,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:47,767 INFO L85 PathProgramCache]: Analyzing trace with hash 2008057463, now seen corresponding path program 1 times [2022-07-12 15:21:47,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:47,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478433471] [2022-07-12 15:21:47,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:47,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:47,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:47,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:47,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:47,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:47,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:47,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:47,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:47,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:47,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:47,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:47,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 15:21:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:47,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:47,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 15:21:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:47,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:47,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 15:21:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:47,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:21:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 15:21:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 15:21:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 15:21:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 15:21:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 15:21:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 15:21:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 15:21:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 15:21:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2022-07-12 15:21:48,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:48,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478433471] [2022-07-12 15:21:48,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478433471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:48,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:48,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:21:48,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885943129] [2022-07-12 15:21:48,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:48,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:21:48,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:48,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:21:48,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:21:48,139 INFO L87 Difference]: Start difference. First operand 59711 states and 82957 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 15:21:51,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:51,694 INFO L93 Difference]: Finished difference Result 60413 states and 84197 transitions. [2022-07-12 15:21:51,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:21:51,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 171 [2022-07-12 15:21:51,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:51,870 INFO L225 Difference]: With dead ends: 60413 [2022-07-12 15:21:51,870 INFO L226 Difference]: Without dead ends: 60411 [2022-07-12 15:21:51,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 15:21:51,892 INFO L413 NwaCegarLoop]: 2163 mSDtfsCounter, 2135 mSDsluCounter, 3688 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 787 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2440 SdHoareTripleChecker+Valid, 5851 SdHoareTripleChecker+Invalid, 3089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 787 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:51,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2440 Valid, 5851 Invalid, 3089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [787 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-12 15:21:51,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60411 states. [2022-07-12 15:21:53,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60411 to 59715. [2022-07-12 15:21:53,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59715 states, 40090 states have (on average 1.2438014467448242) internal successors, (49864), 41108 states have internal predecessors, (49864), 16454 states have call successors, (16454), 3225 states have call predecessors, (16454), 3168 states have return successors, (16642), 15749 states have call predecessors, (16642), 16450 states have call successors, (16642) [2022-07-12 15:21:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59715 states to 59715 states and 82960 transitions. [2022-07-12 15:21:53,879 INFO L78 Accepts]: Start accepts. Automaton has 59715 states and 82960 transitions. Word has length 171 [2022-07-12 15:21:53,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:21:53,879 INFO L495 AbstractCegarLoop]: Abstraction has 59715 states and 82960 transitions. [2022-07-12 15:21:53,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 15:21:53,880 INFO L276 IsEmpty]: Start isEmpty. Operand 59715 states and 82960 transitions. [2022-07-12 15:21:53,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-12 15:21:53,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:21:53,882 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-12 15:21:53,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 15:21:53,883 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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-07-12 15:21:53,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:21:53,883 INFO L85 PathProgramCache]: Analyzing trace with hash -63461491, now seen corresponding path program 1 times [2022-07-12 15:21:53,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:21:53,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070554096] [2022-07-12 15:21:53,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:21:53,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:21:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:21:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:21:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:21:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:21:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:21:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 15:21:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 15:21:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 15:21:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:21:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 15:21:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 15:21:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 15:21:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:21:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 15:21:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 15:21:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 15:21:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 15:21:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 15:21:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 15:21:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:21:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2022-07-12 15:21:54,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:21:54,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070554096] [2022-07-12 15:21:54,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070554096] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:21:54,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:21:54,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:21:54,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584272687] [2022-07-12 15:21:54,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:21:54,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:21:54,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:21:54,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:21:54,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:21:54,334 INFO L87 Difference]: Start difference. First operand 59715 states and 82960 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 15:21:57,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:21:57,900 INFO L93 Difference]: Finished difference Result 60417 states and 84200 transitions. [2022-07-12 15:21:57,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:21:57,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 176 [2022-07-12 15:21:57,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:21:58,072 INFO L225 Difference]: With dead ends: 60417 [2022-07-12 15:21:58,072 INFO L226 Difference]: Without dead ends: 60415 [2022-07-12 15:21:58,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 15:21:58,100 INFO L413 NwaCegarLoop]: 2163 mSDtfsCounter, 2135 mSDsluCounter, 3688 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2440 SdHoareTripleChecker+Valid, 5851 SdHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 15:21:58,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2440 Valid, 5851 Invalid, 3088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-12 15:21:58,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60415 states. [2022-07-12 15:22:00,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60415 to 59719. [2022-07-12 15:22:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59719 states, 40093 states have (on average 1.2437832040505823) internal successors, (49867), 41111 states have internal predecessors, (49867), 16454 states have call successors, (16454), 3226 states have call predecessors, (16454), 3169 states have return successors, (16642), 15749 states have call predecessors, (16642), 16450 states have call successors, (16642) [2022-07-12 15:22:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59719 states to 59719 states and 82963 transitions. [2022-07-12 15:22:00,271 INFO L78 Accepts]: Start accepts. Automaton has 59719 states and 82963 transitions. Word has length 176 [2022-07-12 15:22:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:22:00,279 INFO L495 AbstractCegarLoop]: Abstraction has 59719 states and 82963 transitions. [2022-07-12 15:22:00,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 15:22:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand 59719 states and 82963 transitions. [2022-07-12 15:22:00,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-12 15:22:00,282 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:22:00,282 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:22:00,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 15:22:00,283 INFO L420 AbstractCegarLoop]: === Iteration 12 === 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-07-12 15:22:00,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:22:00,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1397939291, now seen corresponding path program 1 times [2022-07-12 15:22:00,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:22:00,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54538292] [2022-07-12 15:22:00,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:00,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:22:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:22:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:22:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:22:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:22:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 15:22:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 15:22:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 15:22:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:22:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 15:22:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 15:22:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 15:22:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 15:22:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 15:22:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 15:22:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 15:22:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 15:22:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 15:22:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 15:22:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-12 15:22:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 15:22:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2022-07-12 15:22:00,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:22:00,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54538292] [2022-07-12 15:22:00,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54538292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:22:00,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:22:00,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 15:22:00,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134553216] [2022-07-12 15:22:00,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:22:00,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 15:22:00,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:22:00,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 15:22:00,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 15:22:00,439 INFO L87 Difference]: Start difference. First operand 59719 states and 82963 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-12 15:22:07,135 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 15:22:10,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:22:10,454 INFO L93 Difference]: Finished difference Result 149360 states and 208059 transitions. [2022-07-12 15:22:10,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 15:22:10,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 192 [2022-07-12 15:22:10,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:22:10,792 INFO L225 Difference]: With dead ends: 149360 [2022-07-12 15:22:10,792 INFO L226 Difference]: Without dead ends: 89716 [2022-07-12 15:22:10,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 15:22:10,944 INFO L413 NwaCegarLoop]: 3912 mSDtfsCounter, 2510 mSDsluCounter, 3648 mSDsCounter, 0 mSdLazyCounter, 3550 mSolverCounterSat, 2052 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2848 SdHoareTripleChecker+Valid, 7560 SdHoareTripleChecker+Invalid, 5603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2052 IncrementalHoareTripleChecker+Valid, 3550 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-12 15:22:10,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2848 Valid, 7560 Invalid, 5603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2052 Valid, 3550 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-07-12 15:22:11,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89716 states. [2022-07-12 15:22:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89716 to 88631. [2022-07-12 15:22:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88631 states, 59553 states have (on average 1.2434470135845381) internal successors, (74051), 61007 states have internal predecessors, (74051), 24380 states have call successors, (24380), 4772 states have call predecessors, (24380), 4695 states have return successors, (24664), 23403 states have call predecessors, (24664), 24376 states have call successors, (24664) [2022-07-12 15:22:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88631 states to 88631 states and 123095 transitions. [2022-07-12 15:22:14,897 INFO L78 Accepts]: Start accepts. Automaton has 88631 states and 123095 transitions. Word has length 192 [2022-07-12 15:22:14,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:22:14,897 INFO L495 AbstractCegarLoop]: Abstraction has 88631 states and 123095 transitions. [2022-07-12 15:22:14,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-12 15:22:14,898 INFO L276 IsEmpty]: Start isEmpty. Operand 88631 states and 123095 transitions. [2022-07-12 15:22:14,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-12 15:22:14,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:22:14,900 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 7, 7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-12 15:22:14,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 15:22:14,900 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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-07-12 15:22:14,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:22:14,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1448813577, now seen corresponding path program 1 times [2022-07-12 15:22:14,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:22:14,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932070260] [2022-07-12 15:22:14,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:14,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:22:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:14,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:14,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:14,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:22:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:14,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:22:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:22:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:22:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 15:22:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 15:22:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 15:22:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:22:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 15:22:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 15:22:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 15:22:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 15:22:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 15:22:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 15:22:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 15:22:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 15:22:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 15:22:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 15:22:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:15,084 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2022-07-12 15:22:15,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:22:15,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932070260] [2022-07-12 15:22:15,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932070260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:22:15,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:22:15,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 15:22:15,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056034682] [2022-07-12 15:22:15,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:22:15,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 15:22:15,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:22:15,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 15:22:15,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 15:22:15,086 INFO L87 Difference]: Start difference. First operand 88631 states and 123095 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 15:22:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 15:22:19,440 INFO L93 Difference]: Finished difference Result 89681 states and 124949 transitions. [2022-07-12 15:22:19,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 15:22:19,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 181 [2022-07-12 15:22:19,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 15:22:19,695 INFO L225 Difference]: With dead ends: 89681 [2022-07-12 15:22:19,695 INFO L226 Difference]: Without dead ends: 89679 [2022-07-12 15:22:19,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 15:22:19,728 INFO L413 NwaCegarLoop]: 2163 mSDtfsCounter, 2135 mSDsluCounter, 3688 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 785 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2440 SdHoareTripleChecker+Valid, 5851 SdHoareTripleChecker+Invalid, 3087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 785 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 15:22:19,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2440 Valid, 5851 Invalid, 3087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [785 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-12 15:22:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89679 states. [2022-07-12 15:22:23,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89679 to 88635. [2022-07-12 15:22:23,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88635 states, 59556 states have (on average 1.2434347504869367) internal successors, (74054), 61010 states have internal predecessors, (74054), 24380 states have call successors, (24380), 4773 states have call predecessors, (24380), 4696 states have return successors, (24664), 23403 states have call predecessors, (24664), 24376 states have call successors, (24664) [2022-07-12 15:22:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88635 states to 88635 states and 123098 transitions. [2022-07-12 15:22:23,577 INFO L78 Accepts]: Start accepts. Automaton has 88635 states and 123098 transitions. Word has length 181 [2022-07-12 15:22:23,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 15:22:23,578 INFO L495 AbstractCegarLoop]: Abstraction has 88635 states and 123098 transitions. [2022-07-12 15:22:23,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 15:22:23,578 INFO L276 IsEmpty]: Start isEmpty. Operand 88635 states and 123098 transitions. [2022-07-12 15:22:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-12 15:22:23,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 15:22:23,581 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 7, 7, 7, 7, 7, 7, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 15:22:23,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 15:22:23,581 INFO L420 AbstractCegarLoop]: === Iteration 14 === 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-07-12 15:22:23,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 15:22:23,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2018843187, now seen corresponding path program 1 times [2022-07-12 15:22:23,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 15:22:23,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542988811] [2022-07-12 15:22:23,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 15:22:23,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 15:22:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 15:22:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 15:22:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 15:22:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 15:22:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 15:22:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 15:22:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 15:22:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 15:22:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 15:22:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 15:22:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 15:22:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 15:22:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 15:22:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 15:22:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 15:22:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 15:22:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 15:22:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 15:22:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-07-12 15:22:23,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 15:22:23,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542988811] [2022-07-12 15:22:23,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542988811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 15:22:23,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 15:22:23,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 15:22:23,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267260203] [2022-07-12 15:22:23,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 15:22:23,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 15:22:23,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 15:22:23,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 15:22:23,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 15:22:23,760 INFO L87 Difference]: Start difference. First operand 88635 states and 123098 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18)