./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-wan-farsync.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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-wan-farsync.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 3dcd453e519a411dcaaa8ea095e5544a2fd8cdb9a31e662fc6de670ff7f7c541 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 02:39:17,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 02:39:17,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 02:39:17,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 02:39:17,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 02:39:17,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 02:39:17,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 02:39:17,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 02:39:17,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 02:39:17,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 02:39:17,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 02:39:17,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 02:39:17,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 02:39:17,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 02:39:17,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 02:39:17,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 02:39:17,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 02:39:17,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 02:39:17,253 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 02:39:17,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 02:39:17,262 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 02:39:17,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 02:39:17,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 02:39:17,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 02:39:17,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 02:39:17,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 02:39:17,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 02:39:17,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 02:39:17,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 02:39:17,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 02:39:17,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 02:39:17,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 02:39:17,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 02:39:17,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 02:39:17,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 02:39:17,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 02:39:17,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 02:39:17,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 02:39:17,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 02:39:17,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 02:39:17,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 02:39:17,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 02:39:17,281 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 02:39:17,311 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 02:39:17,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 02:39:17,312 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 02:39:17,312 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 02:39:17,313 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 02:39:17,313 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 02:39:17,314 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 02:39:17,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 02:39:17,314 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 02:39:17,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 02:39:17,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 02:39:17,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 02:39:17,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 02:39:17,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 02:39:17,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 02:39:17,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 02:39:17,316 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 02:39:17,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 02:39:17,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 02:39:17,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 02:39:17,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 02:39:17,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 02:39:17,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 02:39:17,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 02:39:17,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 02:39:17,318 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 02:39:17,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 02:39:17,318 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 02:39:17,319 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 02:39:17,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 02:39:17,319 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 -> 3dcd453e519a411dcaaa8ea095e5544a2fd8cdb9a31e662fc6de670ff7f7c541 [2022-07-23 02:39:17,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 02:39:17,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 02:39:17,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 02:39:17,584 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 02:39:17,585 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 02:39:17,586 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-wan-farsync.cil.i [2022-07-23 02:39:17,646 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aacf9780/2199c2ce100440be9014b80ec4fd6a5b/FLAG32cf8b879 [2022-07-23 02:39:18,373 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 02:39:18,374 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-wan-farsync.cil.i [2022-07-23 02:39:18,421 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aacf9780/2199c2ce100440be9014b80ec4fd6a5b/FLAG32cf8b879 [2022-07-23 02:39:18,464 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aacf9780/2199c2ce100440be9014b80ec4fd6a5b [2022-07-23 02:39:18,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 02:39:18,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 02:39:18,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 02:39:18,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 02:39:18,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 02:39:18,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:39:18" (1/1) ... [2022-07-23 02:39:18,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e90abe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:39:18, skipping insertion in model container [2022-07-23 02:39:18,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:39:18" (1/1) ... [2022-07-23 02:39:18,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 02:39:18,616 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 02:39:21,278 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-wan-farsync.cil.i[320934,320947] [2022-07-23 02:39:21,281 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-wan-farsync.cil.i[321103,321116] [2022-07-23 02:39:21,282 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-wan-farsync.cil.i[321270,321283] [2022-07-23 02:39:21,282 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-wan-farsync.cil.i[321438,321451] [2022-07-23 02:39:21,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 02:39:21,373 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 02:39:21,703 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-wan-farsync.cil.i[320934,320947] [2022-07-23 02:39:21,704 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-wan-farsync.cil.i[321103,321116] [2022-07-23 02:39:21,704 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-wan-farsync.cil.i[321270,321283] [2022-07-23 02:39:21,705 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-wan-farsync.cil.i[321438,321451] [2022-07-23 02:39:21,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 02:39:21,859 INFO L208 MainTranslator]: Completed translation [2022-07-23 02:39:21,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:39:21 WrapperNode [2022-07-23 02:39:21,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 02:39:21,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 02:39:21,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 02:39:21,862 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 02:39:21,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:39:21" (1/1) ... [2022-07-23 02:39:21,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:39:21" (1/1) ... [2022-07-23 02:39:22,153 INFO L137 Inliner]: procedures = 418, calls = 1969, calls flagged for inlining = 195, calls inlined = 179, statements flattened = 5299 [2022-07-23 02:39:22,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 02:39:22,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 02:39:22,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 02:39:22,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 02:39:22,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:39:21" (1/1) ... [2022-07-23 02:39:22,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:39:21" (1/1) ... [2022-07-23 02:39:22,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:39:21" (1/1) ... [2022-07-23 02:39:22,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:39:21" (1/1) ... [2022-07-23 02:39:22,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:39:21" (1/1) ... [2022-07-23 02:39:22,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:39:21" (1/1) ... [2022-07-23 02:39:22,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:39:21" (1/1) ... [2022-07-23 02:39:22,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 02:39:22,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 02:39:22,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 02:39:22,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 02:39:22,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:39:21" (1/1) ... [2022-07-23 02:39:22,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 02:39:22,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 02:39:22,397 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-23 02:39:22,421 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-23 02:39:22,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_EMGentry_exit_fst_cleanup_module_12_2 [2022-07-23 02:39:22,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_EMGentry_exit_fst_cleanup_module_12_2 [2022-07-23 02:39:22,440 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2022-07-23 02:39:22,440 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2022-07-23 02:39:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-23 02:39:22,441 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-23 02:39:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-07-23 02:39:22,441 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-07-23 02:39:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 02:39:22,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 02:39:22,441 INFO L130 BoogieDeclarations]: Found specification of procedure fst_remove_one [2022-07-23 02:39:22,442 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_remove_one [2022-07-23 02:39:22,442 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-23 02:39:22,442 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-23 02:39:22,442 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 02:39:22,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 02:39:22,442 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_ok [2022-07-23 02:39:22,442 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_ok [2022-07-23 02:39:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_on [2022-07-23 02:39:22,443 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_on [2022-07-23 02:39:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_toio [2022-07-23 02:39:22,443 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_toio [2022-07-23 02:39:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_61 [2022-07-23 02:39:22,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_61 [2022-07-23 02:39:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_67 [2022-07-23 02:39:22,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_67 [2022-07-23 02:39:22,444 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-23 02:39:22,444 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-23 02:39:22,444 INFO L130 BoogieDeclarations]: Found specification of procedure fst_close [2022-07-23 02:39:22,444 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_close [2022-07-23 02:39:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-23 02:39:22,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-23 02:39:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2022-07-23 02:39:22,445 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2022-07-23 02:39:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-23 02:39:22,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-23 02:39:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure fst_tx_timeout [2022-07-23 02:39:22,446 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_tx_timeout [2022-07-23 02:39:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-23 02:39:22,446 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-23 02:39:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 02:39:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure iounmap [2022-07-23 02:39:22,447 INFO L138 BoogieDeclarations]: Found implementation of procedure iounmap [2022-07-23 02:39:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure fst_open [2022-07-23 02:39:22,447 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_open [2022-07-23 02:39:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure hdlc_type_trans [2022-07-23 02:39:22,447 INFO L138 BoogieDeclarations]: Found implementation of procedure hdlc_type_trans [2022-07-23 02:39:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-23 02:39:22,448 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-23 02:39:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-23 02:39:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-23 02:39:22,449 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-23 02:39:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-23 02:39:22,450 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-23 02:39:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-23 02:39:22,451 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-23 02:39:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-23 02:39:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-23 02:39:22,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-23 02:39:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 02:39:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-07-23 02:39:22,452 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-07-23 02:39:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-23 02:39:22,452 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-23 02:39:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure fst_issue_cmd [2022-07-23 02:39:22,452 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_issue_cmd [2022-07-23 02:39:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-07-23 02:39:22,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-07-23 02:39:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-23 02:39:22,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-23 02:39:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2022-07-23 02:39:22,454 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2022-07-23 02:39:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-23 02:39:22,454 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-23 02:39:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-23 02:39:22,454 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-23 02:39:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-07-23 02:39:22,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-07-23 02:39:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 02:39:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_1 [2022-07-23 02:39:22,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_1 [2022-07-23 02:39:22,455 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_2 [2022-07-23 02:39:22,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_2 [2022-07-23 02:39:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_card_lock_of_fst_card_info [2022-07-23 02:39:22,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_card_lock_of_fst_card_info [2022-07-23 02:39:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 02:39:22,456 INFO L130 BoogieDeclarations]: Found specification of procedure fst_cpureset [2022-07-23 02:39:22,457 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_cpureset [2022-07-23 02:39:22,457 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-23 02:39:22,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-23 02:39:22,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 02:39:22,458 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 02:39:22,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 02:39:22,459 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-23 02:39:22,459 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-23 02:39:22,459 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-23 02:39:22,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-23 02:39:22,459 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-07-23 02:39:22,459 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-07-23 02:39:22,459 INFO L130 BoogieDeclarations]: Found specification of procedure fst_q_work_item [2022-07-23 02:39:22,459 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_q_work_item [2022-07-23 02:39:22,460 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2022-07-23 02:39:22,460 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2022-07-23 02:39:22,460 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-23 02:39:22,460 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-23 02:39:22,460 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-23 02:39:22,461 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-23 02:39:22,461 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-23 02:39:22,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-23 02:39:22,461 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-23 02:39:22,461 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-23 02:39:22,462 INFO L130 BoogieDeclarations]: Found specification of procedure writeb [2022-07-23 02:39:22,462 INFO L138 BoogieDeclarations]: Found implementation of procedure writeb [2022-07-23 02:39:22,465 INFO L130 BoogieDeclarations]: Found specification of procedure writew [2022-07-23 02:39:22,466 INFO L138 BoogieDeclarations]: Found implementation of procedure writew [2022-07-23 02:39:22,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 02:39:22,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 02:39:22,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-23 02:39:22,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-23 02:39:22,467 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 02:39:22,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 02:39:22,467 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 02:39:22,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 02:39:22,474 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2022-07-23 02:39:22,474 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2022-07-23 02:39:22,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-23 02:39:22,474 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-23 02:39:22,474 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-23 02:39:22,474 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-23 02:39:22,474 INFO L130 BoogieDeclarations]: Found specification of procedure pci_alloc_consistent [2022-07-23 02:39:22,474 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_alloc_consistent [2022-07-23 02:39:22,475 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-23 02:39:22,475 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-23 02:39:22,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 02:39:22,475 INFO L130 BoogieDeclarations]: Found specification of procedure module_put [2022-07-23 02:39:22,475 INFO L138 BoogieDeclarations]: Found implementation of procedure module_put [2022-07-23 02:39:22,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 02:39:22,475 INFO L130 BoogieDeclarations]: Found specification of procedure ioremap [2022-07-23 02:39:22,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ioremap [2022-07-23 02:39:22,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 02:39:22,476 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-23 02:39:22,476 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-23 02:39:22,476 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-23 02:39:22,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-23 02:39:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2022-07-23 02:39:22,523 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2022-07-23 02:39:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-07-23 02:39:22,523 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-07-23 02:39:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-23 02:39:22,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-23 02:39:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure outl [2022-07-23 02:39:22,523 INFO L138 BoogieDeclarations]: Found implementation of procedure outl [2022-07-23 02:39:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-23 02:39:22,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-23 02:39:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure farsync_type_trans [2022-07-23 02:39:22,524 INFO L138 BoogieDeclarations]: Found implementation of procedure farsync_type_trans [2022-07-23 02:39:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-23 02:39:22,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-23 02:39:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-23 02:39:22,524 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-23 02:39:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_fst_work_q_lock [2022-07-23 02:39:22,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_fst_work_q_lock [2022-07-23 02:39:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-23 02:39:22,524 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-23 02:39:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 02:39:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure fst_disable_intr [2022-07-23 02:39:22,524 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_disable_intr [2022-07-23 02:39:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-23 02:39:22,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-23 02:39:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-23 02:39:22,525 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-23 02:39:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-23 02:39:22,525 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-23 02:39:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure do_bottom_half_tx [2022-07-23 02:39:22,525 INFO L138 BoogieDeclarations]: Found implementation of procedure do_bottom_half_tx [2022-07-23 02:39:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure fst_process_rx_status [2022-07-23 02:39:22,525 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_process_rx_status [2022-07-23 02:39:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-23 02:39:22,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-23 02:39:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure readw [2022-07-23 02:39:22,525 INFO L138 BoogieDeclarations]: Found implementation of procedure readw [2022-07-23 02:39:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure hdlc_ioctl [2022-07-23 02:39:22,525 INFO L138 BoogieDeclarations]: Found implementation of procedure hdlc_ioctl [2022-07-23 02:39:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-07-23 02:39:22,526 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-07-23 02:39:22,526 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-23 02:39:22,526 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-23 02:39:22,526 INFO L130 BoogieDeclarations]: Found specification of procedure inl [2022-07-23 02:39:22,526 INFO L138 BoogieDeclarations]: Found implementation of procedure inl [2022-07-23 02:39:22,526 INFO L130 BoogieDeclarations]: Found specification of procedure fst_clear_intr [2022-07-23 02:39:22,526 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_clear_intr [2022-07-23 02:39:22,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 02:39:22,526 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2022-07-23 02:39:22,526 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2022-07-23 02:39:22,526 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-07-23 02:39:22,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-07-23 02:39:22,526 INFO L130 BoogieDeclarations]: Found specification of procedure readb [2022-07-23 02:39:22,526 INFO L138 BoogieDeclarations]: Found implementation of procedure readb [2022-07-23 02:39:23,242 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 02:39:23,246 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 02:39:23,326 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 02:39:27,124 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2022-07-23 02:39:27,240 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 02:39:27,258 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 02:39:27,258 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-23 02:39:27,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:39:27 BoogieIcfgContainer [2022-07-23 02:39:27,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 02:39:27,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 02:39:27,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 02:39:27,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 02:39:27,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 02:39:18" (1/3) ... [2022-07-23 02:39:27,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b598b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 02:39:27, skipping insertion in model container [2022-07-23 02:39:27,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:39:21" (2/3) ... [2022-07-23 02:39:27,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b598b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 02:39:27, skipping insertion in model container [2022-07-23 02:39:27,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:39:27" (3/3) ... [2022-07-23 02:39:27,272 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i [2022-07-23 02:39:27,286 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 02:39:27,287 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-23 02:39:27,379 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 02:39:27,388 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@7d6eb244, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@61ac9e7e [2022-07-23 02:39:27,389 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-23 02:39:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 1862 states, 1281 states have (on average 1.3036690085870413) internal successors, (1670), 1295 states have internal predecessors, (1670), 488 states have call successors, (488), 91 states have call predecessors, (488), 90 states have return successors, (481), 479 states have call predecessors, (481), 481 states have call successors, (481) [2022-07-23 02:39:27,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-23 02:39:27,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:39:27,433 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:39:27,434 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-23 02:39:27,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:39:27,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1565129519, now seen corresponding path program 1 times [2022-07-23 02:39:27,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:39:27,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118545180] [2022-07-23 02:39:27,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:39:27,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:39:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:27,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:39:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:28,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:28,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:39:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:28,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:28,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:39:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:28,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:28,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:39:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:28,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:28,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 02:39:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:28,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:28,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 02:39:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:28,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 02:39:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-23 02:39:28,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:39:28,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118545180] [2022-07-23 02:39:28,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118545180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:39:28,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:39:28,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 02:39:28,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722072230] [2022-07-23 02:39:28,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:39:28,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 02:39:28,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:39:28,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 02:39:28,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 02:39:28,232 INFO L87 Difference]: Start difference. First operand has 1862 states, 1281 states have (on average 1.3036690085870413) internal successors, (1670), 1295 states have internal predecessors, (1670), 488 states have call successors, (488), 91 states have call predecessors, (488), 90 states have return successors, (481), 479 states have call predecessors, (481), 481 states have call successors, (481) 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, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-23 02:39:33,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:39:33,314 INFO L93 Difference]: Finished difference Result 5468 states and 7881 transitions. [2022-07-23 02:39:33,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 02:39:33,317 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, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2022-07-23 02:39:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:39:33,370 INFO L225 Difference]: With dead ends: 5468 [2022-07-23 02:39:33,371 INFO L226 Difference]: Without dead ends: 3610 [2022-07-23 02:39:33,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-23 02:39:33,393 INFO L413 NwaCegarLoop]: 2785 mSDtfsCounter, 3022 mSDsluCounter, 2484 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 1338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3464 SdHoareTripleChecker+Valid, 5269 SdHoareTripleChecker+Invalid, 3472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1338 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-23 02:39:33,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3464 Valid, 5269 Invalid, 3472 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1338 Valid, 2134 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-23 02:39:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3610 states. [2022-07-23 02:39:33,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3610 to 3588. [2022-07-23 02:39:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3588 states, 2487 states have (on average 1.2903096099718536) internal successors, (3209), 2514 states have internal predecessors, (3209), 922 states have call successors, (922), 177 states have call predecessors, (922), 176 states have return successors, (918), 914 states have call predecessors, (918), 918 states have call successors, (918) [2022-07-23 02:39:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 5049 transitions. [2022-07-23 02:39:33,725 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 5049 transitions. Word has length 83 [2022-07-23 02:39:33,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:39:33,727 INFO L495 AbstractCegarLoop]: Abstraction has 3588 states and 5049 transitions. [2022-07-23 02:39:33,728 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, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-23 02:39:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 5049 transitions. [2022-07-23 02:39:33,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-23 02:39:33,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:39:33,738 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:39:33,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 02:39:33,739 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-23 02:39:33,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:39:33,740 INFO L85 PathProgramCache]: Analyzing trace with hash -401151663, now seen corresponding path program 1 times [2022-07-23 02:39:33,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:39:33,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845356027] [2022-07-23 02:39:33,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:39:33,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:39:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:33,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:39:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:33,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:33,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:39:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:34,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:34,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:39:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:34,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:34,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:39:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:34,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:34,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 02:39:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:34,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:34,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 02:39:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:34,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 02:39:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:34,102 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-23 02:39:34,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:39:34,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845356027] [2022-07-23 02:39:34,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845356027] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:39:34,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:39:34,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 02:39:34,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369292044] [2022-07-23 02:39:34,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:39:34,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 02:39:34,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:39:34,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 02:39:34,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-23 02:39:34,110 INFO L87 Difference]: Start difference. First operand 3588 states and 5049 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-23 02:39:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:39:42,327 INFO L93 Difference]: Finished difference Result 9274 states and 13077 transitions. [2022-07-23 02:39:42,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 02:39:42,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2022-07-23 02:39:42,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:39:42,366 INFO L225 Difference]: With dead ends: 9274 [2022-07-23 02:39:42,366 INFO L226 Difference]: Without dead ends: 5701 [2022-07-23 02:39:42,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-07-23 02:39:42,382 INFO L413 NwaCegarLoop]: 2998 mSDtfsCounter, 6388 mSDsluCounter, 3800 mSDsCounter, 0 mSdLazyCounter, 5760 mSolverCounterSat, 2497 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7250 SdHoareTripleChecker+Valid, 6798 SdHoareTripleChecker+Invalid, 8257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2497 IncrementalHoareTripleChecker+Valid, 5760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-07-23 02:39:42,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7250 Valid, 6798 Invalid, 8257 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2497 Valid, 5760 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-07-23 02:39:42,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5701 states. [2022-07-23 02:39:42,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5701 to 5632. [2022-07-23 02:39:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5632 states, 3938 states have (on average 1.298374809547994) internal successors, (5113), 3981 states have internal predecessors, (5113), 1401 states have call successors, (1401), 293 states have call predecessors, (1401), 290 states have return successors, (1397), 1385 states have call predecessors, (1397), 1397 states have call successors, (1397) [2022-07-23 02:39:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5632 states to 5632 states and 7911 transitions. [2022-07-23 02:39:42,634 INFO L78 Accepts]: Start accepts. Automaton has 5632 states and 7911 transitions. Word has length 93 [2022-07-23 02:39:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:39:42,636 INFO L495 AbstractCegarLoop]: Abstraction has 5632 states and 7911 transitions. [2022-07-23 02:39:42,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-23 02:39:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 5632 states and 7911 transitions. [2022-07-23 02:39:42,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-23 02:39:42,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:39:42,641 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:39:42,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 02:39:42,642 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-23 02:39:42,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:39:42,642 INFO L85 PathProgramCache]: Analyzing trace with hash -480453640, now seen corresponding path program 1 times [2022-07-23 02:39:42,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:39:42,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698262120] [2022-07-23 02:39:42,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:39:42,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:39:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:42,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:39:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:42,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:42,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:39:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:42,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:42,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:39:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:42,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:42,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:39:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:42,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:42,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 02:39:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:42,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:42,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 02:39:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-23 02:39:42,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:39:42,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698262120] [2022-07-23 02:39:42,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698262120] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:39:42,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:39:42,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 02:39:42,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128377670] [2022-07-23 02:39:42,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:39:42,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 02:39:42,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:39:42,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 02:39:42,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 02:39:42,909 INFO L87 Difference]: Start difference. First operand 5632 states and 7911 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 02:39:47,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:39:47,261 INFO L93 Difference]: Finished difference Result 15171 states and 21240 transitions. [2022-07-23 02:39:47,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 02:39:47,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-07-23 02:39:47,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:39:47,321 INFO L225 Difference]: With dead ends: 15171 [2022-07-23 02:39:47,322 INFO L226 Difference]: Without dead ends: 9554 [2022-07-23 02:39:47,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-23 02:39:47,347 INFO L413 NwaCegarLoop]: 2736 mSDtfsCounter, 2872 mSDsluCounter, 2469 mSDsCounter, 0 mSdLazyCounter, 2155 mSolverCounterSat, 1368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3281 SdHoareTripleChecker+Valid, 5205 SdHoareTripleChecker+Invalid, 3523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1368 IncrementalHoareTripleChecker+Valid, 2155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-23 02:39:47,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3281 Valid, 5205 Invalid, 3523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1368 Valid, 2155 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-23 02:39:47,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9554 states. [2022-07-23 02:39:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9554 to 9494. [2022-07-23 02:39:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9494 states, 6640 states have (on average 1.2884036144578312) internal successors, (8555), 6720 states have internal predecessors, (8555), 2330 states have call successors, (2330), 526 states have call predecessors, (2330), 521 states have return successors, (2326), 2293 states have call predecessors, (2326), 2326 states have call successors, (2326) [2022-07-23 02:39:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9494 states to 9494 states and 13211 transitions. [2022-07-23 02:39:47,857 INFO L78 Accepts]: Start accepts. Automaton has 9494 states and 13211 transitions. Word has length 91 [2022-07-23 02:39:47,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:39:47,859 INFO L495 AbstractCegarLoop]: Abstraction has 9494 states and 13211 transitions. [2022-07-23 02:39:47,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 02:39:47,860 INFO L276 IsEmpty]: Start isEmpty. Operand 9494 states and 13211 transitions. [2022-07-23 02:39:47,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-23 02:39:47,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:39:47,863 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:39:47,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 02:39:47,864 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-23 02:39:47,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:39:47,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1794242578, now seen corresponding path program 1 times [2022-07-23 02:39:47,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:39:47,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037820907] [2022-07-23 02:39:47,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:39:47,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:39:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:47,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:39:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:47,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:47,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:39:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:47,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:47,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:39:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:48,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:48,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:39:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:48,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:48,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 02:39:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:48,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:48,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 02:39:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:48,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-23 02:39:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-23 02:39:48,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:39:48,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037820907] [2022-07-23 02:39:48,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037820907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:39:48,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:39:48,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 02:39:48,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650982946] [2022-07-23 02:39:48,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:39:48,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 02:39:48,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:39:48,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 02:39:48,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 02:39:48,071 INFO L87 Difference]: Start difference. First operand 9494 states and 13211 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-23 02:39:51,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:39:51,798 INFO L93 Difference]: Finished difference Result 23931 states and 33124 transitions. [2022-07-23 02:39:51,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 02:39:51,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2022-07-23 02:39:51,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:39:51,903 INFO L225 Difference]: With dead ends: 23931 [2022-07-23 02:39:51,904 INFO L226 Difference]: Without dead ends: 14452 [2022-07-23 02:39:51,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-23 02:39:51,946 INFO L413 NwaCegarLoop]: 2683 mSDtfsCounter, 2519 mSDsluCounter, 2492 mSDsCounter, 0 mSdLazyCounter, 2053 mSolverCounterSat, 1263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2868 SdHoareTripleChecker+Valid, 5175 SdHoareTripleChecker+Invalid, 3316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1263 IncrementalHoareTripleChecker+Valid, 2053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-23 02:39:51,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2868 Valid, 5175 Invalid, 3316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1263 Valid, 2053 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-23 02:39:51,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14452 states. [2022-07-23 02:39:52,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14452 to 14372. [2022-07-23 02:39:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14372 states, 10037 states have (on average 1.2834512304473449) internal successors, (12882), 10172 states have internal predecessors, (12882), 3450 states have call successors, (3450), 891 states have call predecessors, (3450), 882 states have return successors, (3452), 3371 states have call predecessors, (3452), 3446 states have call successors, (3452) [2022-07-23 02:39:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14372 states to 14372 states and 19784 transitions. [2022-07-23 02:39:52,583 INFO L78 Accepts]: Start accepts. Automaton has 14372 states and 19784 transitions. Word has length 95 [2022-07-23 02:39:52,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:39:52,584 INFO L495 AbstractCegarLoop]: Abstraction has 14372 states and 19784 transitions. [2022-07-23 02:39:52,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-23 02:39:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 14372 states and 19784 transitions. [2022-07-23 02:39:52,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-23 02:39:52,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:39:52,592 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 02:39:52,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 02:39:52,592 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:39:52,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:39:52,594 INFO L85 PathProgramCache]: Analyzing trace with hash 606465146, now seen corresponding path program 1 times [2022-07-23 02:39:52,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:39:52,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029873596] [2022-07-23 02:39:52,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:39:52,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:39:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:52,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:39:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:52,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:52,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:39:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:52,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:52,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:39:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:52,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:52,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:39:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:52,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:52,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 02:39:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:52,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:52,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 02:39:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-23 02:39:52,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:39:52,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029873596] [2022-07-23 02:39:52,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029873596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:39:52,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:39:52,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 02:39:52,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449821486] [2022-07-23 02:39:52,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:39:52,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 02:39:52,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:39:52,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 02:39:52,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 02:39:52,808 INFO L87 Difference]: Start difference. First operand 14372 states and 19784 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 02:39:56,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:39:56,934 INFO L93 Difference]: Finished difference Result 41500 states and 57060 transitions. [2022-07-23 02:39:56,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 02:39:56,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 92 [2022-07-23 02:39:56,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:39:57,089 INFO L225 Difference]: With dead ends: 41500 [2022-07-23 02:39:57,090 INFO L226 Difference]: Without dead ends: 27143 [2022-07-23 02:39:57,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-23 02:39:57,287 INFO L413 NwaCegarLoop]: 3016 mSDtfsCounter, 2918 mSDsluCounter, 2600 mSDsCounter, 0 mSdLazyCounter, 2179 mSolverCounterSat, 1331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3352 SdHoareTripleChecker+Valid, 5616 SdHoareTripleChecker+Invalid, 3510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1331 IncrementalHoareTripleChecker+Valid, 2179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-23 02:39:57,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3352 Valid, 5616 Invalid, 3510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1331 Valid, 2179 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-23 02:39:57,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27143 states. [2022-07-23 02:39:58,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27143 to 26997. [2022-07-23 02:39:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26997 states, 18896 states have (on average 1.2753492802709567) internal successors, (24099), 19168 states have internal predecessors, (24099), 6410 states have call successors, (6410), 1705 states have call predecessors, (6410), 1688 states have return successors, (6418), 6241 states have call predecessors, (6418), 6406 states have call successors, (6418) [2022-07-23 02:39:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26997 states to 26997 states and 36927 transitions. [2022-07-23 02:39:58,448 INFO L78 Accepts]: Start accepts. Automaton has 26997 states and 36927 transitions. Word has length 92 [2022-07-23 02:39:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:39:58,450 INFO L495 AbstractCegarLoop]: Abstraction has 26997 states and 36927 transitions. [2022-07-23 02:39:58,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 02:39:58,450 INFO L276 IsEmpty]: Start isEmpty. Operand 26997 states and 36927 transitions. [2022-07-23 02:39:58,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-23 02:39:58,452 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:39:58,452 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 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-23 02:39:58,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 02:39:58,453 INFO L420 AbstractCegarLoop]: === Iteration 6 === 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-23 02:39:58,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:39:58,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1444009632, now seen corresponding path program 1 times [2022-07-23 02:39:58,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:39:58,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26602612] [2022-07-23 02:39:58,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:39:58,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:39:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:58,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:39:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:58,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:58,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:39:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:58,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:58,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:39:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:58,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:58,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:39:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:58,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:58,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 02:39:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:58,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:39:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:58,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 02:39:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:58,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 02:39:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:58,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 02:39:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:58,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 02:39:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:58,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-23 02:39:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:39:58,814 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-23 02:39:58,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:39:58,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26602612] [2022-07-23 02:39:58,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26602612] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:39:58,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:39:58,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 02:39:58,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880403741] [2022-07-23 02:39:58,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:39:58,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 02:39:58,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:39:58,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 02:39:58,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 02:39:58,817 INFO L87 Difference]: Start difference. First operand 26997 states and 36927 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-23 02:40:03,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:40:03,239 INFO L93 Difference]: Finished difference Result 75036 states and 102616 transitions. [2022-07-23 02:40:03,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 02:40:03,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 108 [2022-07-23 02:40:03,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:40:03,627 INFO L225 Difference]: With dead ends: 75036 [2022-07-23 02:40:03,628 INFO L226 Difference]: Without dead ends: 48054 [2022-07-23 02:40:03,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-23 02:40:03,727 INFO L413 NwaCegarLoop]: 3356 mSDtfsCounter, 2733 mSDsluCounter, 2860 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 1219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3133 SdHoareTripleChecker+Valid, 6216 SdHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1219 IncrementalHoareTripleChecker+Valid, 2066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-23 02:40:03,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3133 Valid, 6216 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1219 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-23 02:40:03,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48054 states. [2022-07-23 02:40:05,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48054 to 47812. [2022-07-23 02:40:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47812 states, 33395 states have (on average 1.2702799820332384) internal successors, (42421), 33945 states have internal predecessors, (42421), 11412 states have call successors, (11412), 3067 states have call predecessors, (11412), 3002 states have return successors, (11440), 11019 states have call predecessors, (11440), 11408 states have call successors, (11440) [2022-07-23 02:40:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47812 states to 47812 states and 65273 transitions. [2022-07-23 02:40:05,867 INFO L78 Accepts]: Start accepts. Automaton has 47812 states and 65273 transitions. Word has length 108 [2022-07-23 02:40:05,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:40:05,867 INFO L495 AbstractCegarLoop]: Abstraction has 47812 states and 65273 transitions. [2022-07-23 02:40:05,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-23 02:40:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 47812 states and 65273 transitions. [2022-07-23 02:40:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-23 02:40:05,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:40:05,870 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 02:40:05,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 02:40:05,871 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-23 02:40:05,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:40:05,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1186239737, now seen corresponding path program 1 times [2022-07-23 02:40:05,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:40:05,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604635157] [2022-07-23 02:40:05,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:40:05,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:40:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:05,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:40:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:05,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:05,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:40:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:05,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:05,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:40:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:06,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:06,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:40:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:06,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:06,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 02:40:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:06,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:06,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 02:40:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:06,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 02:40:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:06,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-23 02:40:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:06,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 02:40:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:06,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 02:40:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:06,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-23 02:40:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:06,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 02:40:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:06,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:06,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-23 02:40:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:06,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-23 02:40:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:06,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 02:40:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:06,107 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-07-23 02:40:06,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:40:06,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604635157] [2022-07-23 02:40:06,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604635157] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:40:06,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:40:06,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 02:40:06,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050255887] [2022-07-23 02:40:06,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:40:06,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 02:40:06,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:40:06,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 02:40:06,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 02:40:06,110 INFO L87 Difference]: Start difference. First operand 47812 states and 65273 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (19), 3 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-23 02:40:09,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:40:09,606 INFO L93 Difference]: Finished difference Result 95820 states and 130864 transitions. [2022-07-23 02:40:09,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 02:40:09,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (19), 3 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 150 [2022-07-23 02:40:09,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:40:09,841 INFO L225 Difference]: With dead ends: 95820 [2022-07-23 02:40:09,841 INFO L226 Difference]: Without dead ends: 48100 [2022-07-23 02:40:10,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 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-23 02:40:10,167 INFO L413 NwaCegarLoop]: 2443 mSDtfsCounter, 551 mSDsluCounter, 2505 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 4948 SdHoareTripleChecker+Invalid, 2150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-23 02:40:10,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 4948 Invalid, 2150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-23 02:40:10,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48100 states. [2022-07-23 02:40:11,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48100 to 47860. [2022-07-23 02:40:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47860 states, 33443 states have (on average 1.269892055138594) internal successors, (42469), 33993 states have internal predecessors, (42469), 11412 states have call successors, (11412), 3067 states have call predecessors, (11412), 3002 states have return successors, (11440), 11019 states have call predecessors, (11440), 11408 states have call successors, (11440) [2022-07-23 02:40:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47860 states to 47860 states and 65321 transitions. [2022-07-23 02:40:11,932 INFO L78 Accepts]: Start accepts. Automaton has 47860 states and 65321 transitions. Word has length 150 [2022-07-23 02:40:11,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:40:11,932 INFO L495 AbstractCegarLoop]: Abstraction has 47860 states and 65321 transitions. [2022-07-23 02:40:11,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (19), 3 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-23 02:40:11,933 INFO L276 IsEmpty]: Start isEmpty. Operand 47860 states and 65321 transitions. [2022-07-23 02:40:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-23 02:40:11,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:40:11,936 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 02:40:11,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 02:40:11,936 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-23 02:40:11,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:40:11,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1165995741, now seen corresponding path program 1 times [2022-07-23 02:40:11,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:40:11,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44934918] [2022-07-23 02:40:11,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:40:11,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:40:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:40:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:40:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:40:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:40:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 02:40:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 02:40:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 02:40:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-23 02:40:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 02:40:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-23 02:40:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 02:40:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 02:40:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 02:40:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 02:40:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 02:40:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-07-23 02:40:12,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:40:12,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44934918] [2022-07-23 02:40:12,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44934918] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 02:40:12,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480492321] [2022-07-23 02:40:12,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:40:12,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 02:40:12,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 02:40:12,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 02:40:12,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 02:40:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:13,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 1628 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 02:40:13,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 02:40:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-07-23 02:40:13,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 02:40:13,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480492321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:40:13,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 02:40:13,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-07-23 02:40:13,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762692159] [2022-07-23 02:40:13,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:40:13,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 02:40:13,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:40:13,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 02:40:13,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:40:13,206 INFO L87 Difference]: Start difference. First operand 47860 states and 65321 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-23 02:40:14,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:40:14,935 INFO L93 Difference]: Finished difference Result 103050 states and 140745 transitions. [2022-07-23 02:40:14,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 02:40:14,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 152 [2022-07-23 02:40:14,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:40:15,118 INFO L225 Difference]: With dead ends: 103050 [2022-07-23 02:40:15,118 INFO L226 Difference]: Without dead ends: 55282 [2022-07-23 02:40:15,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:40:15,207 INFO L413 NwaCegarLoop]: 3167 mSDtfsCounter, 2531 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2531 SdHoareTripleChecker+Valid, 5289 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 02:40:15,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2531 Valid, 5289 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 02:40:15,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55282 states. [2022-07-23 02:40:16,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55282 to 55259. [2022-07-23 02:40:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55259 states, 38803 states have (on average 1.2701852949514212) internal successors, (49287), 39353 states have internal predecessors, (49287), 13038 states have call successors, (13038), 3488 states have call predecessors, (13038), 3415 states have return successors, (13074), 12677 states have call predecessors, (13074), 13034 states have call successors, (13074) [2022-07-23 02:40:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55259 states to 55259 states and 75399 transitions. [2022-07-23 02:40:17,081 INFO L78 Accepts]: Start accepts. Automaton has 55259 states and 75399 transitions. Word has length 152 [2022-07-23 02:40:17,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:40:17,082 INFO L495 AbstractCegarLoop]: Abstraction has 55259 states and 75399 transitions. [2022-07-23 02:40:17,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-23 02:40:17,082 INFO L276 IsEmpty]: Start isEmpty. Operand 55259 states and 75399 transitions. [2022-07-23 02:40:17,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-23 02:40:17,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:40:17,087 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 02:40:17,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-23 02:40:17,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 02:40:17,298 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-23 02:40:17,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:40:17,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1025447131, now seen corresponding path program 1 times [2022-07-23 02:40:17,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:40:17,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439751485] [2022-07-23 02:40:17,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:40:17,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:40:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:40:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:40:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:40:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:40:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 02:40:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 02:40:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 02:40:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-23 02:40:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-23 02:40:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-23 02:40:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 02:40:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 02:40:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 02:40:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 02:40:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 02:40:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-07-23 02:40:17,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:40:17,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439751485] [2022-07-23 02:40:17,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439751485] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 02:40:17,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654081659] [2022-07-23 02:40:17,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:40:17,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 02:40:17,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 02:40:17,542 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 02:40:17,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 02:40:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:18,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 1629 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 02:40:18,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 02:40:18,162 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 76 proven. 1 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-23 02:40:18,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 02:40:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-07-23 02:40:18,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654081659] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 02:40:18,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 02:40:18,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-07-23 02:40:18,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326508008] [2022-07-23 02:40:18,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 02:40:18,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 02:40:18,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:40:18,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 02:40:18,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-23 02:40:18,262 INFO L87 Difference]: Start difference. First operand 55259 states and 75399 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-23 02:40:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:40:23,775 INFO L93 Difference]: Finished difference Result 110734 states and 151134 transitions. [2022-07-23 02:40:23,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 02:40:23,776 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 152 [2022-07-23 02:40:23,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:40:23,992 INFO L225 Difference]: With dead ends: 110734 [2022-07-23 02:40:23,992 INFO L226 Difference]: Without dead ends: 55567 [2022-07-23 02:40:24,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-23 02:40:24,131 INFO L413 NwaCegarLoop]: 2443 mSDtfsCounter, 556 mSDsluCounter, 6879 mSDsCounter, 0 mSdLazyCounter, 5088 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 9322 SdHoareTripleChecker+Invalid, 5570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 5088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-23 02:40:24,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 9322 Invalid, 5570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 5088 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-23 02:40:24,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55567 states. [2022-07-23 02:40:25,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55567 to 55331. [2022-07-23 02:40:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55331 states, 38875 states have (on average 1.269684887459807) internal successors, (49359), 39425 states have internal predecessors, (49359), 13038 states have call successors, (13038), 3488 states have call predecessors, (13038), 3415 states have return successors, (13074), 12677 states have call predecessors, (13074), 13034 states have call successors, (13074) [2022-07-23 02:40:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55331 states to 55331 states and 75471 transitions. [2022-07-23 02:40:26,027 INFO L78 Accepts]: Start accepts. Automaton has 55331 states and 75471 transitions. Word has length 152 [2022-07-23 02:40:26,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:40:26,028 INFO L495 AbstractCegarLoop]: Abstraction has 55331 states and 75471 transitions. [2022-07-23 02:40:26,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-23 02:40:26,028 INFO L276 IsEmpty]: Start isEmpty. Operand 55331 states and 75471 transitions. [2022-07-23 02:40:26,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-23 02:40:26,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:40:26,032 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 02:40:26,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-23 02:40:26,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-23 02:40:26,260 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-23 02:40:26,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:40:26,260 INFO L85 PathProgramCache]: Analyzing trace with hash 686822265, now seen corresponding path program 2 times [2022-07-23 02:40:26,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:40:26,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362576357] [2022-07-23 02:40:26,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:40:26,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:40:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:40:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:40:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:40:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:40:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 02:40:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 02:40:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 02:40:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 02:40:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-23 02:40:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 02:40:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 02:40:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 02:40:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 02:40:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 02:40:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 02:40:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-07-23 02:40:26,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:40:26,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362576357] [2022-07-23 02:40:26,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362576357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:40:26,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:40:26,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 02:40:26,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341579873] [2022-07-23 02:40:26,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:40:26,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 02:40:26,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:40:26,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 02:40:26,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:40:26,839 INFO L87 Difference]: Start difference. First operand 55331 states and 75471 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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-23 02:40:31,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:40:31,215 INFO L93 Difference]: Finished difference Result 55573 states and 75807 transitions. [2022-07-23 02:40:31,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 02:40:31,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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 158 [2022-07-23 02:40:31,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:40:31,559 INFO L225 Difference]: With dead ends: 55573 [2022-07-23 02:40:31,559 INFO L226 Difference]: Without dead ends: 55571 [2022-07-23 02:40:31,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 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-23 02:40:31,583 INFO L413 NwaCegarLoop]: 2442 mSDtfsCounter, 2520 mSDsluCounter, 3973 mSDsCounter, 0 mSdLazyCounter, 2801 mSolverCounterSat, 921 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2819 SdHoareTripleChecker+Valid, 6415 SdHoareTripleChecker+Invalid, 3722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 921 IncrementalHoareTripleChecker+Valid, 2801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-23 02:40:31,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2819 Valid, 6415 Invalid, 3722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [921 Valid, 2801 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-23 02:40:31,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55571 states. [2022-07-23 02:40:33,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55571 to 55335. [2022-07-23 02:40:33,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55335 states, 38878 states have (on average 1.269664077370235) internal successors, (49362), 39428 states have internal predecessors, (49362), 13038 states have call successors, (13038), 3489 states have call predecessors, (13038), 3416 states have return successors, (13074), 12677 states have call predecessors, (13074), 13034 states have call successors, (13074) [2022-07-23 02:40:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55335 states to 55335 states and 75474 transitions. [2022-07-23 02:40:33,393 INFO L78 Accepts]: Start accepts. Automaton has 55335 states and 75474 transitions. Word has length 158 [2022-07-23 02:40:33,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:40:33,394 INFO L495 AbstractCegarLoop]: Abstraction has 55335 states and 75474 transitions. [2022-07-23 02:40:33,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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-23 02:40:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 55335 states and 75474 transitions. [2022-07-23 02:40:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-23 02:40:33,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:40:33,398 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 02:40:33,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 02:40:33,398 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-23 02:40:33,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:40:33,398 INFO L85 PathProgramCache]: Analyzing trace with hash -296417503, now seen corresponding path program 1 times [2022-07-23 02:40:33,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:40:33,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127418891] [2022-07-23 02:40:33,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:40:33,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:40:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:40:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:40:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:40:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:40:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 02:40:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 02:40:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 02:40:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 02:40:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-23 02:40:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 02:40:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 02:40:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 02:40:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 02:40:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 02:40:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 02:40:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-23 02:40:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2022-07-23 02:40:33,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:40:33,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127418891] [2022-07-23 02:40:33,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127418891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:40:33,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:40:33,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 02:40:33,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280426848] [2022-07-23 02:40:33,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:40:33,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 02:40:33,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:40:33,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 02:40:33,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:40:33,714 INFO L87 Difference]: Start difference. First operand 55335 states and 75474 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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-23 02:40:38,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:40:38,215 INFO L93 Difference]: Finished difference Result 55577 states and 75810 transitions. [2022-07-23 02:40:38,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 02:40:38,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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 163 [2022-07-23 02:40:38,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:40:38,428 INFO L225 Difference]: With dead ends: 55577 [2022-07-23 02:40:38,428 INFO L226 Difference]: Without dead ends: 55575 [2022-07-23 02:40:38,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 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-23 02:40:38,456 INFO L413 NwaCegarLoop]: 2445 mSDtfsCounter, 2512 mSDsluCounter, 3973 mSDsCounter, 0 mSdLazyCounter, 2801 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2811 SdHoareTripleChecker+Valid, 6418 SdHoareTripleChecker+Invalid, 3721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 2801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-23 02:40:38,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2811 Valid, 6418 Invalid, 3721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 2801 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-23 02:40:38,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55575 states. [2022-07-23 02:40:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55575 to 55339. [2022-07-23 02:40:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55339 states, 38881 states have (on average 1.2696432704920142) internal successors, (49365), 39431 states have internal predecessors, (49365), 13038 states have call successors, (13038), 3490 states have call predecessors, (13038), 3417 states have return successors, (13074), 12677 states have call predecessors, (13074), 13034 states have call successors, (13074) [2022-07-23 02:40:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55339 states to 55339 states and 75477 transitions. [2022-07-23 02:40:40,481 INFO L78 Accepts]: Start accepts. Automaton has 55339 states and 75477 transitions. Word has length 163 [2022-07-23 02:40:40,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:40:40,482 INFO L495 AbstractCegarLoop]: Abstraction has 55339 states and 75477 transitions. [2022-07-23 02:40:40,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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-23 02:40:40,483 INFO L276 IsEmpty]: Start isEmpty. Operand 55339 states and 75477 transitions. [2022-07-23 02:40:40,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-23 02:40:40,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:40:40,486 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 02:40:40,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 02:40:40,487 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-23 02:40:40,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:40:40,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1344588743, now seen corresponding path program 1 times [2022-07-23 02:40:40,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:40:40,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132927494] [2022-07-23 02:40:40,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:40:40,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:40:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:40:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:40:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:40:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:40:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 02:40:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 02:40:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 02:40:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 02:40:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-23 02:40:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 02:40:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 02:40:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 02:40:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 02:40:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 02:40:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 02:40:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-23 02:40:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-23 02:40:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:40,789 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-07-23 02:40:40,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:40:40,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132927494] [2022-07-23 02:40:40,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132927494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:40:40,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:40:40,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 02:40:40,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231369144] [2022-07-23 02:40:40,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:40:40,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 02:40:40,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:40:40,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 02:40:40,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:40:40,792 INFO L87 Difference]: Start difference. First operand 55339 states and 75477 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 02:40:45,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:40:45,311 INFO L93 Difference]: Finished difference Result 55581 states and 75813 transitions. [2022-07-23 02:40:45,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 02:40:45,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 168 [2022-07-23 02:40:45,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:40:45,488 INFO L225 Difference]: With dead ends: 55581 [2022-07-23 02:40:45,488 INFO L226 Difference]: Without dead ends: 55579 [2022-07-23 02:40:45,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 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-23 02:40:45,509 INFO L413 NwaCegarLoop]: 2445 mSDtfsCounter, 2512 mSDsluCounter, 3973 mSDsCounter, 0 mSdLazyCounter, 2801 mSolverCounterSat, 919 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2811 SdHoareTripleChecker+Valid, 6418 SdHoareTripleChecker+Invalid, 3720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 919 IncrementalHoareTripleChecker+Valid, 2801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-23 02:40:45,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2811 Valid, 6418 Invalid, 3720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [919 Valid, 2801 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-23 02:40:45,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55579 states. [2022-07-23 02:40:47,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55579 to 55343. [2022-07-23 02:40:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55343 states, 38884 states have (on average 1.2696224668244007) internal successors, (49368), 39434 states have internal predecessors, (49368), 13038 states have call successors, (13038), 3491 states have call predecessors, (13038), 3418 states have return successors, (13074), 12677 states have call predecessors, (13074), 13034 states have call successors, (13074) [2022-07-23 02:40:47,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55343 states to 55343 states and 75480 transitions. [2022-07-23 02:40:47,371 INFO L78 Accepts]: Start accepts. Automaton has 55343 states and 75480 transitions. Word has length 168 [2022-07-23 02:40:47,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:40:47,372 INFO L495 AbstractCegarLoop]: Abstraction has 55343 states and 75480 transitions. [2022-07-23 02:40:47,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 02:40:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 55343 states and 75480 transitions. [2022-07-23 02:40:47,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-23 02:40:47,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:40:47,376 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 02:40:47,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 02:40:47,377 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-23 02:40:47,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:40:47,377 INFO L85 PathProgramCache]: Analyzing trace with hash -449147423, now seen corresponding path program 1 times [2022-07-23 02:40:47,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:40:47,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425161215] [2022-07-23 02:40:47,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:40:47,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:40:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:40:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:40:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:40:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:40:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 02:40:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 02:40:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 02:40:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 02:40:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-23 02:40:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 02:40:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 02:40:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 02:40:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 02:40:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 02:40:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 02:40:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-23 02:40:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-23 02:40:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 02:40:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:47,657 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2022-07-23 02:40:47,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:40:47,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425161215] [2022-07-23 02:40:47,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425161215] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:40:47,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:40:47,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 02:40:47,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219850944] [2022-07-23 02:40:47,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:40:47,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 02:40:47,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:40:47,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 02:40:47,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:40:47,660 INFO L87 Difference]: Start difference. First operand 55343 states and 75480 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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-23 02:40:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:40:52,357 INFO L93 Difference]: Finished difference Result 56667 states and 76617 transitions. [2022-07-23 02:40:52,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 02:40:52,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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 173 [2022-07-23 02:40:52,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:40:52,611 INFO L225 Difference]: With dead ends: 56667 [2022-07-23 02:40:52,611 INFO L226 Difference]: Without dead ends: 56665 [2022-07-23 02:40:52,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-23 02:40:52,649 INFO L413 NwaCegarLoop]: 2458 mSDtfsCounter, 2468 mSDsluCounter, 3985 mSDsCounter, 0 mSdLazyCounter, 2942 mSolverCounterSat, 850 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2779 SdHoareTripleChecker+Valid, 6443 SdHoareTripleChecker+Invalid, 3792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 850 IncrementalHoareTripleChecker+Valid, 2942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-23 02:40:52,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2779 Valid, 6443 Invalid, 3792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [850 Valid, 2942 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-23 02:40:52,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56665 states. [2022-07-23 02:40:54,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56665 to 56427. [2022-07-23 02:40:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56427 states, 39641 states have (on average 1.2656340657400167) internal successors, (50171), 40191 states have internal predecessors, (50171), 13038 states have call successors, (13038), 3818 states have call predecessors, (13038), 3745 states have return successors, (13074), 12677 states have call predecessors, (13074), 13034 states have call successors, (13074) [2022-07-23 02:40:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56427 states to 56427 states and 76283 transitions. [2022-07-23 02:40:54,715 INFO L78 Accepts]: Start accepts. Automaton has 56427 states and 76283 transitions. Word has length 173 [2022-07-23 02:40:54,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:40:54,715 INFO L495 AbstractCegarLoop]: Abstraction has 56427 states and 76283 transitions. [2022-07-23 02:40:54,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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-23 02:40:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 56427 states and 76283 transitions. [2022-07-23 02:40:54,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-23 02:40:54,720 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:40:54,720 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1] [2022-07-23 02:40:54,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 02:40:54,721 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-23 02:40:54,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:40:54,721 INFO L85 PathProgramCache]: Analyzing trace with hash -724162530, now seen corresponding path program 1 times [2022-07-23 02:40:54,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:40:54,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812017358] [2022-07-23 02:40:54,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:40:54,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:40:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:40:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:40:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:40:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:40:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 02:40:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 02:40:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 02:40:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 02:40:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-23 02:40:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 02:40:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 02:40:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 02:40:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:40:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 02:40:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 02:40:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 02:40:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 02:40:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 02:40:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-23 02:40:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-23 02:40:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-23 02:40:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-23 02:40:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:40:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2022-07-23 02:40:54,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:40:54,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812017358] [2022-07-23 02:40:54,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812017358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:40:54,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:40:54,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 02:40:54,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619713083] [2022-07-23 02:40:54,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:40:55,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 02:40:55,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:40:55,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 02:40:55,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 02:40:55,001 INFO L87 Difference]: Start difference. First operand 56427 states and 76283 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-23 02:41:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:41:02,438 INFO L93 Difference]: Finished difference Result 112625 states and 152225 transitions. [2022-07-23 02:41:02,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 02:41:02,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 189 [2022-07-23 02:41:02,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:41:02,655 INFO L225 Difference]: With dead ends: 112625 [2022-07-23 02:41:02,655 INFO L226 Difference]: Without dead ends: 66234 [2022-07-23 02:41:02,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 02:41:02,770 INFO L413 NwaCegarLoop]: 2818 mSDtfsCounter, 3539 mSDsluCounter, 3439 mSDsCounter, 0 mSdLazyCounter, 2903 mSolverCounterSat, 2480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3795 SdHoareTripleChecker+Valid, 6257 SdHoareTripleChecker+Invalid, 5383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2480 IncrementalHoareTripleChecker+Valid, 2903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-23 02:41:02,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3795 Valid, 6257 Invalid, 5383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2480 Valid, 2903 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-23 02:41:02,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66234 states. [2022-07-23 02:41:05,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66234 to 65950. [2022-07-23 02:41:05,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65950 states, 46426 states have (on average 1.2609098350062464) internal successors, (58539), 47036 states have internal predecessors, (58539), 15060 states have call successors, (15060), 4542 states have call predecessors, (15060), 4461 states have return successors, (15104), 14671 states have call predecessors, (15104), 15056 states have call successors, (15104) [2022-07-23 02:41:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65950 states to 65950 states and 88703 transitions. [2022-07-23 02:41:05,416 INFO L78 Accepts]: Start accepts. Automaton has 65950 states and 88703 transitions. Word has length 189 [2022-07-23 02:41:05,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:41:05,417 INFO L495 AbstractCegarLoop]: Abstraction has 65950 states and 88703 transitions. [2022-07-23 02:41:05,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-23 02:41:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 65950 states and 88703 transitions. [2022-07-23 02:41:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-23 02:41:05,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:41:05,422 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1] [2022-07-23 02:41:05,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 02:41:05,422 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-23 02:41:05,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:41:05,423 INFO L85 PathProgramCache]: Analyzing trace with hash -683487780, now seen corresponding path program 1 times [2022-07-23 02:41:05,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:41:05,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628148932] [2022-07-23 02:41:05,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:41:05,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:41:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:41:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:41:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:41:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:41:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:41:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:41:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:41:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:41:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 02:41:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:41:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 02:41:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 02:41:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 02:41:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-23 02:41:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 02:41:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 02:41:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 02:41:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:41:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 02:41:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 02:41:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 02:41:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 02:41:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 02:41:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-23 02:41:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-23 02:41:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-23 02:41:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-23 02:41:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2022-07-23 02:41:05,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:41:05,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628148932] [2022-07-23 02:41:05,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628148932] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:41:05,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:41:05,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 02:41:05,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952336578] [2022-07-23 02:41:05,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:41:05,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 02:41:05,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:41:05,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 02:41:05,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 02:41:05,638 INFO L87 Difference]: Start difference. First operand 65950 states and 88703 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-23 02:41:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:41:13,677 INFO L93 Difference]: Finished difference Result 131536 states and 177042 transitions. [2022-07-23 02:41:13,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 02:41:13,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 189 [2022-07-23 02:41:13,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:41:13,947 INFO L225 Difference]: With dead ends: 131536 [2022-07-23 02:41:13,947 INFO L226 Difference]: Without dead ends: 65678 [2022-07-23 02:41:14,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 02:41:14,093 INFO L413 NwaCegarLoop]: 4329 mSDtfsCounter, 2702 mSDsluCounter, 4796 mSDsCounter, 0 mSdLazyCounter, 3069 mSolverCounterSat, 1863 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2957 SdHoareTripleChecker+Valid, 9125 SdHoareTripleChecker+Invalid, 4932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1863 IncrementalHoareTripleChecker+Valid, 3069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-23 02:41:14,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2957 Valid, 9125 Invalid, 4932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1863 Valid, 3069 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-23 02:41:14,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65678 states. [2022-07-23 02:41:16,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65678 to 65359. [2022-07-23 02:41:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65359 states, 45994 states have (on average 1.2608383702222028) internal successors, (57991), 46596 states have internal predecessors, (57991), 14953 states have call successors, (14953), 4490 states have call predecessors, (14953), 4409 states have return successors, (14997), 14572 states have call predecessors, (14997), 14949 states have call successors, (14997) [2022-07-23 02:41:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65359 states to 65359 states and 87941 transitions. [2022-07-23 02:41:16,803 INFO L78 Accepts]: Start accepts. Automaton has 65359 states and 87941 transitions. Word has length 189 [2022-07-23 02:41:16,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:41:16,804 INFO L495 AbstractCegarLoop]: Abstraction has 65359 states and 87941 transitions. [2022-07-23 02:41:16,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-23 02:41:16,805 INFO L276 IsEmpty]: Start isEmpty. Operand 65359 states and 87941 transitions. [2022-07-23 02:41:16,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-23 02:41:16,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:41:16,808 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 02:41:16,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 02:41:16,808 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-23 02:41:16,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:41:16,809 INFO L85 PathProgramCache]: Analyzing trace with hash 827725049, now seen corresponding path program 1 times [2022-07-23 02:41:16,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:41:16,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862819318] [2022-07-23 02:41:16,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:41:16,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:41:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:16,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:41:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:16,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:41:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:16,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:41:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:16,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:41:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:16,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:41:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:16,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:41:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:16,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:41:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:17,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:41:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:17,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 02:41:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:17,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:41:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:17,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 02:41:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:17,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 02:41:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:17,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 02:41:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:17,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-23 02:41:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:17,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 02:41:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:17,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 02:41:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:17,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 02:41:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:17,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:41:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:17,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 02:41:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:17,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 02:41:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:17,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 02:41:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:17,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-23 02:41:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:17,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-23 02:41:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:17,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 02:41:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:17,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-23 02:41:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:17,101 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2022-07-23 02:41:17,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:41:17,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862819318] [2022-07-23 02:41:17,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862819318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:41:17,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:41:17,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 02:41:17,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515708840] [2022-07-23 02:41:17,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:41:17,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 02:41:17,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:41:17,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 02:41:17,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:41:17,104 INFO L87 Difference]: Start difference. First operand 65359 states and 87941 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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-23 02:41:21,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 02:41:21,871 INFO L93 Difference]: Finished difference Result 65863 states and 88494 transitions. [2022-07-23 02:41:21,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 02:41:21,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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 178 [2022-07-23 02:41:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 02:41:22,094 INFO L225 Difference]: With dead ends: 65863 [2022-07-23 02:41:22,094 INFO L226 Difference]: Without dead ends: 65861 [2022-07-23 02:41:22,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-23 02:41:22,130 INFO L413 NwaCegarLoop]: 2445 mSDtfsCounter, 2511 mSDsluCounter, 3979 mSDsCounter, 0 mSdLazyCounter, 2827 mSolverCounterSat, 910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2806 SdHoareTripleChecker+Valid, 6424 SdHoareTripleChecker+Invalid, 3737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 910 IncrementalHoareTripleChecker+Valid, 2827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-23 02:41:22,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2806 Valid, 6424 Invalid, 3737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [910 Valid, 2827 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-23 02:41:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65861 states. [2022-07-23 02:41:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65861 to 65579. [2022-07-23 02:41:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65579 states, 46159 states have (on average 1.2599059771658832) internal successors, (58156), 46761 states have internal predecessors, (58156), 14953 states have call successors, (14953), 4545 states have call predecessors, (14953), 4464 states have return successors, (14997), 14572 states have call predecessors, (14997), 14949 states have call successors, (14997) [2022-07-23 02:41:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65579 states to 65579 states and 88106 transitions. [2022-07-23 02:41:24,789 INFO L78 Accepts]: Start accepts. Automaton has 65579 states and 88106 transitions. Word has length 178 [2022-07-23 02:41:24,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 02:41:24,789 INFO L495 AbstractCegarLoop]: Abstraction has 65579 states and 88106 transitions. [2022-07-23 02:41:24,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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-23 02:41:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 65579 states and 88106 transitions. [2022-07-23 02:41:24,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-23 02:41:24,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 02:41:24,794 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 02:41:24,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 02:41:24,794 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-23 02:41:24,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 02:41:24,795 INFO L85 PathProgramCache]: Analyzing trace with hash -983018335, now seen corresponding path program 1 times [2022-07-23 02:41:24,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 02:41:24,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52207456] [2022-07-23 02:41:24,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 02:41:24,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 02:41:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:24,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-23 02:41:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:24,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:41:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:24,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 02:41:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:24,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:41:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:24,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 02:41:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:24,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:41:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:24,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 02:41:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:24,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:41:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:24,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 02:41:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:25,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:41:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:25,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 02:41:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:25,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 02:41:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:25,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 02:41:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:25,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-23 02:41:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:25,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 02:41:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:25,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 02:41:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:25,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 02:41:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:25,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 02:41:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:25,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 02:41:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:25,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 02:41:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:25,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 02:41:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:25,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-23 02:41:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:25,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-23 02:41:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:25,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 02:41:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:25,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-23 02:41:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:25,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-23 02:41:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 02:41:25,149 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-07-23 02:41:25,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 02:41:25,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52207456] [2022-07-23 02:41:25,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52207456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 02:41:25,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 02:41:25,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 02:41:25,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362767006] [2022-07-23 02:41:25,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 02:41:25,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 02:41:25,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 02:41:25,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 02:41:25,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 02:41:25,158 INFO L87 Difference]: Start difference. First operand 65579 states and 88106 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21)