./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-ethernet-hp-hp100.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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-ethernet-hp-hp100.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 6b2cae6d498f7aa4576ffcfd28b3f955c7840001d7c2abb7c90b6970c97881d1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 02:18:19,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 02:18:19,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 02:18:19,688 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 02:18:19,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 02:18:19,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 02:18:19,691 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 02:18:19,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 02:18:19,695 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 02:18:19,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 02:18:19,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 02:18:19,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 02:18:19,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 02:18:19,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 02:18:19,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 02:18:19,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 02:18:19,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 02:18:19,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 02:18:19,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 02:18:19,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 02:18:19,718 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 02:18:19,718 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 02:18:19,719 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 02:18:19,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 02:18:19,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 02:18:19,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 02:18:19,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 02:18:19,728 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 02:18:19,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 02:18:19,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 02:18:19,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 02:18:19,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 02:18:19,733 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 02:18:19,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 02:18:19,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 02:18:19,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 02:18:19,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 02:18:19,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 02:18:19,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 02:18:19,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 02:18:19,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 02:18:19,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 02:18:19,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 02:18:19,767 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 02:18:19,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 02:18:19,768 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 02:18:19,768 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 02:18:19,769 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 02:18:19,769 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 02:18:19,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 02:18:19,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 02:18:19,770 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 02:18:19,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 02:18:19,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 02:18:19,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 02:18:19,771 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 02:18:19,771 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 02:18:19,772 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 02:18:19,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 02:18:19,772 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 02:18:19,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 02:18:19,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 02:18:19,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 02:18:19,774 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 02:18:19,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 02:18:19,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 02:18:19,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 02:18:19,775 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 02:18:19,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 02:18:19,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 02:18:19,776 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 02:18:19,776 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 02:18:19,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 02:18:19,776 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 -> 6b2cae6d498f7aa4576ffcfd28b3f955c7840001d7c2abb7c90b6970c97881d1 [2022-07-20 02:18:19,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 02:18:20,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 02:18:20,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 02:18:20,012 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 02:18:20,015 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 02:18:20,016 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-ethernet-hp-hp100.cil.i [2022-07-20 02:18:20,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97f72514a/99f158f27731446b9086fed5f83e1a9d/FLAG2b99a1169 [2022-07-20 02:18:20,869 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 02:18:20,870 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-ethernet-hp-hp100.cil.i [2022-07-20 02:18:20,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97f72514a/99f158f27731446b9086fed5f83e1a9d/FLAG2b99a1169 [2022-07-20 02:18:20,943 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97f72514a/99f158f27731446b9086fed5f83e1a9d [2022-07-20 02:18:20,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 02:18:20,947 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 02:18:20,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 02:18:20,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 02:18:20,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 02:18:20,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:18:20" (1/1) ... [2022-07-20 02:18:20,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e816f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:18:20, skipping insertion in model container [2022-07-20 02:18:20,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:18:20" (1/1) ... [2022-07-20 02:18:20,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 02:18:21,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 02:18:23,141 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-ethernet-hp-hp100.cil.i[314801,314814] [2022-07-20 02:18:23,145 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-ethernet-hp-hp100.cil.i[314970,314983] [2022-07-20 02:18:23,146 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-ethernet-hp-hp100.cil.i[315137,315150] [2022-07-20 02:18:23,146 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-ethernet-hp-hp100.cil.i[315305,315318] [2022-07-20 02:18:23,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 02:18:23,223 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 02:18:23,474 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-ethernet-hp-hp100.cil.i[314801,314814] [2022-07-20 02:18:23,475 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-ethernet-hp-hp100.cil.i[314970,314983] [2022-07-20 02:18:23,475 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-ethernet-hp-hp100.cil.i[315137,315150] [2022-07-20 02:18:23,476 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-ethernet-hp-hp100.cil.i[315305,315318] [2022-07-20 02:18:23,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 02:18:23,649 INFO L208 MainTranslator]: Completed translation [2022-07-20 02:18:23,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:18:23 WrapperNode [2022-07-20 02:18:23,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 02:18:23,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 02:18:23,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 02:18:23,651 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 02:18:23,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:18:23" (1/1) ... [2022-07-20 02:18:23,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:18:23" (1/1) ... [2022-07-20 02:18:23,915 INFO L137 Inliner]: procedures = 391, calls = 1784, calls flagged for inlining = 177, calls inlined = 156, statements flattened = 4311 [2022-07-20 02:18:23,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 02:18:23,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 02:18:23,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 02:18:23,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 02:18:23,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:18:23" (1/1) ... [2022-07-20 02:18:23,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:18:23" (1/1) ... [2022-07-20 02:18:23,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:18:23" (1/1) ... [2022-07-20 02:18:23,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:18:23" (1/1) ... [2022-07-20 02:18:24,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:18:23" (1/1) ... [2022-07-20 02:18:24,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:18:23" (1/1) ... [2022-07-20 02:18:24,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:18:23" (1/1) ... [2022-07-20 02:18:24,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 02:18:24,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 02:18:24,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 02:18:24,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 02:18:24,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:18:23" (1/1) ... [2022-07-20 02:18:24,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 02:18:24,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 02:18:24,192 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-20 02:18:24,199 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-20 02:18:24,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-20 02:18:24,231 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-20 02:18:24,231 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_alloc_skb [2022-07-20 02:18:24,232 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_alloc_skb [2022-07-20 02:18:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 02:18:24,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 02:18:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 02:18:24,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 02:18:24,232 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2022-07-20 02:18:24,233 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2022-07-20 02:18:24,233 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_66 [2022-07-20 02:18:24,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_66 [2022-07-20 02:18:24,233 INFO L130 BoogieDeclarations]: Found specification of procedure dev_trans_start [2022-07-20 02:18:24,233 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_trans_start [2022-07-20 02:18:24,233 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_open [2022-07-20 02:18:24,233 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_open [2022-07-20 02:18:24,234 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_load_eeprom [2022-07-20 02:18:24,234 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_load_eeprom [2022-07-20 02:18:24,234 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-20 02:18:24,234 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_sense_lan [2022-07-20 02:18:24,234 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_sense_lan [2022-07-20 02:18:24,234 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-20 02:18:24,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-20 02:18:24,235 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2022-07-20 02:18:24,235 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2022-07-20 02:18:24,235 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2022-07-20 02:18:24,235 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2022-07-20 02:18:24,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-20 02:18:24,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-20 02:18:24,236 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_single [2022-07-20 02:18:24,236 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_single [2022-07-20 02:18:24,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 02:18:24,236 INFO L130 BoogieDeclarations]: Found specification of procedure iounmap [2022-07-20 02:18:24,236 INFO L138 BoogieDeclarations]: Found implementation of procedure iounmap [2022-07-20 02:18:24,236 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_word [2022-07-20 02:18:24,236 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_word [2022-07-20 02:18:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-20 02:18:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-20 02:18:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_cascade_reset [2022-07-20 02:18:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_cascade_reset [2022-07-20 02:18:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-20 02:18:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-20 02:18:24,238 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-20 02:18:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-20 02:18:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-20 02:18:24,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-20 02:18:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 02:18:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-20 02:18:24,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-20 02:18:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-20 02:18:24,240 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-20 02:18:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_rx_bm [2022-07-20 02:18:24,241 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_rx_bm [2022-07-20 02:18:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_BM_shutdown [2022-07-20 02:18:24,243 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_BM_shutdown [2022-07-20 02:18:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-07-20 02:18:24,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-07-20 02:18:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-20 02:18:24,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-20 02:18:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure wait [2022-07-20 02:18:24,244 INFO L138 BoogieDeclarations]: Found implementation of procedure wait [2022-07-20 02:18:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2022-07-20 02:18:24,244 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2022-07-20 02:18:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_hwinit [2022-07-20 02:18:24,245 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_hwinit [2022-07-20 02:18:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-20 02:18:24,246 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-20 02:18:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure virt_to_whatever [2022-07-20 02:18:24,246 INFO L138 BoogieDeclarations]: Found implementation of procedure virt_to_whatever [2022-07-20 02:18:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_close [2022-07-20 02:18:24,246 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_close [2022-07-20 02:18:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-07-20 02:18:24,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-07-20 02:18:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 02:18:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_stop_interface [2022-07-20 02:18:24,247 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_stop_interface [2022-07-20 02:18:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_check_lan [2022-07-20 02:18:24,247 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_check_lan [2022-07-20 02:18:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_1 [2022-07-20 02:18:24,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_1 [2022-07-20 02:18:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 02:18:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-20 02:18:24,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-20 02:18:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-20 02:18:24,249 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-20 02:18:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 02:18:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-20 02:18:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 02:18:24,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 02:18:24,250 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-20 02:18:24,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-20 02:18:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2022-07-20 02:18:24,251 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2022-07-20 02:18:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_rxfill [2022-07-20 02:18:24,251 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_rxfill [2022-07-20 02:18:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-20 02:18:24,251 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-20 02:18:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-20 02:18:24,252 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-20 02:18:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-20 02:18:24,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-20 02:18:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 02:18:24,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 02:18:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_update_stats [2022-07-20 02:18:24,253 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_update_stats [2022-07-20 02:18:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-20 02:18:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-20 02:18:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 02:18:24,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 02:18:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 02:18:24,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 02:18:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure pci_map_single [2022-07-20 02:18:24,254 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_map_single [2022-07-20 02:18:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-20 02:18:24,255 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-20 02:18:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-20 02:18:24,255 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-20 02:18:24,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 02:18:24,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 02:18:24,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 02:18:24,256 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-20 02:18:24,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-20 02:18:24,256 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2022-07-20 02:18:24,256 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2022-07-20 02:18:24,256 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-20 02:18:24,256 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-20 02:18:24,256 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-07-20 02:18:24,256 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-07-20 02:18:24,256 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-20 02:18:24,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-20 02:18:24,256 INFO L130 BoogieDeclarations]: Found specification of procedure outl [2022-07-20 02:18:24,257 INFO L138 BoogieDeclarations]: Found implementation of procedure outl [2022-07-20 02:18:24,257 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_pci_remove [2022-07-20 02:18:24,257 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_pci_remove [2022-07-20 02:18:24,257 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_build_rx_pdl [2022-07-20 02:18:24,257 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_build_rx_pdl [2022-07-20 02:18:24,257 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-07-20 02:18:24,257 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-07-20 02:18:24,257 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-20 02:18:24,257 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-20 02:18:24,257 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-20 02:18:24,257 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-20 02:18:24,257 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_lock_of_hp100_private [2022-07-20 02:18:24,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_lock_of_hp100_private [2022-07-20 02:18:24,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 02:18:24,257 INFO L130 BoogieDeclarations]: Found specification of procedure eth_type_trans [2022-07-20 02:18:24,257 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_type_trans [2022-07-20 02:18:24,258 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 02:18:24,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 02:18:24,258 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_lock_of_hp100_private [2022-07-20 02:18:24,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_lock_of_hp100_private [2022-07-20 02:18:24,258 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_80 [2022-07-20 02:18:24,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_80 [2022-07-20 02:18:24,258 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_interruptible [2022-07-20 02:18:24,258 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_interruptible [2022-07-20 02:18:24,258 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-20 02:18:24,258 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-20 02:18:24,258 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-20 02:18:24,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-20 02:18:24,258 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_set_multicast_list [2022-07-20 02:18:24,258 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_set_multicast_list [2022-07-20 02:18:24,258 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_start_interface [2022-07-20 02:18:24,258 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_start_interface [2022-07-20 02:18:24,259 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-07-20 02:18:24,259 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-07-20 02:18:24,259 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_clean_txring [2022-07-20 02:18:24,259 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_clean_txring [2022-07-20 02:18:24,259 INFO L130 BoogieDeclarations]: Found specification of procedure inl [2022-07-20 02:18:24,259 INFO L138 BoogieDeclarations]: Found implementation of procedure inl [2022-07-20 02:18:24,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 02:18:24,259 INFO L130 BoogieDeclarations]: Found specification of procedure inw [2022-07-20 02:18:24,259 INFO L138 BoogieDeclarations]: Found implementation of procedure inw [2022-07-20 02:18:24,259 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-07-20 02:18:24,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-07-20 02:18:24,259 INFO L130 BoogieDeclarations]: Found specification of procedure hp100_login_to_vg_hub [2022-07-20 02:18:24,259 INFO L138 BoogieDeclarations]: Found implementation of procedure hp100_login_to_vg_hub [2022-07-20 02:18:24,259 INFO L130 BoogieDeclarations]: Found specification of procedure preempt_count [2022-07-20 02:18:24,259 INFO L138 BoogieDeclarations]: Found implementation of procedure preempt_count [2022-07-20 02:18:24,871 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 02:18:24,875 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 02:18:25,158 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 02:18:27,180 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2022-07-20 02:18:27,181 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 02:18:27,330 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L8563: SUMMARY for call #t~ret698#1 := schedule_timeout_interruptible(1); srcloc: null [2022-07-20 02:18:27,330 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L8563-1: assume -9223372036854775808 <= #t~ret698#1 && #t~ret698#1 <= 9223372036854775807;havoc #t~ret698#1; [2022-07-20 02:18:27,330 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume 0 == (if 0 == ~tmp___4~7#1 then 0 else (if 1 == ~tmp___4~7#1 then 0 else ~bitwiseAnd(~tmp___4~7#1, 2096896))) % 18446744073709551616; [2022-07-20 02:18:27,330 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !(0 == (if 0 == ~tmp___4~7#1 then 0 else (if 1 == ~tmp___4~7#1 then 0 else ~bitwiseAnd(~tmp___4~7#1, 2096896))) % 18446744073709551616); [2022-07-20 02:18:27,330 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L8567: assume (if (~jiffies~0 - ~time~2#1) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (~jiffies~0 - ~time~2#1) % 18446744073709551616 % 18446744073709551616 else (~jiffies~0 - ~time~2#1) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616) < 0; [2022-07-20 02:18:27,330 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L8567: assume !((if (~jiffies~0 - ~time~2#1) % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then (~jiffies~0 - ~time~2#1) % 18446744073709551616 % 18446744073709551616 else (~jiffies~0 - ~time~2#1) % 18446744073709551616 % 18446744073709551616 - 18446744073709551616) < 0); [2022-07-20 02:18:27,394 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 02:18:27,415 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 02:18:27,415 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-20 02:18:27,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:18:27 BoogieIcfgContainer [2022-07-20 02:18:27,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 02:18:27,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 02:18:27,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 02:18:27,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 02:18:27,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 02:18:20" (1/3) ... [2022-07-20 02:18:27,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63969f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:18:27, skipping insertion in model container [2022-07-20 02:18:27,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:18:23" (2/3) ... [2022-07-20 02:18:27,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63969f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:18:27, skipping insertion in model container [2022-07-20 02:18:27,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:18:27" (3/3) ... [2022-07-20 02:18:27,429 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-ethernet-hp-hp100.cil.i [2022-07-20 02:18:27,441 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 02:18:27,441 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-20 02:18:27,539 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 02:18:27,544 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@2674391f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58460a9b [2022-07-20 02:18:27,544 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-20 02:18:27,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 1799 states, 1150 states have (on average 1.3217391304347825) internal successors, (1520), 1200 states have internal predecessors, (1520), 568 states have call successors, (568), 80 states have call predecessors, (568), 79 states have return successors, (563), 547 states have call predecessors, (563), 563 states have call successors, (563) [2022-07-20 02:18:27,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-20 02:18:27,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:18:27,562 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:27,563 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-20 02:18:27,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:18:27,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1256620244, now seen corresponding path program 1 times [2022-07-20 02:18:27,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:18:27,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108464012] [2022-07-20 02:18:27,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:18:27,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:18:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:28,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:18:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:28,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:28,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:18:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:28,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:28,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:18:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:28,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:28,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:18:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:28,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:28,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:18:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:28,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 02:18:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-20 02:18:28,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:18:28,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108464012] [2022-07-20 02:18:28,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108464012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:18:28,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:18:28,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 02:18:28,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213328385] [2022-07-20 02:18:28,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:18:28,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 02:18:28,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:18:28,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 02:18:28,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 02:18:28,249 INFO L87 Difference]: Start difference. First operand has 1799 states, 1150 states have (on average 1.3217391304347825) internal successors, (1520), 1200 states have internal predecessors, (1520), 568 states have call successors, (568), 80 states have call predecessors, (568), 79 states have return successors, (563), 547 states have call predecessors, (563), 563 states have call successors, (563) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-20 02:18:34,971 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:18:35,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:18:35,518 INFO L93 Difference]: Finished difference Result 5452 states and 8256 transitions. [2022-07-20 02:18:35,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 02:18:35,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2022-07-20 02:18:35,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:18:35,575 INFO L225 Difference]: With dead ends: 5452 [2022-07-20 02:18:35,575 INFO L226 Difference]: Without dead ends: 3656 [2022-07-20 02:18:35,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-20 02:18:35,599 INFO L413 NwaCegarLoop]: 2523 mSDtfsCounter, 3273 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 2123 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3816 SdHoareTripleChecker+Valid, 4422 SdHoareTripleChecker+Invalid, 4754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2123 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-20 02:18:35,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3816 Valid, 4422 Invalid, 4754 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2123 Valid, 2630 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-07-20 02:18:35,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2022-07-20 02:18:35,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3484. [2022-07-20 02:18:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 2231 states have (on average 1.2823845809054235) internal successors, (2861), 2327 states have internal predecessors, (2861), 1095 states have call successors, (1095), 156 states have call predecessors, (1095), 155 states have return successors, (1092), 1060 states have call predecessors, (1092), 1092 states have call successors, (1092) [2022-07-20 02:18:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 5048 transitions. [2022-07-20 02:18:35,911 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 5048 transitions. Word has length 68 [2022-07-20 02:18:35,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:18:35,912 INFO L495 AbstractCegarLoop]: Abstraction has 3484 states and 5048 transitions. [2022-07-20 02:18:35,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-20 02:18:35,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 5048 transitions. [2022-07-20 02:18:35,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-20 02:18:35,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:18:35,916 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:35,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 02:18:35,916 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-20 02:18:35,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:18:35,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1472747592, now seen corresponding path program 1 times [2022-07-20 02:18:35,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:18:35,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763009342] [2022-07-20 02:18:35,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:18:35,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:18:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:36,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:18:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:36,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:36,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:18:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:36,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:36,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:18:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:36,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:36,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:18:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:36,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:36,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:18:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:36,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 02:18:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-20 02:18:36,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:18:36,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763009342] [2022-07-20 02:18:36,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763009342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:18:36,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:18:36,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 02:18:36,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697827662] [2022-07-20 02:18:36,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:18:36,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 02:18:36,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:18:36,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 02:18:36,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 02:18:36,105 INFO L87 Difference]: Start difference. First operand 3484 states and 5048 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-20 02:18:42,790 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:18:43,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:18:43,479 INFO L93 Difference]: Finished difference Result 10244 states and 14936 transitions. [2022-07-20 02:18:43,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 02:18:43,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 73 [2022-07-20 02:18:43,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:18:43,528 INFO L225 Difference]: With dead ends: 10244 [2022-07-20 02:18:43,528 INFO L226 Difference]: Without dead ends: 6773 [2022-07-20 02:18:43,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-20 02:18:43,548 INFO L413 NwaCegarLoop]: 2807 mSDtfsCounter, 2768 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 2551 mSolverCounterSat, 1959 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3265 SdHoareTripleChecker+Valid, 4797 SdHoareTripleChecker+Invalid, 4511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1959 IncrementalHoareTripleChecker+Valid, 2551 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-20 02:18:43,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3265 Valid, 4797 Invalid, 4511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1959 Valid, 2551 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2022-07-20 02:18:43,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2022-07-20 02:18:43,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6480. [2022-07-20 02:18:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6480 states, 4124 states have (on average 1.2839476236663434) internal successors, (5295), 4310 states have internal predecessors, (5295), 2060 states have call successors, (2060), 294 states have call predecessors, (2060), 293 states have return successors, (2079), 1983 states have call predecessors, (2079), 2057 states have call successors, (2079) [2022-07-20 02:18:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6480 states to 6480 states and 9434 transitions. [2022-07-20 02:18:43,918 INFO L78 Accepts]: Start accepts. Automaton has 6480 states and 9434 transitions. Word has length 73 [2022-07-20 02:18:43,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:18:43,921 INFO L495 AbstractCegarLoop]: Abstraction has 6480 states and 9434 transitions. [2022-07-20 02:18:43,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-20 02:18:43,921 INFO L276 IsEmpty]: Start isEmpty. Operand 6480 states and 9434 transitions. [2022-07-20 02:18:43,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-20 02:18:43,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:18:43,926 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:43,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 02:18:43,927 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-20 02:18:43,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:18:43,928 INFO L85 PathProgramCache]: Analyzing trace with hash -552311738, now seen corresponding path program 1 times [2022-07-20 02:18:43,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:18:43,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129767634] [2022-07-20 02:18:43,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:18:43,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:18:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:44,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:18:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:44,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:44,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:18:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:44,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:44,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:18:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:44,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:44,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:18:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:44,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:44,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:18:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:44,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-20 02:18:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-20 02:18:44,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:18:44,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129767634] [2022-07-20 02:18:44,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129767634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:18:44,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:18:44,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 02:18:44,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823386889] [2022-07-20 02:18:44,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:18:44,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 02:18:44,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:18:44,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 02:18:44,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 02:18:44,177 INFO L87 Difference]: Start difference. First operand 6480 states and 9434 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-20 02:18:49,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:18:49,167 INFO L93 Difference]: Finished difference Result 19266 states and 28132 transitions. [2022-07-20 02:18:49,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 02:18:49,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 76 [2022-07-20 02:18:49,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:18:49,261 INFO L225 Difference]: With dead ends: 19266 [2022-07-20 02:18:49,261 INFO L226 Difference]: Without dead ends: 12799 [2022-07-20 02:18:49,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-20 02:18:49,298 INFO L413 NwaCegarLoop]: 2473 mSDtfsCounter, 3080 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 2600 mSolverCounterSat, 2116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3587 SdHoareTripleChecker+Valid, 4352 SdHoareTripleChecker+Invalid, 4716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2116 IncrementalHoareTripleChecker+Valid, 2600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-20 02:18:49,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3587 Valid, 4352 Invalid, 4716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2116 Valid, 2600 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-20 02:18:49,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12799 states. [2022-07-20 02:18:50,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12799 to 12258. [2022-07-20 02:18:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12258 states, 7780 states have (on average 1.2816195372750643) internal successors, (9971), 8136 states have internal predecessors, (9971), 3906 states have call successors, (3906), 572 states have call predecessors, (3906), 569 states have return successors, (3949), 3753 states have call predecessors, (3949), 3903 states have call successors, (3949) [2022-07-20 02:18:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12258 states to 12258 states and 17826 transitions. [2022-07-20 02:18:50,100 INFO L78 Accepts]: Start accepts. Automaton has 12258 states and 17826 transitions. Word has length 76 [2022-07-20 02:18:50,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:18:50,101 INFO L495 AbstractCegarLoop]: Abstraction has 12258 states and 17826 transitions. [2022-07-20 02:18:50,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-20 02:18:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand 12258 states and 17826 transitions. [2022-07-20 02:18:50,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-20 02:18:50,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:18:50,105 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:18:50,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 02:18:50,106 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-20 02:18:50,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:18:50,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1165706419, now seen corresponding path program 1 times [2022-07-20 02:18:50,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:18:50,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508065820] [2022-07-20 02:18:50,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:18:50,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:18:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:50,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:18:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:50,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:50,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:18:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:50,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:50,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:18:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:50,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:50,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:18:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:50,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:50,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:18:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:50,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 02:18:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:50,308 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-20 02:18:50,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:18:50,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508065820] [2022-07-20 02:18:50,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508065820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:18:50,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:18:50,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 02:18:50,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695152582] [2022-07-20 02:18:50,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:18:50,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 02:18:50,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:18:50,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 02:18:50,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 02:18:50,310 INFO L87 Difference]: Start difference. First operand 12258 states and 17826 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-20 02:18:54,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:18:56,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:18:56,227 INFO L93 Difference]: Finished difference Result 21372 states and 31042 transitions. [2022-07-20 02:18:56,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 02:18:56,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 79 [2022-07-20 02:18:56,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:18:56,299 INFO L225 Difference]: With dead ends: 21372 [2022-07-20 02:18:56,299 INFO L226 Difference]: Without dead ends: 9127 [2022-07-20 02:18:56,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-20 02:18:56,440 INFO L413 NwaCegarLoop]: 3131 mSDtfsCounter, 1944 mSDsluCounter, 2008 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 1332 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2399 SdHoareTripleChecker+Valid, 5139 SdHoareTripleChecker+Invalid, 3825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1332 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-20 02:18:56,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2399 Valid, 5139 Invalid, 3825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1332 Valid, 2492 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-07-20 02:18:56,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9127 states. [2022-07-20 02:18:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9127 to 8658. [2022-07-20 02:18:56,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8658 states, 5547 states have (on average 1.2714981070849107) internal successors, (7053), 5799 states have internal predecessors, (7053), 2669 states have call successors, (2669), 441 states have call predecessors, (2669), 439 states have return successors, (2689), 2560 states have call predecessors, (2689), 2666 states have call successors, (2689) [2022-07-20 02:18:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8658 states to 8658 states and 12411 transitions. [2022-07-20 02:18:56,895 INFO L78 Accepts]: Start accepts. Automaton has 8658 states and 12411 transitions. Word has length 79 [2022-07-20 02:18:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:18:56,896 INFO L495 AbstractCegarLoop]: Abstraction has 8658 states and 12411 transitions. [2022-07-20 02:18:56,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-20 02:18:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 8658 states and 12411 transitions. [2022-07-20 02:18:56,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-20 02:18:56,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:18:56,900 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 02:18:56,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 02:18:56,901 INFO L420 AbstractCegarLoop]: === Iteration 5 === 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-20 02:18:56,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:18:56,901 INFO L85 PathProgramCache]: Analyzing trace with hash 702077142, now seen corresponding path program 1 times [2022-07-20 02:18:56,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:18:56,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492379995] [2022-07-20 02:18:56,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:18:56,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:18:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:57,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:18:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:57,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:57,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:18:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:57,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:57,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:18:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:57,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:57,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:18:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:57,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:57,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:18:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:57,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:18:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:57,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 02:18:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:57,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:18:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:57,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 02:18:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:57,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 02:18:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:57,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 02:18:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:18:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-07-20 02:18:57,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:18:57,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492379995] [2022-07-20 02:18:57,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492379995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:18:57,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:18:57,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 02:18:57,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850347224] [2022-07-20 02:18:57,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:18:57,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 02:18:57,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:18:57,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 02:18:57,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 02:18:57,101 INFO L87 Difference]: Start difference. First operand 8658 states and 12411 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 02:18:59,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:18:59,878 INFO L93 Difference]: Finished difference Result 17703 states and 25466 transitions. [2022-07-20 02:18:59,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 02:18:59,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2022-07-20 02:18:59,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:18:59,941 INFO L225 Difference]: With dead ends: 17703 [2022-07-20 02:18:59,941 INFO L226 Difference]: Without dead ends: 9099 [2022-07-20 02:18:59,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 02:18:59,984 INFO L413 NwaCegarLoop]: 2279 mSDtfsCounter, 768 mSDsluCounter, 1907 mSDsCounter, 0 mSdLazyCounter, 2056 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 4186 SdHoareTripleChecker+Invalid, 2638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 2056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-20 02:18:59,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 4186 Invalid, 2638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 2056 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-20 02:19:00,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9099 states. [2022-07-20 02:19:00,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9099 to 8658. [2022-07-20 02:19:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8658 states, 5547 states have (on average 1.2700558860645395) internal successors, (7045), 5799 states have internal predecessors, (7045), 2669 states have call successors, (2669), 441 states have call predecessors, (2669), 439 states have return successors, (2689), 2560 states have call predecessors, (2689), 2666 states have call successors, (2689) [2022-07-20 02:19:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8658 states to 8658 states and 12403 transitions. [2022-07-20 02:19:00,444 INFO L78 Accepts]: Start accepts. Automaton has 8658 states and 12403 transitions. Word has length 107 [2022-07-20 02:19:00,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:19:00,446 INFO L495 AbstractCegarLoop]: Abstraction has 8658 states and 12403 transitions. [2022-07-20 02:19:00,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-20 02:19:00,447 INFO L276 IsEmpty]: Start isEmpty. Operand 8658 states and 12403 transitions. [2022-07-20 02:19:00,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-20 02:19:00,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:19:00,449 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-20 02:19:00,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 02:19:00,450 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-20 02:19:00,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:19:00,450 INFO L85 PathProgramCache]: Analyzing trace with hash -288027847, now seen corresponding path program 1 times [2022-07-20 02:19:00,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:19:00,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333531401] [2022-07-20 02:19:00,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:19:00,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:19:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:00,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:19:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:00,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:00,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:19:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:00,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:00,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:19:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:00,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:00,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:19:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:00,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:00,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:19:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:00,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:19:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:00,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 02:19:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:00,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:19:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:00,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 02:19:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:00,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:00,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 02:19:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:00,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 02:19:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:00,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 02:19:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-20 02:19:00,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:19:00,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333531401] [2022-07-20 02:19:00,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333531401] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:19:00,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:19:00,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 02:19:00,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082624826] [2022-07-20 02:19:00,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:19:00,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 02:19:00,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:19:00,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 02:19:00,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 02:19:00,647 INFO L87 Difference]: Start difference. First operand 8658 states and 12403 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-20 02:19:06,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:19:07,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:19:07,352 INFO L93 Difference]: Finished difference Result 26375 states and 38008 transitions. [2022-07-20 02:19:07,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 02:19:07,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2022-07-20 02:19:07,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:19:07,445 INFO L225 Difference]: With dead ends: 26375 [2022-07-20 02:19:07,446 INFO L226 Difference]: Without dead ends: 17771 [2022-07-20 02:19:07,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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-20 02:19:07,487 INFO L413 NwaCegarLoop]: 2624 mSDtfsCounter, 3212 mSDsluCounter, 1966 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 2123 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3749 SdHoareTripleChecker+Valid, 4590 SdHoareTripleChecker+Invalid, 4755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2123 IncrementalHoareTripleChecker+Valid, 2631 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-20 02:19:07,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3749 Valid, 4590 Invalid, 4755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2123 Valid, 2631 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-07-20 02:19:07,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17771 states. [2022-07-20 02:19:08,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17771 to 16867. [2022-07-20 02:19:08,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16867 states, 10788 states have (on average 1.2728958101594363) internal successors, (13732), 11270 states have internal predecessors, (13732), 5223 states have call successors, (5223), 856 states have call predecessors, (5223), 853 states have return successors, (5266), 5026 states have call predecessors, (5266), 5220 states have call successors, (5266) [2022-07-20 02:19:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16867 states to 16867 states and 24221 transitions. [2022-07-20 02:19:08,323 INFO L78 Accepts]: Start accepts. Automaton has 16867 states and 24221 transitions. Word has length 123 [2022-07-20 02:19:08,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:19:08,325 INFO L495 AbstractCegarLoop]: Abstraction has 16867 states and 24221 transitions. [2022-07-20 02:19:08,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-20 02:19:08,325 INFO L276 IsEmpty]: Start isEmpty. Operand 16867 states and 24221 transitions. [2022-07-20 02:19:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-20 02:19:08,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:19:08,327 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-20 02:19:08,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 02:19:08,327 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-20 02:19:08,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:19:08,328 INFO L85 PathProgramCache]: Analyzing trace with hash 134673979, now seen corresponding path program 1 times [2022-07-20 02:19:08,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:19:08,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612651617] [2022-07-20 02:19:08,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:19:08,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:19:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:08,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:19:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:08,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:08,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:19:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:08,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:08,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:19:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:08,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:08,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:19:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:08,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:08,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:19:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:08,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:19:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:08,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 02:19:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:08,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:19:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:08,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 02:19:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:08,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:08,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 02:19:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:08,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 02:19:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:08,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 02:19:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:08,576 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-20 02:19:08,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:19:08,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612651617] [2022-07-20 02:19:08,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612651617] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:19:08,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:19:08,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 02:19:08,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842054035] [2022-07-20 02:19:08,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:19:08,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 02:19:08,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:19:08,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 02:19:08,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:19:08,578 INFO L87 Difference]: Start difference. First operand 16867 states and 24221 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 02:19:14,456 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:19:15,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:19:15,369 INFO L93 Difference]: Finished difference Result 17755 states and 25634 transitions. [2022-07-20 02:19:15,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 02:19:15,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2022-07-20 02:19:15,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:19:15,453 INFO L225 Difference]: With dead ends: 17755 [2022-07-20 02:19:15,453 INFO L226 Difference]: Without dead ends: 17753 [2022-07-20 02:19:15,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 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-20 02:19:15,469 INFO L413 NwaCegarLoop]: 2266 mSDtfsCounter, 2529 mSDsluCounter, 3073 mSDsCounter, 0 mSdLazyCounter, 3531 mSolverCounterSat, 1584 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2742 SdHoareTripleChecker+Valid, 5339 SdHoareTripleChecker+Invalid, 5116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1584 IncrementalHoareTripleChecker+Valid, 3531 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-20 02:19:15,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2742 Valid, 5339 Invalid, 5116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1584 Valid, 3531 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-07-20 02:19:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17753 states. [2022-07-20 02:19:16,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17753 to 16871. [2022-07-20 02:19:16,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16871 states, 10791 states have (on average 1.272819942544713) internal successors, (13735), 11273 states have internal predecessors, (13735), 5223 states have call successors, (5223), 857 states have call predecessors, (5223), 854 states have return successors, (5266), 5026 states have call predecessors, (5266), 5220 states have call successors, (5266) [2022-07-20 02:19:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16871 states to 16871 states and 24224 transitions. [2022-07-20 02:19:16,347 INFO L78 Accepts]: Start accepts. Automaton has 16871 states and 24224 transitions. Word has length 123 [2022-07-20 02:19:16,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:19:16,348 INFO L495 AbstractCegarLoop]: Abstraction has 16871 states and 24224 transitions. [2022-07-20 02:19:16,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 02:19:16,348 INFO L276 IsEmpty]: Start isEmpty. Operand 16871 states and 24224 transitions. [2022-07-20 02:19:16,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-20 02:19:16,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:19:16,350 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-20 02:19:16,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 02:19:16,350 INFO L420 AbstractCegarLoop]: === Iteration 8 === 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-20 02:19:16,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:19:16,351 INFO L85 PathProgramCache]: Analyzing trace with hash 119085821, now seen corresponding path program 1 times [2022-07-20 02:19:16,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:19:16,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125544223] [2022-07-20 02:19:16,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:19:16,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:19:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:16,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:19:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:16,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:16,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:19:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:16,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:16,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:19:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:16,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:16,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:19:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:16,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:16,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:19:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:16,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:19:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:16,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 02:19:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:16,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:19:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:16,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 02:19:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:16,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:16,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 02:19:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:16,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 02:19:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:16,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 02:19:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:16,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 02:19:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-20 02:19:16,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:19:16,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125544223] [2022-07-20 02:19:16,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125544223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:19:16,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:19:16,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 02:19:16,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267406229] [2022-07-20 02:19:16,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:19:16,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 02:19:16,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:19:16,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 02:19:16,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:19:16,761 INFO L87 Difference]: Start difference. First operand 16871 states and 24224 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-20 02:19:22,020 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:19:22,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:19:22,881 INFO L93 Difference]: Finished difference Result 17759 states and 25637 transitions. [2022-07-20 02:19:22,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 02:19:22,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2022-07-20 02:19:22,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:19:22,959 INFO L225 Difference]: With dead ends: 17759 [2022-07-20 02:19:22,960 INFO L226 Difference]: Without dead ends: 17757 [2022-07-20 02:19:22,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 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-20 02:19:22,977 INFO L413 NwaCegarLoop]: 2269 mSDtfsCounter, 2521 mSDsluCounter, 3073 mSDsCounter, 0 mSdLazyCounter, 3531 mSolverCounterSat, 1583 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2734 SdHoareTripleChecker+Valid, 5342 SdHoareTripleChecker+Invalid, 5115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1583 IncrementalHoareTripleChecker+Valid, 3531 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-20 02:19:22,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2734 Valid, 5342 Invalid, 5115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1583 Valid, 3531 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-07-20 02:19:22,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17757 states. [2022-07-20 02:19:23,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17757 to 16875. [2022-07-20 02:19:23,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16875 states, 10794 states have (on average 1.2727441171020937) internal successors, (13738), 11276 states have internal predecessors, (13738), 5223 states have call successors, (5223), 858 states have call predecessors, (5223), 855 states have return successors, (5266), 5026 states have call predecessors, (5266), 5220 states have call successors, (5266) [2022-07-20 02:19:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16875 states to 16875 states and 24227 transitions. [2022-07-20 02:19:23,768 INFO L78 Accepts]: Start accepts. Automaton has 16875 states and 24227 transitions. Word has length 128 [2022-07-20 02:19:23,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:19:23,769 INFO L495 AbstractCegarLoop]: Abstraction has 16875 states and 24227 transitions. [2022-07-20 02:19:23,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-20 02:19:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 16875 states and 24227 transitions. [2022-07-20 02:19:23,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-20 02:19:23,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:19:23,771 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 02:19:23,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 02:19:23,772 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-20 02:19:23,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:19:23,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1558624059, now seen corresponding path program 1 times [2022-07-20 02:19:23,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:19:23,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118276604] [2022-07-20 02:19:23,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:19:23,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:19:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:19:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:19:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:19:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:19:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:19:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:19:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 02:19:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:19:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 02:19:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 02:19:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 02:19:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 02:19:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 02:19:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 02:19:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:24,125 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-20 02:19:24,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:19:24,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118276604] [2022-07-20 02:19:24,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118276604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:19:24,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:19:24,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 02:19:24,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822609088] [2022-07-20 02:19:24,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:19:24,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 02:19:24,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:19:24,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 02:19:24,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:19:24,128 INFO L87 Difference]: Start difference. First operand 16875 states and 24227 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-20 02:19:29,520 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:19:31,657 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:19:32,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:19:32,660 INFO L93 Difference]: Finished difference Result 17763 states and 25640 transitions. [2022-07-20 02:19:32,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 02:19:32,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2022-07-20 02:19:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:19:32,721 INFO L225 Difference]: With dead ends: 17763 [2022-07-20 02:19:32,721 INFO L226 Difference]: Without dead ends: 17761 [2022-07-20 02:19:32,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 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-20 02:19:32,733 INFO L413 NwaCegarLoop]: 2270 mSDtfsCounter, 2521 mSDsluCounter, 3076 mSDsCounter, 0 mSdLazyCounter, 3530 mSolverCounterSat, 1582 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2733 SdHoareTripleChecker+Valid, 5346 SdHoareTripleChecker+Invalid, 5114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1582 IncrementalHoareTripleChecker+Valid, 3530 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-07-20 02:19:32,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2733 Valid, 5346 Invalid, 5114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1582 Valid, 3530 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2022-07-20 02:19:32,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17761 states. [2022-07-20 02:19:33,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17761 to 16879. [2022-07-20 02:19:33,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16879 states, 10797 states have (on average 1.2726683337964249) internal successors, (13741), 11279 states have internal predecessors, (13741), 5223 states have call successors, (5223), 859 states have call predecessors, (5223), 856 states have return successors, (5266), 5026 states have call predecessors, (5266), 5220 states have call successors, (5266) [2022-07-20 02:19:33,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16879 states to 16879 states and 24230 transitions. [2022-07-20 02:19:33,429 INFO L78 Accepts]: Start accepts. Automaton has 16879 states and 24230 transitions. Word has length 133 [2022-07-20 02:19:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:19:33,429 INFO L495 AbstractCegarLoop]: Abstraction has 16879 states and 24230 transitions. [2022-07-20 02:19:33,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-20 02:19:33,430 INFO L276 IsEmpty]: Start isEmpty. Operand 16879 states and 24230 transitions. [2022-07-20 02:19:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-20 02:19:33,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:19:33,432 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 02:19:33,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 02:19:33,433 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-20 02:19:33,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:19:33,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1025780093, now seen corresponding path program 1 times [2022-07-20 02:19:33,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:19:33,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36606381] [2022-07-20 02:19:33,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:19:33,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:19:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:19:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:19:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:19:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:19:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:19:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:19:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 02:19:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:19:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 02:19:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 02:19:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 02:19:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 02:19:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 02:19:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 02:19:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 02:19:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-07-20 02:19:33,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:19:33,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36606381] [2022-07-20 02:19:33,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36606381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:19:33,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:19:33,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 02:19:33,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429494380] [2022-07-20 02:19:33,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:19:33,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 02:19:33,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:19:33,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 02:19:33,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:19:33,628 INFO L87 Difference]: Start difference. First operand 16879 states and 24230 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-20 02:19:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:19:38,151 INFO L93 Difference]: Finished difference Result 17767 states and 25643 transitions. [2022-07-20 02:19:38,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 02:19:38,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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 138 [2022-07-20 02:19:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:19:38,221 INFO L225 Difference]: With dead ends: 17767 [2022-07-20 02:19:38,221 INFO L226 Difference]: Without dead ends: 17765 [2022-07-20 02:19:38,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-20 02:19:38,235 INFO L413 NwaCegarLoop]: 2271 mSDtfsCounter, 2520 mSDsluCounter, 3077 mSDsCounter, 0 mSdLazyCounter, 3532 mSolverCounterSat, 1579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2733 SdHoareTripleChecker+Valid, 5348 SdHoareTripleChecker+Invalid, 5111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1579 IncrementalHoareTripleChecker+Valid, 3532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-20 02:19:38,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2733 Valid, 5348 Invalid, 5111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1579 Valid, 3532 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-20 02:19:38,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17765 states. [2022-07-20 02:19:39,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17765 to 16883. [2022-07-20 02:19:39,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16883 states, 10800 states have (on average 1.2725925925925925) internal successors, (13744), 11282 states have internal predecessors, (13744), 5223 states have call successors, (5223), 860 states have call predecessors, (5223), 857 states have return successors, (5266), 5026 states have call predecessors, (5266), 5220 states have call successors, (5266) [2022-07-20 02:19:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16883 states to 16883 states and 24233 transitions. [2022-07-20 02:19:39,134 INFO L78 Accepts]: Start accepts. Automaton has 16883 states and 24233 transitions. Word has length 138 [2022-07-20 02:19:39,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:19:39,135 INFO L495 AbstractCegarLoop]: Abstraction has 16883 states and 24233 transitions. [2022-07-20 02:19:39,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-20 02:19:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 16883 states and 24233 transitions. [2022-07-20 02:19:39,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-20 02:19:39,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:19:39,138 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 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] [2022-07-20 02:19:39,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 02:19:39,139 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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-20 02:19:39,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:19:39,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1519618408, now seen corresponding path program 1 times [2022-07-20 02:19:39,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:19:39,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358773828] [2022-07-20 02:19:39,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:19:39,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:19:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:39,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:19:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:39,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:39,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:19:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:39,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:39,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:19:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:39,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:39,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:19:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:39,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:39,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:19:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:39,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:19:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:39,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 02:19:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:39,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:19:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:39,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 02:19:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:39,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 02:19:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:39,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:39,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 02:19:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:39,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 02:19:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:39,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-20 02:19:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-20 02:19:39,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:19:39,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358773828] [2022-07-20 02:19:39,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358773828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:19:39,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:19:39,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 02:19:39,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628433624] [2022-07-20 02:19:39,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:19:39,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 02:19:39,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:19:39,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 02:19:39,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 02:19:39,397 INFO L87 Difference]: Start difference. First operand 16883 states and 24233 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-20 02:19:44,739 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:19:46,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:19:46,787 INFO L93 Difference]: Finished difference Result 39594 states and 56950 transitions. [2022-07-20 02:19:46,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 02:19:46,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 142 [2022-07-20 02:19:46,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:19:46,911 INFO L225 Difference]: With dead ends: 39594 [2022-07-20 02:19:46,911 INFO L226 Difference]: Without dead ends: 22765 [2022-07-20 02:19:46,972 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-20 02:19:46,973 INFO L413 NwaCegarLoop]: 3520 mSDtfsCounter, 1803 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 1242 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2258 SdHoareTripleChecker+Valid, 5755 SdHoareTripleChecker+Invalid, 3734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1242 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-20 02:19:46,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2258 Valid, 5755 Invalid, 3734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1242 Valid, 2491 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-07-20 02:19:46,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22765 states. [2022-07-20 02:19:47,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22765 to 21461. [2022-07-20 02:19:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21461 states, 13760 states have (on average 1.26875) internal successors, (17458), 14368 states have internal predecessors, (17458), 6559 states have call successors, (6559), 1142 states have call predecessors, (6559), 1139 states have return successors, (6602), 6318 states have call predecessors, (6602), 6556 states have call successors, (6602) [2022-07-20 02:19:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21461 states to 21461 states and 30619 transitions. [2022-07-20 02:19:47,979 INFO L78 Accepts]: Start accepts. Automaton has 21461 states and 30619 transitions. Word has length 142 [2022-07-20 02:19:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:19:47,980 INFO L495 AbstractCegarLoop]: Abstraction has 21461 states and 30619 transitions. [2022-07-20 02:19:47,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-20 02:19:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 21461 states and 30619 transitions. [2022-07-20 02:19:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-20 02:19:47,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:19:47,983 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-20 02:19:47,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 02:19:47,983 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-20 02:19:47,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:19:47,984 INFO L85 PathProgramCache]: Analyzing trace with hash -197466053, now seen corresponding path program 1 times [2022-07-20 02:19:47,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:19:47,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285856647] [2022-07-20 02:19:47,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:19:47,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:19:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:19:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:19:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:19:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:19:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:19:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:19:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 02:19:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:19:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 02:19:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 02:19:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 02:19:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 02:19:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 02:19:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 02:19:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 02:19:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 02:19:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-07-20 02:19:48,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:19:48,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285856647] [2022-07-20 02:19:48,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285856647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:19:48,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:19:48,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 02:19:48,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695030280] [2022-07-20 02:19:48,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:19:48,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 02:19:48,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:19:48,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 02:19:48,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:19:48,251 INFO L87 Difference]: Start difference. First operand 21461 states and 30619 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-20 02:19:53,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:19:53,291 INFO L93 Difference]: Finished difference Result 22727 states and 32616 transitions. [2022-07-20 02:19:53,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 02:19:53,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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 143 [2022-07-20 02:19:53,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:19:53,373 INFO L225 Difference]: With dead ends: 22727 [2022-07-20 02:19:53,373 INFO L226 Difference]: Without dead ends: 22725 [2022-07-20 02:19:53,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-20 02:19:53,390 INFO L413 NwaCegarLoop]: 2269 mSDtfsCounter, 2521 mSDsluCounter, 3073 mSDsCounter, 0 mSdLazyCounter, 3532 mSolverCounterSat, 1580 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2734 SdHoareTripleChecker+Valid, 5342 SdHoareTripleChecker+Invalid, 5112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1580 IncrementalHoareTripleChecker+Valid, 3532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-20 02:19:53,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2734 Valid, 5342 Invalid, 5112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1580 Valid, 3532 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-20 02:19:53,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22725 states. [2022-07-20 02:19:54,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22725 to 21465. [2022-07-20 02:19:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21465 states, 13763 states have (on average 1.2686914190220155) internal successors, (17461), 14371 states have internal predecessors, (17461), 6559 states have call successors, (6559), 1143 states have call predecessors, (6559), 1140 states have return successors, (6602), 6318 states have call predecessors, (6602), 6556 states have call successors, (6602) [2022-07-20 02:19:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21465 states to 21465 states and 30622 transitions. [2022-07-20 02:19:54,602 INFO L78 Accepts]: Start accepts. Automaton has 21465 states and 30622 transitions. Word has length 143 [2022-07-20 02:19:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:19:54,603 INFO L495 AbstractCegarLoop]: Abstraction has 21465 states and 30622 transitions. [2022-07-20 02:19:54,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-20 02:19:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 21465 states and 30622 transitions. [2022-07-20 02:19:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-20 02:19:54,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:19:54,606 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 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] [2022-07-20 02:19:54,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 02:19:54,606 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-20 02:19:54,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:19:54,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1861665026, now seen corresponding path program 1 times [2022-07-20 02:19:54,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:19:54,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946208207] [2022-07-20 02:19:54,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:19:54,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:19:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:19:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:19:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:19:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:19:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:19:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:19:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 02:19:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:19:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 02:19:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:19:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 02:19:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 02:19:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 02:19:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 02:19:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 02:19:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 02:19:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 02:19:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 02:19:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 02:19:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 02:19:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:19:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-07-20 02:19:54,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:19:54,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946208207] [2022-07-20 02:19:54,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946208207] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:19:54,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:19:54,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 02:19:54,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764429858] [2022-07-20 02:19:54,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:19:54,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 02:19:54,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:19:54,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 02:19:54,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:19:54,896 INFO L87 Difference]: Start difference. First operand 21465 states and 30622 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 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-20 02:19:58,458 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 02:20:02,698 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:20:04,807 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:20:06,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:20:06,137 INFO L93 Difference]: Finished difference Result 22731 states and 32619 transitions. [2022-07-20 02:20:06,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 02:20:06,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 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 166 [2022-07-20 02:20:06,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:20:06,227 INFO L225 Difference]: With dead ends: 22731 [2022-07-20 02:20:06,227 INFO L226 Difference]: Without dead ends: 22729 [2022-07-20 02:20:06,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-20 02:20:06,244 INFO L413 NwaCegarLoop]: 2271 mSDtfsCounter, 2511 mSDsluCounter, 3077 mSDsCounter, 0 mSdLazyCounter, 3529 mSolverCounterSat, 1577 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2722 SdHoareTripleChecker+Valid, 5348 SdHoareTripleChecker+Invalid, 5109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1577 IncrementalHoareTripleChecker+Valid, 3529 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-07-20 02:20:06,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2722 Valid, 5348 Invalid, 5109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1577 Valid, 3529 Invalid, 3 Unknown, 0 Unchecked, 10.5s Time] [2022-07-20 02:20:06,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22729 states. [2022-07-20 02:20:07,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22729 to 21469. [2022-07-20 02:20:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21469 states, 13766 states have (on average 1.2686328635769286) internal successors, (17464), 14374 states have internal predecessors, (17464), 6559 states have call successors, (6559), 1144 states have call predecessors, (6559), 1141 states have return successors, (6602), 6318 states have call predecessors, (6602), 6556 states have call successors, (6602) [2022-07-20 02:20:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21469 states to 21469 states and 30625 transitions. [2022-07-20 02:20:07,318 INFO L78 Accepts]: Start accepts. Automaton has 21469 states and 30625 transitions. Word has length 166 [2022-07-20 02:20:07,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:20:07,319 INFO L495 AbstractCegarLoop]: Abstraction has 21469 states and 30625 transitions. [2022-07-20 02:20:07,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 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-20 02:20:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 21469 states and 30625 transitions. [2022-07-20 02:20:07,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-20 02:20:07,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:20:07,322 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-20 02:20:07,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 02:20:07,322 INFO L420 AbstractCegarLoop]: === Iteration 14 === 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-20 02:20:07,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:20:07,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1530366267, now seen corresponding path program 1 times [2022-07-20 02:20:07,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:20:07,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039434150] [2022-07-20 02:20:07,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:20:07,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:20:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:20:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:20:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:20:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:20:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:20:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:20:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 02:20:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:20:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 02:20:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 02:20:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 02:20:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 02:20:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 02:20:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 02:20:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 02:20:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 02:20:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 02:20:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 02:20:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-07-20 02:20:07,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:20:07,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039434150] [2022-07-20 02:20:07,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039434150] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:20:07,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:20:07,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 02:20:07,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039440898] [2022-07-20 02:20:07,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:20:07,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 02:20:07,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:20:07,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 02:20:07,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:20:07,587 INFO L87 Difference]: Start difference. First operand 21469 states and 30625 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-20 02:20:14,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:20:16,683 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:20:18,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:20:18,281 INFO L93 Difference]: Finished difference Result 26901 states and 38530 transitions. [2022-07-20 02:20:18,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 02:20:18,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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 153 [2022-07-20 02:20:18,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:20:18,391 INFO L225 Difference]: With dead ends: 26901 [2022-07-20 02:20:18,391 INFO L226 Difference]: Without dead ends: 26899 [2022-07-20 02:20:18,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-20 02:20:18,410 INFO L413 NwaCegarLoop]: 2529 mSDtfsCounter, 2114 mSDsluCounter, 3452 mSDsCounter, 0 mSdLazyCounter, 4872 mSolverCounterSat, 1445 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2355 SdHoareTripleChecker+Valid, 5981 SdHoareTripleChecker+Invalid, 6319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1445 IncrementalHoareTripleChecker+Valid, 4872 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-07-20 02:20:18,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2355 Valid, 5981 Invalid, 6319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1445 Valid, 4872 Invalid, 2 Unknown, 0 Unchecked, 9.6s Time] [2022-07-20 02:20:18,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26899 states. [2022-07-20 02:20:19,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26899 to 25623. [2022-07-20 02:20:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25623 states, 16373 states have (on average 1.2737433579673854) internal successors, (20855), 17093 states have internal predecessors, (20855), 7815 states have call successors, (7815), 1435 states have call predecessors, (7815), 1432 states have return successors, (7858), 7558 states have call predecessors, (7858), 7812 states have call successors, (7858) [2022-07-20 02:20:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25623 states to 25623 states and 36528 transitions. [2022-07-20 02:20:19,534 INFO L78 Accepts]: Start accepts. Automaton has 25623 states and 36528 transitions. Word has length 153 [2022-07-20 02:20:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:20:19,535 INFO L495 AbstractCegarLoop]: Abstraction has 25623 states and 36528 transitions. [2022-07-20 02:20:19,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-20 02:20:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 25623 states and 36528 transitions. [2022-07-20 02:20:19,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-20 02:20:19,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:20:19,538 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-20 02:20:19,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 02:20:19,538 INFO L420 AbstractCegarLoop]: === Iteration 15 === 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-20 02:20:19,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:20:19,539 INFO L85 PathProgramCache]: Analyzing trace with hash 184219261, now seen corresponding path program 1 times [2022-07-20 02:20:19,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:20:19,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567171418] [2022-07-20 02:20:19,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:20:19,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:20:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:20:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:20:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:20:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:20:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:20:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:20:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 02:20:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:20:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 02:20:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 02:20:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 02:20:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 02:20:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 02:20:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 02:20:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 02:20:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 02:20:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 02:20:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 02:20:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 02:20:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:19,801 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2022-07-20 02:20:19,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:20:19,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567171418] [2022-07-20 02:20:19,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567171418] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:20:19,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:20:19,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 02:20:19,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294596575] [2022-07-20 02:20:19,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:20:19,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 02:20:19,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:20:19,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 02:20:19,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:20:19,804 INFO L87 Difference]: Start difference. First operand 25623 states and 36528 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-20 02:20:25,662 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:20:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:20:27,110 INFO L93 Difference]: Finished difference Result 26905 states and 38533 transitions. [2022-07-20 02:20:27,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 02:20:27,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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 158 [2022-07-20 02:20:27,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:20:27,217 INFO L225 Difference]: With dead ends: 26905 [2022-07-20 02:20:27,217 INFO L226 Difference]: Without dead ends: 26903 [2022-07-20 02:20:27,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-20 02:20:27,234 INFO L413 NwaCegarLoop]: 2272 mSDtfsCounter, 2520 mSDsluCounter, 3079 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 1574 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2733 SdHoareTripleChecker+Valid, 5351 SdHoareTripleChecker+Invalid, 5103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1574 IncrementalHoareTripleChecker+Valid, 3528 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-20 02:20:27,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2733 Valid, 5351 Invalid, 5103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1574 Valid, 3528 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-07-20 02:20:27,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26903 states. [2022-07-20 02:20:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26903 to 25627. [2022-07-20 02:20:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25627 states, 16376 states have (on average 1.2736932095749878) internal successors, (20858), 17096 states have internal predecessors, (20858), 7815 states have call successors, (7815), 1436 states have call predecessors, (7815), 1433 states have return successors, (7858), 7558 states have call predecessors, (7858), 7812 states have call successors, (7858) [2022-07-20 02:20:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25627 states to 25627 states and 36531 transitions. [2022-07-20 02:20:28,468 INFO L78 Accepts]: Start accepts. Automaton has 25627 states and 36531 transitions. Word has length 158 [2022-07-20 02:20:28,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:20:28,469 INFO L495 AbstractCegarLoop]: Abstraction has 25627 states and 36531 transitions. [2022-07-20 02:20:28,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-20 02:20:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand 25627 states and 36531 transitions. [2022-07-20 02:20:28,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-20 02:20:28,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:20:28,471 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 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] [2022-07-20 02:20:28,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 02:20:28,472 INFO L420 AbstractCegarLoop]: === Iteration 16 === 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-20 02:20:28,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:20:28,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1461900950, now seen corresponding path program 1 times [2022-07-20 02:20:28,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:20:28,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281231262] [2022-07-20 02:20:28,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:20:28,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:20:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:20:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:20:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:20:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:20:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:20:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:20:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 02:20:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:20:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 02:20:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 02:20:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 02:20:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 02:20:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 02:20:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 02:20:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 02:20:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 02:20:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 02:20:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 02:20:28,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 02:20:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-20 02:20:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-20 02:20:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-20 02:20:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:28,818 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2022-07-20 02:20:28,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:20:28,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281231262] [2022-07-20 02:20:28,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281231262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:20:28,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:20:28,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 02:20:28,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789784544] [2022-07-20 02:20:28,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:20:28,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 02:20:28,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:20:28,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 02:20:28,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:20:28,823 INFO L87 Difference]: Start difference. First operand 25627 states and 36531 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-20 02:20:35,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:20:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:20:36,760 INFO L93 Difference]: Finished difference Result 26909 states and 38536 transitions. [2022-07-20 02:20:36,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 02:20:36,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 181 [2022-07-20 02:20:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:20:36,864 INFO L225 Difference]: With dead ends: 26909 [2022-07-20 02:20:36,865 INFO L226 Difference]: Without dead ends: 26907 [2022-07-20 02:20:36,879 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-20 02:20:36,880 INFO L413 NwaCegarLoop]: 2270 mSDtfsCounter, 2513 mSDsluCounter, 3075 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 1573 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2724 SdHoareTripleChecker+Valid, 5345 SdHoareTripleChecker+Invalid, 5102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1573 IncrementalHoareTripleChecker+Valid, 3528 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-20 02:20:36,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2724 Valid, 5345 Invalid, 5102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1573 Valid, 3528 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2022-07-20 02:20:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26907 states. [2022-07-20 02:20:37,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26907 to 25631. [2022-07-20 02:20:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25631 states, 16379 states have (on average 1.2736430795530862) internal successors, (20861), 17099 states have internal predecessors, (20861), 7815 states have call successors, (7815), 1437 states have call predecessors, (7815), 1434 states have return successors, (7858), 7558 states have call predecessors, (7858), 7812 states have call successors, (7858) [2022-07-20 02:20:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25631 states to 25631 states and 36534 transitions. [2022-07-20 02:20:37,966 INFO L78 Accepts]: Start accepts. Automaton has 25631 states and 36534 transitions. Word has length 181 [2022-07-20 02:20:37,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:20:37,966 INFO L495 AbstractCegarLoop]: Abstraction has 25631 states and 36534 transitions. [2022-07-20 02:20:37,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-20 02:20:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 25631 states and 36534 transitions. [2022-07-20 02:20:37,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-20 02:20:37,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:20:37,968 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-20 02:20:37,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 02:20:37,968 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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-20 02:20:37,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:20:37,969 INFO L85 PathProgramCache]: Analyzing trace with hash 442414333, now seen corresponding path program 1 times [2022-07-20 02:20:37,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:20:37,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451794932] [2022-07-20 02:20:37,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:20:37,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:20:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:20:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:20:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:20:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:20:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:20:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:20:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 02:20:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:20:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 02:20:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 02:20:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 02:20:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-20 02:20:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 02:20:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 02:20:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 02:20:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-20 02:20:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 02:20:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 02:20:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 02:20:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 02:20:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 02:20:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:38,231 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-07-20 02:20:38,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:20:38,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451794932] [2022-07-20 02:20:38,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451794932] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:20:38,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:20:38,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 02:20:38,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176745793] [2022-07-20 02:20:38,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:20:38,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 02:20:38,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:20:38,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 02:20:38,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:20:38,235 INFO L87 Difference]: Start difference. First operand 25631 states and 36534 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-20 02:20:44,212 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:20:45,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:20:45,750 INFO L93 Difference]: Finished difference Result 26913 states and 38539 transitions. [2022-07-20 02:20:45,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 02:20:45,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 168 [2022-07-20 02:20:45,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:20:45,830 INFO L225 Difference]: With dead ends: 26913 [2022-07-20 02:20:45,830 INFO L226 Difference]: Without dead ends: 26911 [2022-07-20 02:20:45,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-20 02:20:45,844 INFO L413 NwaCegarLoop]: 2271 mSDtfsCounter, 2522 mSDsluCounter, 3078 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 1572 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2734 SdHoareTripleChecker+Valid, 5349 SdHoareTripleChecker+Invalid, 5101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1572 IncrementalHoareTripleChecker+Valid, 3528 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-20 02:20:45,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2734 Valid, 5349 Invalid, 5101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1572 Valid, 3528 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-07-20 02:20:45,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26911 states. [2022-07-20 02:20:46,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26911 to 25635. [2022-07-20 02:20:46,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25635 states, 16382 states have (on average 1.2735929678915883) internal successors, (20864), 17102 states have internal predecessors, (20864), 7815 states have call successors, (7815), 1438 states have call predecessors, (7815), 1435 states have return successors, (7858), 7558 states have call predecessors, (7858), 7812 states have call successors, (7858) [2022-07-20 02:20:47,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25635 states to 25635 states and 36537 transitions. [2022-07-20 02:20:47,072 INFO L78 Accepts]: Start accepts. Automaton has 25635 states and 36537 transitions. Word has length 168 [2022-07-20 02:20:47,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:20:47,073 INFO L495 AbstractCegarLoop]: Abstraction has 25635 states and 36537 transitions. [2022-07-20 02:20:47,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-20 02:20:47,073 INFO L276 IsEmpty]: Start isEmpty. Operand 25635 states and 36537 transitions. [2022-07-20 02:20:47,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-20 02:20:47,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:20:47,075 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 8, 8, 6, 6, 6, 4, 4, 4, 4, 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, 1, 1] [2022-07-20 02:20:47,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 02:20:47,075 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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-20 02:20:47,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:20:47,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1505550806, now seen corresponding path program 1 times [2022-07-20 02:20:47,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:20:47,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119481829] [2022-07-20 02:20:47,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:20:47,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:20:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:20:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:20:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:20:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:20:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:20:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:20:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 02:20:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:20:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 02:20:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 02:20:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 02:20:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 02:20:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 02:20:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 02:20:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 02:20:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 02:20:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 02:20:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 02:20:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 02:20:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-20 02:20:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-20 02:20:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-20 02:20:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-20 02:20:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 02:20:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:47,358 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2022-07-20 02:20:47,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:20:47,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119481829] [2022-07-20 02:20:47,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119481829] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:20:47,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:20:47,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 02:20:47,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652628514] [2022-07-20 02:20:47,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:20:47,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 02:20:47,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:20:47,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 02:20:47,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:20:47,361 INFO L87 Difference]: Start difference. First operand 25635 states and 36537 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-20 02:20:53,427 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:20:55,574 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:20:57,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:20:57,108 INFO L93 Difference]: Finished difference Result 26917 states and 38542 transitions. [2022-07-20 02:20:57,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 02:20:57,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 191 [2022-07-20 02:20:57,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:20:57,195 INFO L225 Difference]: With dead ends: 26917 [2022-07-20 02:20:57,195 INFO L226 Difference]: Without dead ends: 26913 [2022-07-20 02:20:57,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-20 02:20:57,206 INFO L413 NwaCegarLoop]: 2270 mSDtfsCounter, 2513 mSDsluCounter, 3075 mSDsCounter, 0 mSdLazyCounter, 3527 mSolverCounterSat, 1571 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2724 SdHoareTripleChecker+Valid, 5345 SdHoareTripleChecker+Invalid, 5100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1571 IncrementalHoareTripleChecker+Valid, 3527 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-07-20 02:20:57,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2724 Valid, 5345 Invalid, 5100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1571 Valid, 3527 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2022-07-20 02:20:57,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26913 states. [2022-07-20 02:20:58,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26913 to 25637. [2022-07-20 02:20:58,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25637 states, 16384 states have (on average 1.27349853515625) internal successors, (20865), 17103 states have internal predecessors, (20865), 7815 states have call successors, (7815), 1439 states have call predecessors, (7815), 1435 states have return successors, (7858), 7558 states have call predecessors, (7858), 7812 states have call successors, (7858) [2022-07-20 02:20:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25637 states to 25637 states and 36538 transitions. [2022-07-20 02:20:58,356 INFO L78 Accepts]: Start accepts. Automaton has 25637 states and 36538 transitions. Word has length 191 [2022-07-20 02:20:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:20:58,356 INFO L495 AbstractCegarLoop]: Abstraction has 25637 states and 36538 transitions. [2022-07-20 02:20:58,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-20 02:20:58,356 INFO L276 IsEmpty]: Start isEmpty. Operand 25637 states and 36538 transitions. [2022-07-20 02:20:58,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-20 02:20:58,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:20:58,358 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 8, 8, 6, 6, 6, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2022-07-20 02:20:58,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 02:20:58,358 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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-20 02:20:58,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:20:58,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1962924606, now seen corresponding path program 1 times [2022-07-20 02:20:58,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:20:58,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210646537] [2022-07-20 02:20:58,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:20:58,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:20:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:20:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:20:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:20:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:20:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:20:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:20:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 02:20:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:20:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 02:20:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:20:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-20 02:20:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-20 02:20:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 02:20:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 02:20:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 02:20:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 02:20:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 02:20:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-20 02:20:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 02:20:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-20 02:20:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-20 02:20:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-20 02:20:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-20 02:20:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-20 02:20:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 02:20:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-20 02:20:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:20:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2022-07-20 02:20:58,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:20:58,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210646537] [2022-07-20 02:20:58,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210646537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:20:58,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:20:58,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 02:20:58,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136524189] [2022-07-20 02:20:58,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:20:58,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 02:20:58,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:20:58,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 02:20:58,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:20:58,655 INFO L87 Difference]: Start difference. First operand 25637 states and 36538 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-20 02:21:04,647 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:21:06,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:21:06,099 INFO L93 Difference]: Finished difference Result 26913 states and 38538 transitions. [2022-07-20 02:21:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 02:21:06,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 196 [2022-07-20 02:21:06,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:21:06,235 INFO L225 Difference]: With dead ends: 26913 [2022-07-20 02:21:06,235 INFO L226 Difference]: Without dead ends: 26689 [2022-07-20 02:21:06,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 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-20 02:21:06,263 INFO L413 NwaCegarLoop]: 2269 mSDtfsCounter, 2505 mSDsluCounter, 3079 mSDsCounter, 0 mSdLazyCounter, 3523 mSolverCounterSat, 1570 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2716 SdHoareTripleChecker+Valid, 5348 SdHoareTripleChecker+Invalid, 5094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1570 IncrementalHoareTripleChecker+Valid, 3523 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-20 02:21:06,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2716 Valid, 5348 Invalid, 5094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1570 Valid, 3523 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-07-20 02:21:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26689 states. [2022-07-20 02:21:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26689 to 25413. [2022-07-20 02:21:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25413 states, 16242 states have (on average 1.2730575052333457) internal successors, (20677), 16937 states have internal predecessors, (20677), 7748 states have call successors, (7748), 1423 states have call predecessors, (7748), 1421 states have return successors, (7794), 7516 states have call predecessors, (7794), 7748 states have call successors, (7794) [2022-07-20 02:21:07,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25413 states to 25413 states and 36219 transitions. [2022-07-20 02:21:07,768 INFO L78 Accepts]: Start accepts. Automaton has 25413 states and 36219 transitions. Word has length 196 [2022-07-20 02:21:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:21:07,769 INFO L495 AbstractCegarLoop]: Abstraction has 25413 states and 36219 transitions. [2022-07-20 02:21:07,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-20 02:21:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 25413 states and 36219 transitions. [2022-07-20 02:21:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-07-20 02:21:07,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:21:07,772 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:21:07,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 02:21:07,773 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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-20 02:21:07,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:21:07,774 INFO L85 PathProgramCache]: Analyzing trace with hash -968498435, now seen corresponding path program 1 times [2022-07-20 02:21:07,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:21:07,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312787739] [2022-07-20 02:21:07,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:21:07,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:21:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:21:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:21:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:21:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:21:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:21:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:21:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 02:21:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:21:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 02:21:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 02:21:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 02:21:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 02:21:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 02:21:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 02:21:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 02:21:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:07,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 02:21:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:08,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:08,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 02:21:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:08,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 02:21:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:08,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-20 02:21:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:08,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-20 02:21:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:08,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-20 02:21:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:08,034 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2022-07-20 02:21:08,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:21:08,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312787739] [2022-07-20 02:21:08,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312787739] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:21:08,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:21:08,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 02:21:08,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950252664] [2022-07-20 02:21:08,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:21:08,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 02:21:08,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:21:08,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 02:21:08,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 02:21:08,036 INFO L87 Difference]: Start difference. First operand 25413 states and 36219 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-20 02:21:11,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 02:21:15,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:21:15,533 INFO L93 Difference]: Finished difference Result 57921 states and 82741 transitions. [2022-07-20 02:21:15,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 02:21:15,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 216 [2022-07-20 02:21:15,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:21:15,673 INFO L225 Difference]: With dead ends: 57921 [2022-07-20 02:21:15,673 INFO L226 Difference]: Without dead ends: 32519 [2022-07-20 02:21:15,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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-20 02:21:15,736 INFO L413 NwaCegarLoop]: 3499 mSDtfsCounter, 1766 mSDsluCounter, 2224 mSDsCounter, 0 mSdLazyCounter, 2420 mSolverCounterSat, 1158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2204 SdHoareTripleChecker+Valid, 5723 SdHoareTripleChecker+Invalid, 3578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1158 IncrementalHoareTripleChecker+Valid, 2420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-20 02:21:15,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2204 Valid, 5723 Invalid, 3578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1158 Valid, 2420 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-07-20 02:21:15,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32519 states. [2022-07-20 02:21:17,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32519 to 30857. [2022-07-20 02:21:17,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30857 states, 19737 states have (on average 1.2716724932867203) internal successors, (25099), 20578 states have internal predecessors, (25099), 9353 states have call successors, (9353), 1767 states have call predecessors, (9353), 1765 states have return successors, (9399), 9081 states have call predecessors, (9399), 9353 states have call successors, (9399) [2022-07-20 02:21:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30857 states to 30857 states and 43851 transitions. [2022-07-20 02:21:17,170 INFO L78 Accepts]: Start accepts. Automaton has 30857 states and 43851 transitions. Word has length 216 [2022-07-20 02:21:17,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:21:17,171 INFO L495 AbstractCegarLoop]: Abstraction has 30857 states and 43851 transitions. [2022-07-20 02:21:17,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-20 02:21:17,172 INFO L276 IsEmpty]: Start isEmpty. Operand 30857 states and 43851 transitions. [2022-07-20 02:21:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-07-20 02:21:17,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:21:17,175 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:21:17,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 02:21:17,175 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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-20 02:21:17,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:21:17,176 INFO L85 PathProgramCache]: Analyzing trace with hash -693738821, now seen corresponding path program 1 times [2022-07-20 02:21:17,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:21:17,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721294206] [2022-07-20 02:21:17,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:21:17,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:21:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:21:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:21:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:21:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:21:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:21:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:21:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 02:21:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:21:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 02:21:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 02:21:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 02:21:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 02:21:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 02:21:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 02:21:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 02:21:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 02:21:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 02:21:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 02:21:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-20 02:21:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-20 02:21:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-20 02:21:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2022-07-20 02:21:17,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:21:17,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721294206] [2022-07-20 02:21:17,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721294206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:21:17,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:21:17,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 02:21:17,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589592502] [2022-07-20 02:21:17,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:21:17,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 02:21:17,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:21:17,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 02:21:17,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 02:21:17,376 INFO L87 Difference]: Start difference. First operand 30857 states and 43851 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-20 02:21:19,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 02:21:24,618 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:21:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:21:27,616 INFO L93 Difference]: Finished difference Result 74180 states and 106059 transitions. [2022-07-20 02:21:27,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 02:21:27,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 216 [2022-07-20 02:21:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:21:27,767 INFO L225 Difference]: With dead ends: 74180 [2022-07-20 02:21:27,767 INFO L226 Difference]: Without dead ends: 43377 [2022-07-20 02:21:27,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 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-20 02:21:27,842 INFO L413 NwaCegarLoop]: 3757 mSDtfsCounter, 2337 mSDsluCounter, 1878 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 1482 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2850 SdHoareTripleChecker+Valid, 5635 SdHoareTripleChecker+Invalid, 3949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1482 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-07-20 02:21:27,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2850 Valid, 5635 Invalid, 3949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1482 Valid, 2466 Invalid, 1 Unknown, 0 Unchecked, 8.3s Time] [2022-07-20 02:21:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43377 states. [2022-07-20 02:21:29,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43377 to 41217. [2022-07-20 02:21:29,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41217 states, 26053 states have (on average 1.2714082831151883) internal successors, (33124), 27216 states have internal predecessors, (33124), 12821 states have call successors, (12821), 2343 states have call predecessors, (12821), 2341 states have return successors, (12863), 12437 states have call predecessors, (12863), 12821 states have call successors, (12863) [2022-07-20 02:21:29,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41217 states to 41217 states and 58808 transitions. [2022-07-20 02:21:29,978 INFO L78 Accepts]: Start accepts. Automaton has 41217 states and 58808 transitions. Word has length 216 [2022-07-20 02:21:29,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:21:29,979 INFO L495 AbstractCegarLoop]: Abstraction has 41217 states and 58808 transitions. [2022-07-20 02:21:29,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (25), 3 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-20 02:21:29,979 INFO L276 IsEmpty]: Start isEmpty. Operand 41217 states and 58808 transitions. [2022-07-20 02:21:29,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-07-20 02:21:29,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:21:29,984 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:21:29,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 02:21:29,984 INFO L420 AbstractCegarLoop]: === Iteration 22 === 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-20 02:21:29,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:21:29,985 INFO L85 PathProgramCache]: Analyzing trace with hash 499296066, now seen corresponding path program 1 times [2022-07-20 02:21:29,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:21:29,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456379514] [2022-07-20 02:21:29,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:21:29,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:21:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:21:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:21:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:21:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:21:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:21:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:21:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 02:21:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:21:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 02:21:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 02:21:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 02:21:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 02:21:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 02:21:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 02:21:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 02:21:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 02:21:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 02:21:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 02:21:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-20 02:21:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-20 02:21:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-20 02:21:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-07-20 02:21:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-20 02:21:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-20 02:21:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-20 02:21:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2022-07-20 02:21:30,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:21:30,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456379514] [2022-07-20 02:21:30,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456379514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:21:30,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:21:30,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 02:21:30,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845191183] [2022-07-20 02:21:30,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:21:30,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 02:21:30,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:21:30,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 02:21:30,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 02:21:30,249 INFO L87 Difference]: Start difference. First operand 41217 states and 58808 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-20 02:21:37,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:21:37,050 INFO L93 Difference]: Finished difference Result 90386 states and 129255 transitions. [2022-07-20 02:21:37,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 02:21:37,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 270 [2022-07-20 02:21:37,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:21:37,234 INFO L225 Difference]: With dead ends: 90386 [2022-07-20 02:21:37,234 INFO L226 Difference]: Without dead ends: 49237 [2022-07-20 02:21:37,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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-20 02:21:37,330 INFO L413 NwaCegarLoop]: 3381 mSDtfsCounter, 1773 mSDsluCounter, 2134 mSDsCounter, 0 mSdLazyCounter, 2422 mSolverCounterSat, 1178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2213 SdHoareTripleChecker+Valid, 5515 SdHoareTripleChecker+Invalid, 3600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1178 IncrementalHoareTripleChecker+Valid, 2422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-20 02:21:37,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2213 Valid, 5515 Invalid, 3600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1178 Valid, 2422 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-20 02:21:37,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49237 states. [2022-07-20 02:21:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49237 to 46699. [2022-07-20 02:21:39,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46699 states, 29587 states have (on average 1.2706932098556798) internal successors, (37596), 30896 states have internal predecessors, (37596), 14429 states have call successors, (14429), 2683 states have call predecessors, (14429), 2681 states have return successors, (14471), 14005 states have call predecessors, (14471), 14429 states have call successors, (14471) [2022-07-20 02:21:39,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46699 states to 46699 states and 66496 transitions. [2022-07-20 02:21:39,650 INFO L78 Accepts]: Start accepts. Automaton has 46699 states and 66496 transitions. Word has length 270 [2022-07-20 02:21:39,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:21:39,651 INFO L495 AbstractCegarLoop]: Abstraction has 46699 states and 66496 transitions. [2022-07-20 02:21:39,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-20 02:21:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 46699 states and 66496 transitions. [2022-07-20 02:21:39,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-07-20 02:21:39,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:21:39,656 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:21:39,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 02:21:39,657 INFO L420 AbstractCegarLoop]: === Iteration 23 === 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-20 02:21:39,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:21:39,657 INFO L85 PathProgramCache]: Analyzing trace with hash 774055680, now seen corresponding path program 1 times [2022-07-20 02:21:39,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:21:39,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716454583] [2022-07-20 02:21:39,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:21:39,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:21:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:21:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:21:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:21:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:21:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:21:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:21:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 02:21:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:21:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 02:21:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 02:21:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 02:21:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 02:21:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 02:21:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 02:21:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 02:21:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 02:21:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 02:21:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 02:21:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-20 02:21:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-20 02:21:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-20 02:21:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-07-20 02:21:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-20 02:21:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-20 02:21:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-20 02:21:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2022-07-20 02:21:39,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:21:39,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716454583] [2022-07-20 02:21:39,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716454583] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:21:39,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:21:39,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 02:21:39,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387406561] [2022-07-20 02:21:39,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:21:39,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 02:21:39,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:21:39,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 02:21:39,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 02:21:39,899 INFO L87 Difference]: Start difference. First operand 46699 states and 66496 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-20 02:21:46,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:21:46,990 INFO L93 Difference]: Finished difference Result 101824 states and 145335 transitions. [2022-07-20 02:21:46,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 02:21:46,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 270 [2022-07-20 02:21:46,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:21:47,182 INFO L225 Difference]: With dead ends: 101824 [2022-07-20 02:21:47,182 INFO L226 Difference]: Without dead ends: 55193 [2022-07-20 02:21:47,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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-20 02:21:47,298 INFO L413 NwaCegarLoop]: 3497 mSDtfsCounter, 1787 mSDsluCounter, 2223 mSDsCounter, 0 mSdLazyCounter, 2425 mSolverCounterSat, 1161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2228 SdHoareTripleChecker+Valid, 5720 SdHoareTripleChecker+Invalid, 3586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1161 IncrementalHoareTripleChecker+Valid, 2425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-20 02:21:47,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2228 Valid, 5720 Invalid, 3586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1161 Valid, 2425 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-20 02:21:47,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55193 states. [2022-07-20 02:21:49,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55193 to 52277. [2022-07-20 02:21:49,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52277 states, 33201 states have (on average 1.2699617481401162) internal successors, (42164), 34656 states have internal predecessors, (42164), 16045 states have call successors, (16045), 3031 states have call predecessors, (16045), 3029 states have return successors, (16087), 15581 states have call predecessors, (16087), 16045 states have call successors, (16087) [2022-07-20 02:21:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52277 states to 52277 states and 74296 transitions. [2022-07-20 02:21:50,167 INFO L78 Accepts]: Start accepts. Automaton has 52277 states and 74296 transitions. Word has length 270 [2022-07-20 02:21:50,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:21:50,167 INFO L495 AbstractCegarLoop]: Abstraction has 52277 states and 74296 transitions. [2022-07-20 02:21:50,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-20 02:21:50,168 INFO L276 IsEmpty]: Start isEmpty. Operand 52277 states and 74296 transitions. [2022-07-20 02:21:50,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2022-07-20 02:21:50,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:21:50,173 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 11, 11, 11, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 02:21:50,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 02:21:50,173 INFO L420 AbstractCegarLoop]: === Iteration 24 === 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-20 02:21:50,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:21:50,174 INFO L85 PathProgramCache]: Analyzing trace with hash 330673094, now seen corresponding path program 1 times [2022-07-20 02:21:50,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:21:50,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778051841] [2022-07-20 02:21:50,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:21:50,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:21:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:21:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:21:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:21:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:21:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 02:21:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 02:21:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-20 02:21:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:21:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-20 02:21:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 02:21:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 02:21:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 02:21:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 02:21:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 02:21:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 02:21:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-20 02:21:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 02:21:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 02:21:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-20 02:21:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-20 02:21:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-20 02:21:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-07-20 02:21:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-20 02:21:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-20 02:21:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-20 02:21:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-07-20 02:21:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:21:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-20 02:21:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-07-20 02:21:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:21:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2022-07-20 02:21:50,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:21:50,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778051841] [2022-07-20 02:21:50,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778051841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:21:50,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:21:50,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 02:21:50,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742413605] [2022-07-20 02:21:50,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:21:50,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 02:21:50,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:21:50,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 02:21:50,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:21:50,470 INFO L87 Difference]: Start difference. First operand 52277 states and 74296 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-20 02:21:57,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-20 02:21:59,570 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers []