./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 eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-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-?-eb692b5 [2022-07-20 02:24:23,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 02:24:23,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 02:24:23,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 02:24:23,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 02:24:23,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 02:24:23,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 02:24:23,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 02:24:23,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 02:24:23,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 02:24:23,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 02:24:23,253 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 02:24:23,254 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 02:24:23,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 02:24:23,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 02:24:23,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 02:24:23,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 02:24:23,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 02:24:23,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 02:24:23,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 02:24:23,272 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 02:24:23,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 02:24:23,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 02:24:23,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 02:24:23,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 02:24:23,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 02:24:23,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 02:24:23,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 02:24:23,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 02:24:23,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 02:24:23,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 02:24:23,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 02:24:23,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 02:24:23,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 02:24:23,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 02:24:23,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 02:24:23,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 02:24:23,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 02:24:23,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 02:24:23,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 02:24:23,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 02:24:23,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 02:24:23,296 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 02:24:23,314 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 02:24:23,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 02:24:23,314 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 02:24:23,314 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 02:24:23,315 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 02:24:23,315 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 02:24:23,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 02:24:23,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 02:24:23,316 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 02:24:23,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 02:24:23,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 02:24:23,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 02:24:23,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 02:24:23,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 02:24:23,317 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 02:24:23,317 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 02:24:23,317 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 02:24:23,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 02:24:23,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 02:24:23,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 02:24:23,318 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 02:24:23,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 02:24:23,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 02:24:23,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 02:24:23,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 02:24:23,318 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 02:24:23,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 02:24:23,319 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 02:24:23,319 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 02:24:23,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 02:24:23,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-20 02:24:23,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 02:24:23,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 02:24:23,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 02:24:23,514 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 02:24:23,514 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 02:24:23,515 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-20 02:24:23,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a4c53fa8/5bdc5447190f427e897a6be1de0edac5/FLAGf492b2fe0 [2022-07-20 02:24:24,170 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 02:24:24,171 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-20 02:24:24,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a4c53fa8/5bdc5447190f427e897a6be1de0edac5/FLAGf492b2fe0 [2022-07-20 02:24:24,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a4c53fa8/5bdc5447190f427e897a6be1de0edac5 [2022-07-20 02:24:24,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 02:24:24,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 02:24:24,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 02:24:24,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 02:24:24,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 02:24:24,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:24:24" (1/1) ... [2022-07-20 02:24:24,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4634420a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:24:24, skipping insertion in model container [2022-07-20 02:24:24,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:24:24" (1/1) ... [2022-07-20 02:24:24,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 02:24:24,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 02:24:26,232 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-20 02:24:26,238 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-20 02:24:26,239 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-20 02:24:26,240 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-20 02:24:26,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 02:24:26,291 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 02:24:26,590 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-20 02:24:26,591 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-20 02:24:26,591 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-20 02:24:26,591 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-20 02:24:26,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 02:24:26,693 INFO L208 MainTranslator]: Completed translation [2022-07-20 02:24:26,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:24:26 WrapperNode [2022-07-20 02:24:26,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 02:24:26,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 02:24:26,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 02:24:26,695 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 02:24:26,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:24:26" (1/1) ... [2022-07-20 02:24:26,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:24:26" (1/1) ... [2022-07-20 02:24:26,912 INFO L137 Inliner]: procedures = 418, calls = 1969, calls flagged for inlining = 195, calls inlined = 179, statements flattened = 5299 [2022-07-20 02:24:26,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 02:24:26,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 02:24:26,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 02:24:26,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 02:24:26,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:24:26" (1/1) ... [2022-07-20 02:24:26,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:24:26" (1/1) ... [2022-07-20 02:24:26,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:24:26" (1/1) ... [2022-07-20 02:24:26,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:24:26" (1/1) ... [2022-07-20 02:24:27,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:24:26" (1/1) ... [2022-07-20 02:24:27,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:24:26" (1/1) ... [2022-07-20 02:24:27,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:24:26" (1/1) ... [2022-07-20 02:24:27,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 02:24:27,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 02:24:27,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 02:24:27,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 02:24:27,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:24:26" (1/1) ... [2022-07-20 02:24:27,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 02:24:27,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 02:24:27,139 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 02:24:27,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 02:24:27,181 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_EMGentry_exit_fst_cleanup_module_12_2 [2022-07-20 02:24:27,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_EMGentry_exit_fst_cleanup_module_12_2 [2022-07-20 02:24:27,181 INFO L130 BoogieDeclarations]: Found specification of procedure pci_release_regions [2022-07-20 02:24:27,181 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_release_regions [2022-07-20 02:24:27,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-20 02:24:27,181 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-20 02:24:27,182 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-07-20 02:24:27,182 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-07-20 02:24:27,182 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 02:24:27,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 02:24:27,182 INFO L130 BoogieDeclarations]: Found specification of procedure fst_remove_one [2022-07-20 02:24:27,182 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_remove_one [2022-07-20 02:24:27,182 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-20 02:24:27,182 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-20 02:24:27,182 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 02:24:27,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 02:24:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_ok [2022-07-20 02:24:27,183 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_ok [2022-07-20 02:24:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_on [2022-07-20 02:24:27,183 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_on [2022-07-20 02:24:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_toio [2022-07-20 02:24:27,183 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_toio [2022-07-20 02:24:27,183 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_61 [2022-07-20 02:24:27,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_61 [2022-07-20 02:24:27,184 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_67 [2022-07-20 02:24:27,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_67 [2022-07-20 02:24:27,184 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-20 02:24:27,184 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-20 02:24:27,184 INFO L130 BoogieDeclarations]: Found specification of procedure fst_close [2022-07-20 02:24:27,184 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_close [2022-07-20 02:24:27,185 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-20 02:24:27,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-20 02:24:27,185 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2022-07-20 02:24:27,185 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2022-07-20 02:24:27,185 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-20 02:24:27,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-20 02:24:27,185 INFO L130 BoogieDeclarations]: Found specification of procedure fst_tx_timeout [2022-07-20 02:24:27,185 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_tx_timeout [2022-07-20 02:24:27,185 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-20 02:24:27,186 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-20 02:24:27,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 02:24:27,186 INFO L130 BoogieDeclarations]: Found specification of procedure iounmap [2022-07-20 02:24:27,186 INFO L138 BoogieDeclarations]: Found implementation of procedure iounmap [2022-07-20 02:24:27,186 INFO L130 BoogieDeclarations]: Found specification of procedure fst_open [2022-07-20 02:24:27,186 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_open [2022-07-20 02:24:27,186 INFO L130 BoogieDeclarations]: Found specification of procedure hdlc_type_trans [2022-07-20 02:24:27,187 INFO L138 BoogieDeclarations]: Found implementation of procedure hdlc_type_trans [2022-07-20 02:24:27,187 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-20 02:24:27,187 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-20 02:24:27,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-20 02:24:27,188 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-20 02:24:27,188 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-20 02:24:27,188 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-20 02:24:27,189 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-20 02:24:27,189 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-20 02:24:27,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-20 02:24:27,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-20 02:24:27,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-20 02:24:27,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-20 02:24:27,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 02:24:27,190 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-07-20 02:24:27,190 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-07-20 02:24:27,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-20 02:24:27,190 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-20 02:24:27,190 INFO L130 BoogieDeclarations]: Found specification of procedure fst_issue_cmd [2022-07-20 02:24:27,190 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_issue_cmd [2022-07-20 02:24:27,191 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-07-20 02:24:27,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-07-20 02:24:27,191 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-20 02:24:27,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-20 02:24:27,191 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2022-07-20 02:24:27,191 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2022-07-20 02:24:27,192 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-20 02:24:27,192 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-20 02:24:27,192 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-20 02:24:27,192 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-20 02:24:27,192 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-07-20 02:24:27,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-07-20 02:24:27,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 02:24:27,192 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_1 [2022-07-20 02:24:27,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_1 [2022-07-20 02:24:27,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_2 [2022-07-20 02:24:27,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_2 [2022-07-20 02:24:27,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_card_lock_of_fst_card_info [2022-07-20 02:24:27,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_card_lock_of_fst_card_info [2022-07-20 02:24:27,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 02:24:27,194 INFO L130 BoogieDeclarations]: Found specification of procedure fst_cpureset [2022-07-20 02:24:27,194 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_cpureset [2022-07-20 02:24:27,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-20 02:24:27,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-20 02:24:27,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 02:24:27,195 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 02:24:27,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 02:24:27,195 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-20 02:24:27,195 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-20 02:24:27,195 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-20 02:24:27,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-20 02:24:27,195 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2022-07-20 02:24:27,195 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2022-07-20 02:24:27,196 INFO L130 BoogieDeclarations]: Found specification of procedure fst_q_work_item [2022-07-20 02:24:27,196 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_q_work_item [2022-07-20 02:24:27,196 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2022-07-20 02:24:27,196 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2022-07-20 02:24:27,196 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-20 02:24:27,196 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-20 02:24:27,196 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-20 02:24:27,197 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-20 02:24:27,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-20 02:24:27,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-20 02:24:27,197 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-20 02:24:27,197 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-20 02:24:27,198 INFO L130 BoogieDeclarations]: Found specification of procedure writeb [2022-07-20 02:24:27,198 INFO L138 BoogieDeclarations]: Found implementation of procedure writeb [2022-07-20 02:24:27,200 INFO L130 BoogieDeclarations]: Found specification of procedure writew [2022-07-20 02:24:27,200 INFO L138 BoogieDeclarations]: Found implementation of procedure writew [2022-07-20 02:24:27,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 02:24:27,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 02:24:27,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-20 02:24:27,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-20 02:24:27,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 02:24:27,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 02:24:27,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 02:24:27,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 02:24:27,205 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2022-07-20 02:24:27,205 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2022-07-20 02:24:27,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-20 02:24:27,206 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-20 02:24:27,206 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-20 02:24:27,206 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-20 02:24:27,206 INFO L130 BoogieDeclarations]: Found specification of procedure pci_alloc_consistent [2022-07-20 02:24:27,206 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_alloc_consistent [2022-07-20 02:24:27,206 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-20 02:24:27,206 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-20 02:24:27,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 02:24:27,206 INFO L130 BoogieDeclarations]: Found specification of procedure module_put [2022-07-20 02:24:27,207 INFO L138 BoogieDeclarations]: Found implementation of procedure module_put [2022-07-20 02:24:27,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 02:24:27,207 INFO L130 BoogieDeclarations]: Found specification of procedure ioremap [2022-07-20 02:24:27,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ioremap [2022-07-20 02:24:27,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 02:24:27,207 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-20 02:24:27,207 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-20 02:24:27,207 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-20 02:24:27,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-20 02:24:27,207 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2022-07-20 02:24:27,208 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2022-07-20 02:24:27,208 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-07-20 02:24:27,208 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-07-20 02:24:27,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-20 02:24:27,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-20 02:24:27,208 INFO L130 BoogieDeclarations]: Found specification of procedure outl [2022-07-20 02:24:27,208 INFO L138 BoogieDeclarations]: Found implementation of procedure outl [2022-07-20 02:24:27,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-20 02:24:27,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-20 02:24:27,208 INFO L130 BoogieDeclarations]: Found specification of procedure farsync_type_trans [2022-07-20 02:24:27,209 INFO L138 BoogieDeclarations]: Found implementation of procedure farsync_type_trans [2022-07-20 02:24:27,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-20 02:24:27,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-20 02:24:27,209 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-20 02:24:27,209 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-20 02:24:27,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_fst_work_q_lock [2022-07-20 02:24:27,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_fst_work_q_lock [2022-07-20 02:24:27,209 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-20 02:24:27,209 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-20 02:24:27,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 02:24:27,210 INFO L130 BoogieDeclarations]: Found specification of procedure fst_disable_intr [2022-07-20 02:24:27,210 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_disable_intr [2022-07-20 02:24:27,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 02:24:27,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 02:24:27,210 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-20 02:24:27,210 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-20 02:24:27,210 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-20 02:24:27,210 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-20 02:24:27,211 INFO L130 BoogieDeclarations]: Found specification of procedure do_bottom_half_tx [2022-07-20 02:24:27,211 INFO L138 BoogieDeclarations]: Found implementation of procedure do_bottom_half_tx [2022-07-20 02:24:27,211 INFO L130 BoogieDeclarations]: Found specification of procedure fst_process_rx_status [2022-07-20 02:24:27,211 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_process_rx_status [2022-07-20 02:24:27,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-20 02:24:27,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-20 02:24:27,211 INFO L130 BoogieDeclarations]: Found specification of procedure readw [2022-07-20 02:24:27,211 INFO L138 BoogieDeclarations]: Found implementation of procedure readw [2022-07-20 02:24:27,212 INFO L130 BoogieDeclarations]: Found specification of procedure hdlc_ioctl [2022-07-20 02:24:27,212 INFO L138 BoogieDeclarations]: Found implementation of procedure hdlc_ioctl [2022-07-20 02:24:27,212 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-07-20 02:24:27,212 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-07-20 02:24:27,212 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-20 02:24:27,212 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-20 02:24:27,212 INFO L130 BoogieDeclarations]: Found specification of procedure inl [2022-07-20 02:24:27,212 INFO L138 BoogieDeclarations]: Found implementation of procedure inl [2022-07-20 02:24:27,212 INFO L130 BoogieDeclarations]: Found specification of procedure fst_clear_intr [2022-07-20 02:24:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure fst_clear_intr [2022-07-20 02:24:27,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 02:24:27,213 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2022-07-20 02:24:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2022-07-20 02:24:27,213 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-07-20 02:24:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-07-20 02:24:27,213 INFO L130 BoogieDeclarations]: Found specification of procedure readb [2022-07-20 02:24:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure readb [2022-07-20 02:24:27,892 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 02:24:27,912 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 02:24:27,989 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 02:24:30,620 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2022-07-20 02:24:30,689 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 02:24:30,708 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 02:24:30,708 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 02:24:30,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:24:30 BoogieIcfgContainer [2022-07-20 02:24:30,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 02:24:30,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 02:24:30,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 02:24:30,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 02:24:30,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 02:24:24" (1/3) ... [2022-07-20 02:24:30,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463a7ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:24:30, skipping insertion in model container [2022-07-20 02:24:30,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:24:26" (2/3) ... [2022-07-20 02:24:30,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463a7ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:24:30, skipping insertion in model container [2022-07-20 02:24:30,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:24:30" (3/3) ... [2022-07-20 02:24:30,720 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-wan-farsync.cil.i [2022-07-20 02:24:30,731 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 02:24:30,732 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-20 02:24:30,811 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 02:24:30,816 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@7dfab700, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@71bbf5e7 [2022-07-20 02:24:30,816 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-20 02:24:30,824 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-20 02:24:30,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-20 02:24:30,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:24:30,846 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-20 02:24:30,846 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-20 02:24:30,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:24:30,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1565129519, now seen corresponding path program 1 times [2022-07-20 02:24:30,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:24:30,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142624826] [2022-07-20 02:24:30,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:24:30,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:24:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:31,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:24:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:31,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:31,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:24:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:31,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:31,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:24:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:31,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:31,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:24:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:31,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:31,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 02:24:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:31,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:31,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 02:24:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:31,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-20 02:24:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:31,294 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-20 02:24:31,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:24:31,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142624826] [2022-07-20 02:24:31,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142624826] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:24:31,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:24:31,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 02:24:31,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202721075] [2022-07-20 02:24:31,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:24:31,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 02:24:31,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:24:31,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 02:24:31,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 02:24:31,323 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-20 02:24:34,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:24:34,864 INFO L93 Difference]: Finished difference Result 5468 states and 7881 transitions. [2022-07-20 02:24:34,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 02:24:34,866 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-20 02:24:34,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:24:34,907 INFO L225 Difference]: With dead ends: 5468 [2022-07-20 02:24:34,907 INFO L226 Difference]: Without dead ends: 3610 [2022-07-20 02:24:34,921 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-20 02:24:34,924 INFO L413 NwaCegarLoop]: 2785 mSDtfsCounter, 3022 mSDsluCounter, 2484 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 1338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3464 SdHoareTripleChecker+Valid, 5269 SdHoareTripleChecker+Invalid, 3472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1338 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-20 02:24:34,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3464 Valid, 5269 Invalid, 3472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1338 Valid, 2134 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-20 02:24:34,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3610 states. [2022-07-20 02:24:35,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3610 to 3588. [2022-07-20 02:24:35,126 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-20 02:24:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 5049 transitions. [2022-07-20 02:24:35,147 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 5049 transitions. Word has length 83 [2022-07-20 02:24:35,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:24:35,148 INFO L495 AbstractCegarLoop]: Abstraction has 3588 states and 5049 transitions. [2022-07-20 02:24:35,148 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-20 02:24:35,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 5049 transitions. [2022-07-20 02:24:35,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-20 02:24:35,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:24:35,153 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-20 02:24:35,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 02:24:35,154 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-20 02:24:35,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:24:35,154 INFO L85 PathProgramCache]: Analyzing trace with hash -401151663, now seen corresponding path program 1 times [2022-07-20 02:24:35,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:24:35,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431865359] [2022-07-20 02:24:35,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:24:35,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:24:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:35,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:24:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:35,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:35,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:24:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:35,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:35,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:24:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:35,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:35,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:24:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:35,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:35,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 02:24:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:35,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:35,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 02:24:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:35,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 02:24:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:35,442 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-20 02:24:35,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:24:35,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431865359] [2022-07-20 02:24:35,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431865359] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:24:35,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:24:35,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 02:24:35,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522758479] [2022-07-20 02:24:35,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:24:35,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 02:24:35,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:24:35,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 02:24:35,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-20 02:24:35,448 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-20 02:24:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:24:41,533 INFO L93 Difference]: Finished difference Result 9274 states and 13077 transitions. [2022-07-20 02:24:41,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 02:24:41,534 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-20 02:24:41,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:24:41,581 INFO L225 Difference]: With dead ends: 9274 [2022-07-20 02:24:41,581 INFO L226 Difference]: Without dead ends: 5701 [2022-07-20 02:24:41,593 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-20 02:24:41,594 INFO L413 NwaCegarLoop]: 2998 mSDtfsCounter, 6388 mSDsluCounter, 3800 mSDsCounter, 0 mSdLazyCounter, 5760 mSolverCounterSat, 2497 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7250 SdHoareTripleChecker+Valid, 6798 SdHoareTripleChecker+Invalid, 8257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2497 IncrementalHoareTripleChecker+Valid, 5760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-20 02:24:41,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7250 Valid, 6798 Invalid, 8257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2497 Valid, 5760 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-07-20 02:24:41,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5701 states. [2022-07-20 02:24:41,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5701 to 5632. [2022-07-20 02:24:41,761 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-20 02:24:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5632 states to 5632 states and 7911 transitions. [2022-07-20 02:24:41,796 INFO L78 Accepts]: Start accepts. Automaton has 5632 states and 7911 transitions. Word has length 93 [2022-07-20 02:24:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:24:41,796 INFO L495 AbstractCegarLoop]: Abstraction has 5632 states and 7911 transitions. [2022-07-20 02:24:41,797 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-20 02:24:41,797 INFO L276 IsEmpty]: Start isEmpty. Operand 5632 states and 7911 transitions. [2022-07-20 02:24:41,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-20 02:24:41,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:24:41,800 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-20 02:24:41,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 02:24:41,800 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-20 02:24:41,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:24:41,801 INFO L85 PathProgramCache]: Analyzing trace with hash -480453640, now seen corresponding path program 1 times [2022-07-20 02:24:41,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:24:41,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088564492] [2022-07-20 02:24:41,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:24:41,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:24:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:41,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:24:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:41,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:41,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:24:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:41,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:41,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:24:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:41,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:41,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:24:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:41,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:41,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 02:24:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:41,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:41,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 02:24:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:41,983 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-20 02:24:41,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:24:41,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088564492] [2022-07-20 02:24:41,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088564492] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:24:41,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:24:41,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 02:24:41,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969338342] [2022-07-20 02:24:41,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:24:41,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 02:24:41,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:24:41,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 02:24:41,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 02:24:41,986 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-20 02:24:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:24:45,240 INFO L93 Difference]: Finished difference Result 15171 states and 21240 transitions. [2022-07-20 02:24:45,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 02:24:45,240 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-20 02:24:45,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:24:45,279 INFO L225 Difference]: With dead ends: 15171 [2022-07-20 02:24:45,279 INFO L226 Difference]: Without dead ends: 9554 [2022-07-20 02:24:45,295 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-20 02:24:45,298 INFO L413 NwaCegarLoop]: 2736 mSDtfsCounter, 2872 mSDsluCounter, 2469 mSDsCounter, 0 mSdLazyCounter, 2155 mSolverCounterSat, 1368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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, 3.0s IncrementalHoareTripleChecker+Time [2022-07-20 02:24:45,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3281 Valid, 5205 Invalid, 3523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1368 Valid, 2155 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-20 02:24:45,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9554 states. [2022-07-20 02:24:45,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9554 to 9494. [2022-07-20 02:24:45,559 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-20 02:24:45,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9494 states to 9494 states and 13211 transitions. [2022-07-20 02:24:45,585 INFO L78 Accepts]: Start accepts. Automaton has 9494 states and 13211 transitions. Word has length 91 [2022-07-20 02:24:45,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:24:45,586 INFO L495 AbstractCegarLoop]: Abstraction has 9494 states and 13211 transitions. [2022-07-20 02:24:45,587 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-20 02:24:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 9494 states and 13211 transitions. [2022-07-20 02:24:45,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-20 02:24:45,589 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:24:45,589 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-20 02:24:45,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 02:24:45,589 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-20 02:24:45,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:24:45,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1794242578, now seen corresponding path program 1 times [2022-07-20 02:24:45,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:24:45,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977327629] [2022-07-20 02:24:45,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:24:45,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:24:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:45,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:24:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:45,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:45,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:24:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:45,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:45,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:24:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:45,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:45,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:24:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:45,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:45,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 02:24:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:45,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:45,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 02:24:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:45,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-20 02:24:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:45,734 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-20 02:24:45,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:24:45,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977327629] [2022-07-20 02:24:45,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977327629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:24:45,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:24:45,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 02:24:45,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136577423] [2022-07-20 02:24:45,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:24:45,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 02:24:45,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:24:45,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 02:24:45,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 02:24:45,736 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-20 02:24:48,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:24:48,712 INFO L93 Difference]: Finished difference Result 23931 states and 33124 transitions. [2022-07-20 02:24:48,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 02:24:48,713 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-20 02:24:48,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:24:48,833 INFO L225 Difference]: With dead ends: 23931 [2022-07-20 02:24:48,834 INFO L226 Difference]: Without dead ends: 14452 [2022-07-20 02:24:48,855 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-20 02:24:48,857 INFO L413 NwaCegarLoop]: 2683 mSDtfsCounter, 2519 mSDsluCounter, 2492 mSDsCounter, 0 mSdLazyCounter, 2053 mSolverCounterSat, 1263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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, 2.6s IncrementalHoareTripleChecker+Time [2022-07-20 02:24:48,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2868 Valid, 5175 Invalid, 3316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1263 Valid, 2053 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-20 02:24:48,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14452 states. [2022-07-20 02:24:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14452 to 14372. [2022-07-20 02:24:49,245 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-20 02:24:49,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14372 states to 14372 states and 19784 transitions. [2022-07-20 02:24:49,289 INFO L78 Accepts]: Start accepts. Automaton has 14372 states and 19784 transitions. Word has length 95 [2022-07-20 02:24:49,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:24:49,289 INFO L495 AbstractCegarLoop]: Abstraction has 14372 states and 19784 transitions. [2022-07-20 02:24:49,289 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-20 02:24:49,290 INFO L276 IsEmpty]: Start isEmpty. Operand 14372 states and 19784 transitions. [2022-07-20 02:24:49,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-20 02:24:49,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:24:49,291 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-20 02:24:49,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 02:24:49,291 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-20 02:24:49,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:24:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash 606465146, now seen corresponding path program 1 times [2022-07-20 02:24:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:24:49,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791147664] [2022-07-20 02:24:49,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:24:49,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:24:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:49,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:24:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:49,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:49,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:24:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:49,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:49,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:24:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:49,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:49,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:24:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:49,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:49,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 02:24:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:49,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:49,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 02:24:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:49,384 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-20 02:24:49,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:24:49,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791147664] [2022-07-20 02:24:49,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791147664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:24:49,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:24:49,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 02:24:49,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706171071] [2022-07-20 02:24:49,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:24:49,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 02:24:49,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:24:49,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 02:24:49,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 02:24:49,386 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-20 02:24:52,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:24:52,943 INFO L93 Difference]: Finished difference Result 41500 states and 57060 transitions. [2022-07-20 02:24:52,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 02:24:52,945 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-20 02:24:52,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:24:53,034 INFO L225 Difference]: With dead ends: 41500 [2022-07-20 02:24:53,035 INFO L226 Difference]: Without dead ends: 27143 [2022-07-20 02:24:53,071 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-20 02:24:53,072 INFO L413 NwaCegarLoop]: 3016 mSDtfsCounter, 2918 mSDsluCounter, 2600 mSDsCounter, 0 mSdLazyCounter, 2179 mSolverCounterSat, 1331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.0s IncrementalHoareTripleChecker+Time [2022-07-20 02:24:53,074 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.0s Time] [2022-07-20 02:24:53,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27143 states. [2022-07-20 02:24:53,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27143 to 26997. [2022-07-20 02:24:53,738 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-20 02:24:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26997 states to 26997 states and 36927 transitions. [2022-07-20 02:24:53,820 INFO L78 Accepts]: Start accepts. Automaton has 26997 states and 36927 transitions. Word has length 92 [2022-07-20 02:24:53,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:24:53,821 INFO L495 AbstractCegarLoop]: Abstraction has 26997 states and 36927 transitions. [2022-07-20 02:24:53,821 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-20 02:24:53,821 INFO L276 IsEmpty]: Start isEmpty. Operand 26997 states and 36927 transitions. [2022-07-20 02:24:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-20 02:24:53,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:24:53,823 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-20 02:24:53,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 02:24:53,823 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-20 02:24:53,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:24:53,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1444009632, now seen corresponding path program 1 times [2022-07-20 02:24:53,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:24:53,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057055978] [2022-07-20 02:24:53,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:24:53,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:24:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:53,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:24:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:53,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:53,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:24:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:53,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:53,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:24:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:53,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:53,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:24:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:53,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:53,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 02:24:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:53,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:53,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 02:24:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:53,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 02:24:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:53,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 02:24:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:53,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 02:24:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:53,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-20 02:24:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:53,967 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-20 02:24:53,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:24:53,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057055978] [2022-07-20 02:24:53,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057055978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:24:53,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:24:53,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 02:24:53,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6645256] [2022-07-20 02:24:53,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:24:53,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 02:24:53,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:24:53,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 02:24:53,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 02:24:53,969 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-20 02:24:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:24:57,749 INFO L93 Difference]: Finished difference Result 75036 states and 102616 transitions. [2022-07-20 02:24:57,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 02:24:57,750 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-20 02:24:57,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:24:57,904 INFO L225 Difference]: With dead ends: 75036 [2022-07-20 02:24:57,905 INFO L226 Difference]: Without dead ends: 48054 [2022-07-20 02:24:57,973 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-20 02:24:57,974 INFO L413 NwaCegarLoop]: 3356 mSDtfsCounter, 2733 mSDsluCounter, 2860 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 1219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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, 2.7s IncrementalHoareTripleChecker+Time [2022-07-20 02:24:57,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3133 Valid, 6216 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1219 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-20 02:24:58,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48054 states. [2022-07-20 02:24:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48054 to 47812. [2022-07-20 02:24:59,190 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-20 02:24:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47812 states to 47812 states and 65273 transitions. [2022-07-20 02:24:59,489 INFO L78 Accepts]: Start accepts. Automaton has 47812 states and 65273 transitions. Word has length 108 [2022-07-20 02:24:59,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:24:59,489 INFO L495 AbstractCegarLoop]: Abstraction has 47812 states and 65273 transitions. [2022-07-20 02:24:59,489 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-20 02:24:59,490 INFO L276 IsEmpty]: Start isEmpty. Operand 47812 states and 65273 transitions. [2022-07-20 02:24:59,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-20 02:24:59,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:24:59,491 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-20 02:24:59,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 02:24:59,492 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-20 02:24:59,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:24:59,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1186239737, now seen corresponding path program 1 times [2022-07-20 02:24:59,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:24:59,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656318056] [2022-07-20 02:24:59,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:24:59,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:24:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:24:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:24:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:24:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:24:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 02:24:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 02:24:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 02:24:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 02:24:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 02:24:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-20 02:24:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-20 02:24:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-20 02:24:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:24:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-20 02:24:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-20 02:24:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 02:24:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:24:59,670 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-20 02:24:59,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:24:59,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656318056] [2022-07-20 02:24:59,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656318056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:24:59,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:24:59,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 02:24:59,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247293078] [2022-07-20 02:24:59,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:24:59,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 02:24:59,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:24:59,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 02:24:59,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 02:24:59,673 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-20 02:25:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:25:02,677 INFO L93 Difference]: Finished difference Result 95820 states and 130864 transitions. [2022-07-20 02:25:02,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 02:25:02,678 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-20 02:25:02,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:25:02,859 INFO L225 Difference]: With dead ends: 95820 [2022-07-20 02:25:02,859 INFO L226 Difference]: Without dead ends: 48100 [2022-07-20 02:25:02,958 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-20 02:25:02,958 INFO L413 NwaCegarLoop]: 2443 mSDtfsCounter, 551 mSDsluCounter, 2505 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.8s IncrementalHoareTripleChecker+Time [2022-07-20 02:25:02,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 4948 Invalid, 2150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-20 02:25:02,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48100 states. [2022-07-20 02:25:04,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48100 to 47860. [2022-07-20 02:25:04,159 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-20 02:25:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47860 states to 47860 states and 65321 transitions. [2022-07-20 02:25:04,324 INFO L78 Accepts]: Start accepts. Automaton has 47860 states and 65321 transitions. Word has length 150 [2022-07-20 02:25:04,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:25:04,325 INFO L495 AbstractCegarLoop]: Abstraction has 47860 states and 65321 transitions. [2022-07-20 02:25:04,325 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-20 02:25:04,326 INFO L276 IsEmpty]: Start isEmpty. Operand 47860 states and 65321 transitions. [2022-07-20 02:25:04,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-20 02:25:04,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:25:04,327 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-20 02:25:04,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 02:25:04,328 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-20 02:25:04,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:25:04,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1165995741, now seen corresponding path program 1 times [2022-07-20 02:25:04,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:25:04,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228874141] [2022-07-20 02:25:04,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:25:04,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:25:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:25:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:25:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:25:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:25:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 02:25:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 02:25:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 02:25:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-20 02:25:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 02:25:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-20 02:25:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 02:25:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 02:25:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 02:25:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 02:25:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 02:25:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:04,714 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-20 02:25:04,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:25:04,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228874141] [2022-07-20 02:25:04,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228874141] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 02:25:04,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225377298] [2022-07-20 02:25:04,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:25:04,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 02:25:04,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 02:25:04,717 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-20 02:25:04,720 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-20 02:25:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:05,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 1628 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 02:25:05,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 02:25:05,470 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-20 02:25:05,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 02:25:05,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225377298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:25:05,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 02:25:05,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-07-20 02:25:05,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513054374] [2022-07-20 02:25:05,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:25:05,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 02:25:05,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:25:05,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 02:25:05,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:25:05,472 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-20 02:25:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:25:06,837 INFO L93 Difference]: Finished difference Result 103050 states and 140745 transitions. [2022-07-20 02:25:06,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 02:25:06,838 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-20 02:25:06,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:25:07,171 INFO L225 Difference]: With dead ends: 103050 [2022-07-20 02:25:07,171 INFO L226 Difference]: Without dead ends: 55282 [2022-07-20 02:25:07,277 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-20 02:25:07,278 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-20 02:25:07,278 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-20 02:25:07,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55282 states. [2022-07-20 02:25:08,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55282 to 55259. [2022-07-20 02:25:08,816 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-20 02:25:08,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55259 states to 55259 states and 75399 transitions. [2022-07-20 02:25:08,999 INFO L78 Accepts]: Start accepts. Automaton has 55259 states and 75399 transitions. Word has length 152 [2022-07-20 02:25:08,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:25:09,000 INFO L495 AbstractCegarLoop]: Abstraction has 55259 states and 75399 transitions. [2022-07-20 02:25:09,000 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-20 02:25:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 55259 states and 75399 transitions. [2022-07-20 02:25:09,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-20 02:25:09,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:25:09,002 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-20 02:25:09,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 02:25:09,215 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-20 02:25:09,216 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-20 02:25:09,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:25:09,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1025447131, now seen corresponding path program 1 times [2022-07-20 02:25:09,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:25:09,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43454921] [2022-07-20 02:25:09,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:25:09,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:25:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:25:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:25:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:25:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:25:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 02:25:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 02:25:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 02:25:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-20 02:25:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-20 02:25:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-20 02:25:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 02:25:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-20 02:25:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 02:25:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 02:25:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 02:25:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,369 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-20 02:25:09,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:25:09,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43454921] [2022-07-20 02:25:09,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43454921] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 02:25:09,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438257974] [2022-07-20 02:25:09,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:25:09,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 02:25:09,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 02:25:09,371 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-20 02:25:09,395 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-20 02:25:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:09,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 1629 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 02:25:09,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 02:25:09,940 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-20 02:25:09,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 02:25:10,029 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-20 02:25:10,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438257974] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 02:25:10,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 02:25:10,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-07-20 02:25:10,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715633629] [2022-07-20 02:25:10,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 02:25:10,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 02:25:10,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:25:10,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 02:25:10,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-20 02:25:10,032 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-20 02:25:14,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:25:14,765 INFO L93 Difference]: Finished difference Result 110734 states and 151134 transitions. [2022-07-20 02:25:14,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 02:25:14,766 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-20 02:25:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:25:14,924 INFO L225 Difference]: With dead ends: 110734 [2022-07-20 02:25:14,924 INFO L226 Difference]: Without dead ends: 55567 [2022-07-20 02:25:15,025 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-20 02:25:15,026 INFO L413 NwaCegarLoop]: 2443 mSDtfsCounter, 556 mSDsluCounter, 6879 mSDsCounter, 0 mSdLazyCounter, 5088 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.1s IncrementalHoareTripleChecker+Time [2022-07-20 02:25:15,026 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.1s Time] [2022-07-20 02:25:15,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55567 states. [2022-07-20 02:25:16,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55567 to 55331. [2022-07-20 02:25:16,694 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-20 02:25:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55331 states to 55331 states and 75471 transitions. [2022-07-20 02:25:16,867 INFO L78 Accepts]: Start accepts. Automaton has 55331 states and 75471 transitions. Word has length 152 [2022-07-20 02:25:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:25:16,868 INFO L495 AbstractCegarLoop]: Abstraction has 55331 states and 75471 transitions. [2022-07-20 02:25:16,868 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-20 02:25:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 55331 states and 75471 transitions. [2022-07-20 02:25:16,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-20 02:25:16,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:25:16,870 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-20 02:25:16,892 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-20 02:25:17,078 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-20 02:25:17,078 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-20 02:25:17,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:25:17,079 INFO L85 PathProgramCache]: Analyzing trace with hash 686822265, now seen corresponding path program 2 times [2022-07-20 02:25:17,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:25:17,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820313162] [2022-07-20 02:25:17,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:25:17,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:25:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:25:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:25:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:25:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:25:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 02:25:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 02:25:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 02:25:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 02:25:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-20 02:25:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 02:25:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-20 02:25:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 02:25:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 02:25:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 02:25:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 02:25:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:17,314 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-20 02:25:17,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:25:17,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820313162] [2022-07-20 02:25:17,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820313162] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:25:17,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:25:17,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 02:25:17,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698814763] [2022-07-20 02:25:17,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:25:17,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 02:25:17,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:25:17,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 02:25:17,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:25:17,316 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-20 02:25:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:25:20,944 INFO L93 Difference]: Finished difference Result 55573 states and 75807 transitions. [2022-07-20 02:25:20,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 02:25:20,945 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-20 02:25:20,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:25:21,146 INFO L225 Difference]: With dead ends: 55573 [2022-07-20 02:25:21,146 INFO L226 Difference]: Without dead ends: 55571 [2022-07-20 02:25:21,176 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-20 02:25:21,177 INFO L413 NwaCegarLoop]: 2442 mSDtfsCounter, 2520 mSDsluCounter, 3973 mSDsCounter, 0 mSdLazyCounter, 2801 mSolverCounterSat, 921 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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, 2.5s IncrementalHoareTripleChecker+Time [2022-07-20 02:25:21,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2819 Valid, 6415 Invalid, 3722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [921 Valid, 2801 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-20 02:25:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55571 states. [2022-07-20 02:25:22,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55571 to 55335. [2022-07-20 02:25:22,744 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-20 02:25:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55335 states to 55335 states and 75474 transitions. [2022-07-20 02:25:22,901 INFO L78 Accepts]: Start accepts. Automaton has 55335 states and 75474 transitions. Word has length 158 [2022-07-20 02:25:22,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:25:22,902 INFO L495 AbstractCegarLoop]: Abstraction has 55335 states and 75474 transitions. [2022-07-20 02:25:22,902 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-20 02:25:22,902 INFO L276 IsEmpty]: Start isEmpty. Operand 55335 states and 75474 transitions. [2022-07-20 02:25:22,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-20 02:25:22,904 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:25:22,904 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-20 02:25:22,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 02:25:22,905 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-20 02:25:22,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:25:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash -296417503, now seen corresponding path program 1 times [2022-07-20 02:25:22,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:25:22,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187371728] [2022-07-20 02:25:22,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:25:22,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:25:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:25:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:25:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:25:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:25:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 02:25:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 02:25:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 02:25:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 02:25:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-20 02:25:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 02:25:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-20 02:25:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 02:25:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:23,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 02:25:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 02:25:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 02:25:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 02:25:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:23,163 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-20 02:25:23,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:25:23,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187371728] [2022-07-20 02:25:23,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187371728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:25:23,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:25:23,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 02:25:23,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499142879] [2022-07-20 02:25:23,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:25:23,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 02:25:23,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:25:23,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 02:25:23,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:25:23,166 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-20 02:25:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:25:26,853 INFO L93 Difference]: Finished difference Result 55577 states and 75810 transitions. [2022-07-20 02:25:26,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 02:25:26,853 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-20 02:25:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:25:27,000 INFO L225 Difference]: With dead ends: 55577 [2022-07-20 02:25:27,001 INFO L226 Difference]: Without dead ends: 55575 [2022-07-20 02:25:27,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-20 02:25:27,025 INFO L413 NwaCegarLoop]: 2445 mSDtfsCounter, 2512 mSDsluCounter, 3973 mSDsCounter, 0 mSdLazyCounter, 2801 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 2.4s IncrementalHoareTripleChecker+Time [2022-07-20 02:25:27,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2811 Valid, 6418 Invalid, 3721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 2801 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-20 02:25:27,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55575 states. [2022-07-20 02:25:28,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55575 to 55339. [2022-07-20 02:25:28,572 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-20 02:25:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55339 states to 55339 states and 75477 transitions. [2022-07-20 02:25:28,760 INFO L78 Accepts]: Start accepts. Automaton has 55339 states and 75477 transitions. Word has length 163 [2022-07-20 02:25:28,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:25:28,761 INFO L495 AbstractCegarLoop]: Abstraction has 55339 states and 75477 transitions. [2022-07-20 02:25:28,761 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-20 02:25:28,761 INFO L276 IsEmpty]: Start isEmpty. Operand 55339 states and 75477 transitions. [2022-07-20 02:25:28,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-20 02:25:28,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:25:28,763 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-20 02:25:28,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 02:25:28,764 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-20 02:25:28,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:25:28,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1344588743, now seen corresponding path program 1 times [2022-07-20 02:25:28,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:25:28,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909405985] [2022-07-20 02:25:28,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:25:28,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:25:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:25:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:25:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:25:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:25:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 02:25:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 02:25:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 02:25:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 02:25:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-20 02:25:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 02:25:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-20 02:25:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 02:25:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 02:25:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 02:25:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 02:25:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 02:25:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 02:25:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:28,949 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-20 02:25:28,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:25:28,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909405985] [2022-07-20 02:25:28,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909405985] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:25:28,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:25:28,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 02:25:28,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877592779] [2022-07-20 02:25:28,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:25:28,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 02:25:28,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:25:28,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 02:25:28,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:25:28,950 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-20 02:25:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:25:32,792 INFO L93 Difference]: Finished difference Result 55581 states and 75813 transitions. [2022-07-20 02:25:32,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 02:25:32,793 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-20 02:25:32,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:25:32,971 INFO L225 Difference]: With dead ends: 55581 [2022-07-20 02:25:32,971 INFO L226 Difference]: Without dead ends: 55579 [2022-07-20 02:25:33,000 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-20 02:25:33,000 INFO L413 NwaCegarLoop]: 2445 mSDtfsCounter, 2512 mSDsluCounter, 3973 mSDsCounter, 0 mSdLazyCounter, 2801 mSolverCounterSat, 919 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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, 2.4s IncrementalHoareTripleChecker+Time [2022-07-20 02:25:33,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2811 Valid, 6418 Invalid, 3720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [919 Valid, 2801 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-20 02:25:33,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55579 states. [2022-07-20 02:25:34,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55579 to 55343. [2022-07-20 02:25:34,546 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-20 02:25:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55343 states to 55343 states and 75480 transitions. [2022-07-20 02:25:34,713 INFO L78 Accepts]: Start accepts. Automaton has 55343 states and 75480 transitions. Word has length 168 [2022-07-20 02:25:34,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:25:34,714 INFO L495 AbstractCegarLoop]: Abstraction has 55343 states and 75480 transitions. [2022-07-20 02:25:34,714 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-20 02:25:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 55343 states and 75480 transitions. [2022-07-20 02:25:34,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-20 02:25:34,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:25:34,717 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-20 02:25:34,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 02:25:34,717 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-20 02:25:34,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:25:34,718 INFO L85 PathProgramCache]: Analyzing trace with hash -449147423, now seen corresponding path program 1 times [2022-07-20 02:25:34,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:25:34,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534839021] [2022-07-20 02:25:34,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:25:34,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:25:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:25:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:25:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:25:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:25:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 02:25:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 02:25:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 02:25:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 02:25:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-20 02:25:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 02:25:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-20 02:25:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 02:25:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 02:25:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 02:25:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 02:25:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 02:25:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 02:25:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-20 02:25:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:34,917 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-20 02:25:34,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:25:34,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534839021] [2022-07-20 02:25:34,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534839021] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:25:34,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:25:34,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 02:25:34,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653461755] [2022-07-20 02:25:34,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:25:34,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 02:25:34,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:25:34,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 02:25:34,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:25:34,920 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-20 02:25:39,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:25:39,001 INFO L93 Difference]: Finished difference Result 56667 states and 76617 transitions. [2022-07-20 02:25:39,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 02:25:39,002 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-20 02:25:39,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:25:39,178 INFO L225 Difference]: With dead ends: 56667 [2022-07-20 02:25:39,178 INFO L226 Difference]: Without dead ends: 56665 [2022-07-20 02:25:39,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-20 02:25:39,209 INFO L413 NwaCegarLoop]: 2458 mSDtfsCounter, 2468 mSDsluCounter, 3985 mSDsCounter, 0 mSdLazyCounter, 2942 mSolverCounterSat, 850 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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, 2.7s IncrementalHoareTripleChecker+Time [2022-07-20 02:25:39,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2779 Valid, 6443 Invalid, 3792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [850 Valid, 2942 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-20 02:25:39,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56665 states. [2022-07-20 02:25:40,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56665 to 56427. [2022-07-20 02:25:40,917 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-20 02:25:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56427 states to 56427 states and 76283 transitions. [2022-07-20 02:25:41,119 INFO L78 Accepts]: Start accepts. Automaton has 56427 states and 76283 transitions. Word has length 173 [2022-07-20 02:25:41,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:25:41,119 INFO L495 AbstractCegarLoop]: Abstraction has 56427 states and 76283 transitions. [2022-07-20 02:25:41,120 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-20 02:25:41,120 INFO L276 IsEmpty]: Start isEmpty. Operand 56427 states and 76283 transitions. [2022-07-20 02:25:41,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-20 02:25:41,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:25:41,123 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-20 02:25:41,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 02:25:41,124 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-20 02:25:41,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:25:41,124 INFO L85 PathProgramCache]: Analyzing trace with hash -724162530, now seen corresponding path program 1 times [2022-07-20 02:25:41,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:25:41,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450563103] [2022-07-20 02:25:41,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:25:41,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:25:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:25:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:25:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:25:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:25:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 02:25:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 02:25:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 02:25:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 02:25:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-20 02:25:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 02:25:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-20 02:25:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 02:25:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 02:25:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 02:25:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 02:25:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 02:25:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 02:25:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 02:25:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 02:25:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-20 02:25:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-20 02:25:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:41,307 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-20 02:25:41,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:25:41,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450563103] [2022-07-20 02:25:41,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450563103] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:25:41,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:25:41,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 02:25:41,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138211644] [2022-07-20 02:25:41,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:25:41,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 02:25:41,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:25:41,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 02:25:41,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 02:25:41,309 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-20 02:25:47,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:25:47,408 INFO L93 Difference]: Finished difference Result 112625 states and 152225 transitions. [2022-07-20 02:25:47,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 02:25:47,408 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-20 02:25:47,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:25:47,621 INFO L225 Difference]: With dead ends: 112625 [2022-07-20 02:25:47,621 INFO L226 Difference]: Without dead ends: 66234 [2022-07-20 02:25:47,721 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-20 02:25:47,722 INFO L413 NwaCegarLoop]: 2818 mSDtfsCounter, 3539 mSDsluCounter, 3439 mSDsCounter, 0 mSdLazyCounter, 2903 mSolverCounterSat, 2480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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, 3.8s IncrementalHoareTripleChecker+Time [2022-07-20 02:25:47,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3795 Valid, 6257 Invalid, 5383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2480 Valid, 2903 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-20 02:25:47,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66234 states. [2022-07-20 02:25:49,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66234 to 65950. [2022-07-20 02:25:49,857 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-20 02:25:50,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65950 states to 65950 states and 88703 transitions. [2022-07-20 02:25:50,261 INFO L78 Accepts]: Start accepts. Automaton has 65950 states and 88703 transitions. Word has length 189 [2022-07-20 02:25:50,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:25:50,261 INFO L495 AbstractCegarLoop]: Abstraction has 65950 states and 88703 transitions. [2022-07-20 02:25:50,261 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-20 02:25:50,261 INFO L276 IsEmpty]: Start isEmpty. Operand 65950 states and 88703 transitions. [2022-07-20 02:25:50,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-20 02:25:50,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:25:50,265 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-20 02:25:50,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 02:25:50,265 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-20 02:25:50,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:25:50,265 INFO L85 PathProgramCache]: Analyzing trace with hash -683487780, now seen corresponding path program 1 times [2022-07-20 02:25:50,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:25:50,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688194233] [2022-07-20 02:25:50,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:25:50,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:25:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:25:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:25:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:25:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:25:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 02:25:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 02:25:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 02:25:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 02:25:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-20 02:25:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 02:25:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-20 02:25:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 02:25:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 02:25:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 02:25:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 02:25:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 02:25:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 02:25:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 02:25:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 02:25:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-20 02:25:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-20 02:25:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:50,414 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-20 02:25:50,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:25:50,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688194233] [2022-07-20 02:25:50,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688194233] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:25:50,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:25:50,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 02:25:50,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345977818] [2022-07-20 02:25:50,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:25:50,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 02:25:50,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:25:50,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 02:25:50,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 02:25:50,416 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-20 02:25:56,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:25:56,548 INFO L93 Difference]: Finished difference Result 131536 states and 177042 transitions. [2022-07-20 02:25:56,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 02:25:56,549 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-20 02:25:56,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:25:56,752 INFO L225 Difference]: With dead ends: 131536 [2022-07-20 02:25:56,753 INFO L226 Difference]: Without dead ends: 65678 [2022-07-20 02:25:56,881 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-20 02:25:56,882 INFO L413 NwaCegarLoop]: 4329 mSDtfsCounter, 2702 mSDsluCounter, 4796 mSDsCounter, 0 mSdLazyCounter, 3069 mSolverCounterSat, 1863 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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, 3.8s IncrementalHoareTripleChecker+Time [2022-07-20 02:25:56,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2957 Valid, 9125 Invalid, 4932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1863 Valid, 3069 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-20 02:25:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65678 states. [2022-07-20 02:25:58,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65678 to 65359. [2022-07-20 02:25:59,018 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-20 02:25:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65359 states to 65359 states and 87941 transitions. [2022-07-20 02:25:59,200 INFO L78 Accepts]: Start accepts. Automaton has 65359 states and 87941 transitions. Word has length 189 [2022-07-20 02:25:59,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:25:59,201 INFO L495 AbstractCegarLoop]: Abstraction has 65359 states and 87941 transitions. [2022-07-20 02:25:59,201 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-20 02:25:59,201 INFO L276 IsEmpty]: Start isEmpty. Operand 65359 states and 87941 transitions. [2022-07-20 02:25:59,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-20 02:25:59,203 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:25:59,203 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-20 02:25:59,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 02:25:59,204 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-20 02:25:59,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:25:59,204 INFO L85 PathProgramCache]: Analyzing trace with hash 827725049, now seen corresponding path program 1 times [2022-07-20 02:25:59,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:25:59,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534816513] [2022-07-20 02:25:59,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:25:59,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:25:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:25:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:25:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:25:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:25:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 02:25:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 02:25:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 02:25:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 02:25:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-20 02:25:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 02:25:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-20 02:25:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 02:25:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:25:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 02:25:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 02:25:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 02:25:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 02:25:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 02:25:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-20 02:25:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-20 02:25:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:25:59,405 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-20 02:25:59,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:25:59,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534816513] [2022-07-20 02:25:59,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534816513] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:25:59,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:25:59,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 02:25:59,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266272669] [2022-07-20 02:25:59,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:25:59,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 02:25:59,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:25:59,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 02:25:59,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:25:59,407 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-20 02:26:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:26:03,614 INFO L93 Difference]: Finished difference Result 65863 states and 88494 transitions. [2022-07-20 02:26:03,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 02:26:03,615 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-20 02:26:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:26:03,798 INFO L225 Difference]: With dead ends: 65863 [2022-07-20 02:26:03,798 INFO L226 Difference]: Without dead ends: 65861 [2022-07-20 02:26:03,821 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-20 02:26:03,822 INFO L413 NwaCegarLoop]: 2445 mSDtfsCounter, 2511 mSDsluCounter, 3979 mSDsCounter, 0 mSdLazyCounter, 2827 mSolverCounterSat, 910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 02:26:03,822 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.5s Time] [2022-07-20 02:26:03,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65861 states. [2022-07-20 02:26:05,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65861 to 65579. [2022-07-20 02:26:05,916 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-20 02:26:06,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65579 states to 65579 states and 88106 transitions. [2022-07-20 02:26:06,141 INFO L78 Accepts]: Start accepts. Automaton has 65579 states and 88106 transitions. Word has length 178 [2022-07-20 02:26:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 02:26:06,142 INFO L495 AbstractCegarLoop]: Abstraction has 65579 states and 88106 transitions. [2022-07-20 02:26:06,142 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-20 02:26:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 65579 states and 88106 transitions. [2022-07-20 02:26:06,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-20 02:26:06,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 02:26:06,146 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-20 02:26:06,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 02:26:06,146 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-20 02:26:06,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 02:26:06,146 INFO L85 PathProgramCache]: Analyzing trace with hash -983018335, now seen corresponding path program 1 times [2022-07-20 02:26:06,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 02:26:06,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602373724] [2022-07-20 02:26:06,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 02:26:06,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 02:26:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 02:26:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:26:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 02:26:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:26:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-20 02:26:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:26:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-20 02:26:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:26:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 02:26:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:26:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-20 02:26:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 02:26:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 02:26:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-20 02:26:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-20 02:26:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-20 02:26:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 02:26:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 02:26:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 02:26:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 02:26:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 02:26:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 02:26:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 02:26:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-20 02:26:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-20 02:26:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-20 02:26:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 02:26:06,361 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-20 02:26:06,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 02:26:06,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602373724] [2022-07-20 02:26:06,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602373724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 02:26:06,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 02:26:06,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 02:26:06,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890189481] [2022-07-20 02:26:06,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 02:26:06,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 02:26:06,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 02:26:06,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 02:26:06,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 02:26:06,364 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) [2022-07-20 02:26:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 02:26:10,744 INFO L93 Difference]: Finished difference Result 65865 states and 88496 transitions. [2022-07-20 02:26:10,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 02:26:10,745 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, (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) Word has length 183 [2022-07-20 02:26:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 02:26:10,911 INFO L225 Difference]: With dead ends: 65865 [2022-07-20 02:26:10,911 INFO L226 Difference]: Without dead ends: 65863 [2022-07-20 02:26:10,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-20 02:26:10,937 INFO L413 NwaCegarLoop]: 2445 mSDtfsCounter, 2512 mSDsluCounter, 3973 mSDsCounter, 0 mSdLazyCounter, 2801 mSolverCounterSat, 916 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2811 SdHoareTripleChecker+Valid, 6418 SdHoareTripleChecker+Invalid, 3717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 916 IncrementalHoareTripleChecker+Valid, 2801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-20 02:26:10,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2811 Valid, 6418 Invalid, 3717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [916 Valid, 2801 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-20 02:26:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65863 states.