./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-irda-via-ircc.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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-irda-via-ircc.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 67e7778ced54570c612880d3f2f5d48e6e2d3dc55afd632628e45d31cdc74c58 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 13:54:36,347 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 13:54:36,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 13:54:36,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 13:54:36,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 13:54:36,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 13:54:36,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 13:54:36,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 13:54:36,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 13:54:36,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 13:54:36,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 13:54:36,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 13:54:36,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 13:54:36,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 13:54:36,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 13:54:36,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 13:54:36,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 13:54:36,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 13:54:36,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 13:54:36,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 13:54:36,436 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 13:54:36,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 13:54:36,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 13:54:36,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 13:54:36,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 13:54:36,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 13:54:36,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 13:54:36,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 13:54:36,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 13:54:36,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 13:54:36,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 13:54:36,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 13:54:36,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 13:54:36,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 13:54:36,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 13:54:36,455 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 13:54:36,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 13:54:36,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 13:54:36,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 13:54:36,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 13:54:36,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 13:54:36,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 13:54:36,465 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 13:54:36,505 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 13:54:36,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 13:54:36,506 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 13:54:36,507 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 13:54:36,507 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 13:54:36,508 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 13:54:36,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 13:54:36,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 13:54:36,509 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 13:54:36,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 13:54:36,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 13:54:36,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 13:54:36,509 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 13:54:36,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 13:54:36,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 13:54:36,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 13:54:36,510 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 13:54:36,510 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 13:54:36,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 13:54:36,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 13:54:36,511 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 13:54:36,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 13:54:36,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 13:54:36,512 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 13:54:36,512 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 13:54:36,512 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 13:54:36,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 13:54:36,513 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 13:54:36,513 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 13:54:36,513 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 13:54:36,514 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 -> 67e7778ced54570c612880d3f2f5d48e6e2d3dc55afd632628e45d31cdc74c58 [2022-07-21 13:54:36,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 13:54:36,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 13:54:36,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 13:54:36,831 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 13:54:36,832 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 13:54:36,833 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-irda-via-ircc.cil.i [2022-07-21 13:54:36,905 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/486582c79/9d3ec3d100b04ea39949e783a1e1c9cf/FLAG5c199e9a5 [2022-07-21 13:54:37,814 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 13:54:37,815 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-irda-via-ircc.cil.i [2022-07-21 13:54:37,882 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/486582c79/9d3ec3d100b04ea39949e783a1e1c9cf/FLAG5c199e9a5 [2022-07-21 13:54:38,328 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/486582c79/9d3ec3d100b04ea39949e783a1e1c9cf [2022-07-21 13:54:38,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 13:54:38,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 13:54:38,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 13:54:38,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 13:54:38,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 13:54:38,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:54:38" (1/1) ... [2022-07-21 13:54:38,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba9ac9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:54:38, skipping insertion in model container [2022-07-21 13:54:38,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:54:38" (1/1) ... [2022-07-21 13:54:38,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 13:54:38,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 13:54:42,211 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-irda-via-ircc.cil.i[329615,329628] [2022-07-21 13:54:42,220 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-irda-via-ircc.cil.i[329784,329797] [2022-07-21 13:54:42,221 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-irda-via-ircc.cil.i[329951,329964] [2022-07-21 13:54:42,222 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-irda-via-ircc.cil.i[330119,330132] [2022-07-21 13:54:42,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 13:54:42,278 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 13:54:42,646 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-irda-via-ircc.cil.i[329615,329628] [2022-07-21 13:54:42,646 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-irda-via-ircc.cil.i[329784,329797] [2022-07-21 13:54:42,647 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-irda-via-ircc.cil.i[329951,329964] [2022-07-21 13:54:42,648 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-irda-via-ircc.cil.i[330119,330132] [2022-07-21 13:54:42,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 13:54:42,822 INFO L208 MainTranslator]: Completed translation [2022-07-21 13:54:42,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:54:42 WrapperNode [2022-07-21 13:54:42,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 13:54:42,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 13:54:42,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 13:54:42,825 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 13:54:42,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:54:42" (1/1) ... [2022-07-21 13:54:42,999 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:54:42" (1/1) ... [2022-07-21 13:54:43,142 INFO L137 Inliner]: procedures = 395, calls = 2038, calls flagged for inlining = 159, calls inlined = 138, statements flattened = 4403 [2022-07-21 13:54:43,143 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 13:54:43,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 13:54:43,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 13:54:43,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 13:54:43,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:54:42" (1/1) ... [2022-07-21 13:54:43,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:54:42" (1/1) ... [2022-07-21 13:54:43,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:54:42" (1/1) ... [2022-07-21 13:54:43,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:54:42" (1/1) ... [2022-07-21 13:54:43,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:54:42" (1/1) ... [2022-07-21 13:54:43,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:54:42" (1/1) ... [2022-07-21 13:54:43,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:54:42" (1/1) ... [2022-07-21 13:54:43,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 13:54:43,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 13:54:43,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 13:54:43,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 13:54:43,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:54:42" (1/1) ... [2022-07-21 13:54:43,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 13:54:43,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 13:54:43,417 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-21 13:54:43,441 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-21 13:54:43,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-21 13:54:43,465 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-21 13:54:43,465 INFO L130 BoogieDeclarations]: Found specification of procedure RxCurCount [2022-07-21 13:54:43,466 INFO L138 BoogieDeclarations]: Found implementation of procedure RxCurCount [2022-07-21 13:54:43,466 INFO L130 BoogieDeclarations]: Found specification of procedure irda_setup_dma [2022-07-21 13:54:43,466 INFO L138 BoogieDeclarations]: Found implementation of procedure irda_setup_dma [2022-07-21 13:54:43,466 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-07-21 13:54:43,466 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-07-21 13:54:43,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 13:54:43,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 13:54:43,467 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_73 [2022-07-21 13:54:43,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_73 [2022-07-21 13:54:43,467 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-21 13:54:43,467 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-21 13:54:43,495 INFO L130 BoogieDeclarations]: Found specification of procedure CheckRegBit [2022-07-21 13:54:43,495 INFO L138 BoogieDeclarations]: Found implementation of procedure CheckRegBit [2022-07-21 13:54:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 13:54:43,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 13:54:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure via_remove_one [2022-07-21 13:54:43,496 INFO L138 BoogieDeclarations]: Found implementation of procedure via_remove_one [2022-07-21 13:54:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_change_speed [2022-07-21 13:54:43,496 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_change_speed [2022-07-21 13:54:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure dma_zalloc_coherent [2022-07-21 13:54:43,497 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_zalloc_coherent [2022-07-21 13:54:43,497 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-21 13:54:43,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-21 13:54:43,497 INFO L130 BoogieDeclarations]: Found specification of procedure SetPulseWidth [2022-07-21 13:54:43,497 INFO L138 BoogieDeclarations]: Found implementation of procedure SetPulseWidth [2022-07-21 13:54:43,497 INFO L130 BoogieDeclarations]: Found specification of procedure Tdelay [2022-07-21 13:54:43,497 INFO L138 BoogieDeclarations]: Found implementation of procedure Tdelay [2022-07-21 13:54:43,498 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2022-07-21 13:54:43,498 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2022-07-21 13:54:43,498 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-21 13:54:43,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-21 13:54:43,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 13:54:43,499 INFO L130 BoogieDeclarations]: Found specification of procedure ClkTx [2022-07-21 13:54:43,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ClkTx [2022-07-21 13:54:43,499 INFO L130 BoogieDeclarations]: Found specification of procedure WriteLPCReg [2022-07-21 13:54:43,499 INFO L138 BoogieDeclarations]: Found implementation of procedure WriteLPCReg [2022-07-21 13:54:43,499 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-21 13:54:43,500 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-21 13:54:43,500 INFO L130 BoogieDeclarations]: Found specification of procedure CommonInit [2022-07-21 13:54:43,500 INFO L138 BoogieDeclarations]: Found implementation of procedure CommonInit [2022-07-21 13:54:43,500 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-21 13:54:43,500 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-21 13:54:43,500 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_change_dongle_speed [2022-07-21 13:54:43,501 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_change_dongle_speed [2022-07-21 13:54:43,501 INFO L130 BoogieDeclarations]: Found specification of procedure ReadLPCReg [2022-07-21 13:54:43,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadLPCReg [2022-07-21 13:54:43,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 13:54:43,502 INFO L130 BoogieDeclarations]: Found specification of procedure free_dma [2022-07-21 13:54:43,502 INFO L138 BoogieDeclarations]: Found implementation of procedure free_dma [2022-07-21 13:54:43,503 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_lock_of_via_ircc_cb [2022-07-21 13:54:43,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_lock_of_via_ircc_cb [2022-07-21 13:54:43,504 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_dma_receive [2022-07-21 13:54:43,504 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_dma_receive [2022-07-21 13:54:43,504 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-21 13:54:43,504 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-21 13:54:43,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 13:54:43,505 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-21 13:54:43,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-21 13:54:43,505 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_net_close [2022-07-21 13:54:43,505 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_net_close [2022-07-21 13:54:43,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 13:54:43,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-21 13:54:43,506 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-21 13:54:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure CkRxRecv [2022-07-21 13:54:43,507 INFO L138 BoogieDeclarations]: Found implementation of procedure CkRxRecv [2022-07-21 13:54:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-07-21 13:54:43,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-07-21 13:54:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-21 13:54:43,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-21 13:54:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure irda_get_next_speed [2022-07-21 13:54:43,508 INFO L138 BoogieDeclarations]: Found implementation of procedure irda_get_next_speed [2022-07-21 13:54:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure ReadReg [2022-07-21 13:54:43,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadReg [2022-07-21 13:54:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_open [2022-07-21 13:54:43,508 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_open [2022-07-21 13:54:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-07-21 13:54:43,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2022-07-21 13:54:43,509 INFO L130 BoogieDeclarations]: Found specification of procedure WriteRegBit [2022-07-21 13:54:43,509 INFO L138 BoogieDeclarations]: Found implementation of procedure WriteRegBit [2022-07-21 13:54:43,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 13:54:43,509 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_0 [2022-07-21 13:54:43,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_0 [2022-07-21 13:54:43,510 INFO L130 BoogieDeclarations]: Found specification of procedure Wr_Indx [2022-07-21 13:54:43,510 INFO L138 BoogieDeclarations]: Found implementation of procedure Wr_Indx [2022-07-21 13:54:43,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 13:54:43,510 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 13:54:43,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 13:54:43,511 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-21 13:54:43,511 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-21 13:54:43,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 13:54:43,511 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 13:54:43,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 13:54:43,512 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-21 13:54:43,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-21 13:54:43,512 INFO L130 BoogieDeclarations]: Found specification of procedure WriteReg [2022-07-21 13:54:43,512 INFO L138 BoogieDeclarations]: Found implementation of procedure WriteReg [2022-07-21 13:54:43,512 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2022-07-21 13:54:43,512 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2022-07-21 13:54:43,513 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-21 13:54:43,513 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-21 13:54:43,513 INFO L130 BoogieDeclarations]: Found specification of procedure SetBaudRate [2022-07-21 13:54:43,513 INFO L138 BoogieDeclarations]: Found implementation of procedure SetBaudRate [2022-07-21 13:54:43,513 INFO L130 BoogieDeclarations]: Found specification of procedure Wr_Byte [2022-07-21 13:54:43,514 INFO L138 BoogieDeclarations]: Found implementation of procedure Wr_Byte [2022-07-21 13:54:43,514 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-21 13:54:43,514 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-21 13:54:43,514 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-21 13:54:43,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-21 13:54:43,515 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_net_open [2022-07-21 13:54:43,515 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_net_open [2022-07-21 13:54:43,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 13:54:43,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 13:54:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure ResetChip [2022-07-21 13:54:43,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ResetChip [2022-07-21 13:54:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 13:54:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 13:54:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 13:54:43,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 13:54:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure irda_device_txqueue_empty [2022-07-21 13:54:43,524 INFO L138 BoogieDeclarations]: Found implementation of procedure irda_device_txqueue_empty [2022-07-21 13:54:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 13:54:43,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 13:54:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure pci_read_config_byte [2022-07-21 13:54:43,526 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_read_config_byte [2022-07-21 13:54:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure Sdelay [2022-07-21 13:54:43,526 INFO L138 BoogieDeclarations]: Found implementation of procedure Sdelay [2022-07-21 13:54:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure SetSIR [2022-07-21 13:54:43,526 INFO L138 BoogieDeclarations]: Found implementation of procedure SetSIR [2022-07-21 13:54:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-21 13:54:43,526 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-21 13:54:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure SetMaxRxPacketSize [2022-07-21 13:54:43,527 INFO L138 BoogieDeclarations]: Found implementation of procedure SetMaxRxPacketSize [2022-07-21 13:54:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure GetRecvByte [2022-07-21 13:54:43,527 INFO L138 BoogieDeclarations]: Found implementation of procedure GetRecvByte [2022-07-21 13:54:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-21 13:54:43,527 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-21 13:54:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 13:54:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 13:54:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure hwreset [2022-07-21 13:54:43,528 INFO L138 BoogieDeclarations]: Found implementation of procedure hwreset [2022-07-21 13:54:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 13:54:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-21 13:54:43,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-21 13:54:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_byte [2022-07-21 13:54:43,528 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_byte [2022-07-21 13:54:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-21 13:54:43,529 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-21 13:54:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-07-21 13:54:43,529 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-07-21 13:54:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-21 13:54:43,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-21 13:54:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-21 13:54:43,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-21 13:54:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_dma_xmit [2022-07-21 13:54:43,530 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_dma_xmit [2022-07-21 13:54:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-07-21 13:54:43,530 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-07-21 13:54:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure dma_free_attrs [2022-07-21 13:54:43,530 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_free_attrs [2022-07-21 13:54:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-21 13:54:43,530 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-21 13:54:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-21 13:54:43,531 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-21 13:54:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-21 13:54:43,531 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-21 13:54:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 13:54:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure net_ratelimit [2022-07-21 13:54:43,531 INFO L138 BoogieDeclarations]: Found implementation of procedure net_ratelimit [2022-07-21 13:54:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure SetSendByte [2022-07-21 13:54:43,531 INFO L138 BoogieDeclarations]: Found implementation of procedure SetSendByte [2022-07-21 13:54:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-07-21 13:54:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-07-21 13:54:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 13:54:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 13:54:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_lock_of_via_ircc_cb [2022-07-21 13:54:43,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_lock_of_via_ircc_cb [2022-07-21 13:54:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure SetSendPreambleCount [2022-07-21 13:54:43,533 INFO L138 BoogieDeclarations]: Found implementation of procedure SetSendPreambleCount [2022-07-21 13:54:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure InitCard [2022-07-21 13:54:43,533 INFO L138 BoogieDeclarations]: Found implementation of procedure InitCard [2022-07-21 13:54:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-21 13:54:43,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-21 13:54:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure SetTimer [2022-07-21 13:54:43,535 INFO L138 BoogieDeclarations]: Found implementation of procedure SetTimer [2022-07-21 13:54:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure ActClk [2022-07-21 13:54:43,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ActClk [2022-07-21 13:54:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure request_dma [2022-07-21 13:54:43,535 INFO L138 BoogieDeclarations]: Found implementation of procedure request_dma [2022-07-21 13:54:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-07-21 13:54:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-07-21 13:54:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 13:54:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2022-07-21 13:54:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2022-07-21 13:54:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-07-21 13:54:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-07-21 13:54:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure skb_copy_to_linear_data [2022-07-21 13:54:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_copy_to_linear_data [2022-07-21 13:54:44,204 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 13:54:44,212 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 13:54:44,536 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 13:54:47,534 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2022-07-21 13:54:48,346 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 13:54:48,373 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 13:54:48,373 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 13:54:48,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:54:48 BoogieIcfgContainer [2022-07-21 13:54:48,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 13:54:48,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 13:54:48,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 13:54:48,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 13:54:48,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:54:38" (1/3) ... [2022-07-21 13:54:48,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667e6631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:54:48, skipping insertion in model container [2022-07-21 13:54:48,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:54:42" (2/3) ... [2022-07-21 13:54:48,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667e6631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:54:48, skipping insertion in model container [2022-07-21 13:54:48,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:54:48" (3/3) ... [2022-07-21 13:54:48,387 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-spinlock_drivers-net-irda-via-ircc.cil.i [2022-07-21 13:54:48,402 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 13:54:48,402 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-07-21 13:54:48,522 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 13:54:48,528 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@74774700, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2070ec30 [2022-07-21 13:54:48,528 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-21 13:54:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 1999 states, 1251 states have (on average 1.3069544364508394) internal successors, (1635), 1277 states have internal predecessors, (1635), 654 states have call successors, (654), 92 states have call predecessors, (654), 91 states have return successors, (650), 638 states have call predecessors, (650), 650 states have call successors, (650) [2022-07-21 13:54:48,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-21 13:54:48,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:54:48,561 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] [2022-07-21 13:54:48,561 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-21 13:54:48,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:54:48,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1658643117, now seen corresponding path program 1 times [2022-07-21 13:54:48,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:54:48,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294889087] [2022-07-21 13:54:48,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:54:48,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:54:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:49,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:54:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:49,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:54:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:49,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:54:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:49,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:54:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:49,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:54:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:49,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:54:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:49,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:54:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:49,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:54:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:49,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:54:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:49,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:54:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:49,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:54:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:49,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 13:54:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:49,270 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-21 13:54:49,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:54:49,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294889087] [2022-07-21 13:54:49,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294889087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:54:49,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:54:49,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 13:54:49,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651165691] [2022-07-21 13:54:49,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:54:49,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 13:54:49,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:54:49,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 13:54:49,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 13:54:49,324 INFO L87 Difference]: Start difference. First operand has 1999 states, 1251 states have (on average 1.3069544364508394) internal successors, (1635), 1277 states have internal predecessors, (1635), 654 states have call successors, (654), 92 states have call predecessors, (654), 91 states have return successors, (650), 638 states have call predecessors, (650), 650 states have call successors, (650) Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-21 13:54:56,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:54:56,858 INFO L93 Difference]: Finished difference Result 5917 states and 8905 transitions. [2022-07-21 13:54:56,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 13:54:56,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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 79 [2022-07-21 13:54:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:54:56,921 INFO L225 Difference]: With dead ends: 5917 [2022-07-21 13:54:56,922 INFO L226 Difference]: Without dead ends: 3924 [2022-07-21 13:54:56,946 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-21 13:54:56,949 INFO L413 NwaCegarLoop]: 2796 mSDtfsCounter, 3435 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 3081 mSolverCounterSat, 2339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4055 SdHoareTripleChecker+Valid, 4647 SdHoareTripleChecker+Invalid, 5420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2339 IncrementalHoareTripleChecker+Valid, 3081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-21 13:54:56,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4055 Valid, 4647 Invalid, 5420 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2339 Valid, 3081 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-07-21 13:54:56,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3924 states. [2022-07-21 13:54:57,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3924 to 3892. [2022-07-21 13:54:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3892 states, 2442 states have (on average 1.2665847665847665) internal successors, (3093), 2492 states have internal predecessors, (3093), 1268 states have call successors, (1268), 180 states have call predecessors, (1268), 179 states have return successors, (1265), 1241 states have call predecessors, (1265), 1265 states have call successors, (1265) [2022-07-21 13:54:57,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5626 transitions. [2022-07-21 13:54:57,349 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5626 transitions. Word has length 79 [2022-07-21 13:54:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:54:57,350 INFO L495 AbstractCegarLoop]: Abstraction has 3892 states and 5626 transitions. [2022-07-21 13:54:57,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-21 13:54:57,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5626 transitions. [2022-07-21 13:54:57,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-21 13:54:57,362 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:54:57,362 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-21 13:54:57,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 13:54:57,363 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-21 13:54:57,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:54:57,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2063132158, now seen corresponding path program 1 times [2022-07-21 13:54:57,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:54:57,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341956758] [2022-07-21 13:54:57,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:54:57,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:54:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:57,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:54:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:57,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:54:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:57,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:54:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:57,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:54:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:57,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:54:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:57,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:54:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:57,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:54:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:57,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:54:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:57,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:54:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:57,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:54:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:57,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:54:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:57,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 13:54:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:54:57,646 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-21 13:54:57,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:54:57,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341956758] [2022-07-21 13:54:57,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341956758] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:54:57,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:54:57,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 13:54:57,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301379747] [2022-07-21 13:54:57,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:54:57,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 13:54:57,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:54:57,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 13:54:57,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 13:54:57,652 INFO L87 Difference]: Start difference. First operand 3892 states and 5626 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (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-21 13:54:59,934 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 13:55:04,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:55:04,304 INFO L93 Difference]: Finished difference Result 10862 states and 15735 transitions. [2022-07-21 13:55:04,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 13:55:04,304 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-21 13:55:04,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:55:04,359 INFO L225 Difference]: With dead ends: 10862 [2022-07-21 13:55:04,360 INFO L226 Difference]: Without dead ends: 6985 [2022-07-21 13:55:04,387 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-21 13:55:04,388 INFO L413 NwaCegarLoop]: 2782 mSDtfsCounter, 2896 mSDsluCounter, 1883 mSDsCounter, 0 mSdLazyCounter, 2962 mSolverCounterSat, 2130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3440 SdHoareTripleChecker+Valid, 4665 SdHoareTripleChecker+Invalid, 5092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2130 IncrementalHoareTripleChecker+Valid, 2962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-21 13:55:04,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3440 Valid, 4665 Invalid, 5092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2130 Valid, 2962 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-07-21 13:55:04,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6985 states. [2022-07-21 13:55:04,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6985 to 6916. [2022-07-21 13:55:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6916 states, 4317 states have (on average 1.2596710678712069) internal successors, (5438), 4417 states have internal predecessors, (5438), 2267 states have call successors, (2267), 330 states have call predecessors, (2267), 329 states have return successors, (2302), 2208 states have call predecessors, (2302), 2264 states have call successors, (2302) [2022-07-21 13:55:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6916 states to 6916 states and 10007 transitions. [2022-07-21 13:55:04,781 INFO L78 Accepts]: Start accepts. Automaton has 6916 states and 10007 transitions. Word has length 83 [2022-07-21 13:55:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:55:04,783 INFO L495 AbstractCegarLoop]: Abstraction has 6916 states and 10007 transitions. [2022-07-21 13:55:04,783 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-21 13:55:04,784 INFO L276 IsEmpty]: Start isEmpty. Operand 6916 states and 10007 transitions. [2022-07-21 13:55:04,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-21 13:55:04,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:55:04,786 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] [2022-07-21 13:55:04,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 13:55:04,786 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-21 13:55:04,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:55:04,787 INFO L85 PathProgramCache]: Analyzing trace with hash -687884744, now seen corresponding path program 1 times [2022-07-21 13:55:04,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:55:04,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917367439] [2022-07-21 13:55:04,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:55:04,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:55:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:04,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:55:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:04,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:04,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:55:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:04,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:04,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:55:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:04,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:04,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:55:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:04,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:04,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:55:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:04,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:05,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:55:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:05,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 13:55:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:05,017 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-21 13:55:05,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:55:05,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917367439] [2022-07-21 13:55:05,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917367439] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:55:05,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:55:05,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 13:55:05,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374403172] [2022-07-21 13:55:05,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:55:05,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 13:55:05,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:55:05,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 13:55:05,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 13:55:05,020 INFO L87 Difference]: Start difference. First operand 6916 states and 10007 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (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-21 13:55:11,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:55:11,928 INFO L93 Difference]: Finished difference Result 19838 states and 28768 transitions. [2022-07-21 13:55:11,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 13:55:11,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (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 87 [2022-07-21 13:55:11,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:55:12,029 INFO L225 Difference]: With dead ends: 19838 [2022-07-21 13:55:12,030 INFO L226 Difference]: Without dead ends: 12937 [2022-07-21 13:55:12,076 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-21 13:55:12,081 INFO L413 NwaCegarLoop]: 2764 mSDtfsCounter, 3269 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 3040 mSolverCounterSat, 2339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3842 SdHoareTripleChecker+Valid, 4624 SdHoareTripleChecker+Invalid, 5379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2339 IncrementalHoareTripleChecker+Valid, 3040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-21 13:55:12,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3842 Valid, 4624 Invalid, 5379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2339 Valid, 3040 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-07-21 13:55:12,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12937 states. [2022-07-21 13:55:12,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12937 to 12832. [2022-07-21 13:55:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12832 states, 8011 states have (on average 1.258519535638497) internal successors, (10082), 8213 states have internal predecessors, (10082), 4205 states have call successors, (4205), 622 states have call predecessors, (4205), 613 states have return successors, (4294), 4068 states have call predecessors, (4294), 4202 states have call successors, (4294) [2022-07-21 13:55:12,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12832 states to 12832 states and 18581 transitions. [2022-07-21 13:55:12,933 INFO L78 Accepts]: Start accepts. Automaton has 12832 states and 18581 transitions. Word has length 87 [2022-07-21 13:55:12,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:55:12,934 INFO L495 AbstractCegarLoop]: Abstraction has 12832 states and 18581 transitions. [2022-07-21 13:55:12,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (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-21 13:55:12,935 INFO L276 IsEmpty]: Start isEmpty. Operand 12832 states and 18581 transitions. [2022-07-21 13:55:12,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-21 13:55:12,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:55:12,943 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 13:55:12,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 13:55:12,944 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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-21 13:55:12,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:55:12,944 INFO L85 PathProgramCache]: Analyzing trace with hash 435513709, now seen corresponding path program 1 times [2022-07-21 13:55:12,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:55:12,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748296231] [2022-07-21 13:55:12,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:55:12,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:55:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:55:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:55:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:55:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:55:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:55:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:55:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 13:55:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 13:55:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 13:55:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 13:55:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 13:55:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 13:55:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 13:55:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-07-21 13:55:13,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:55:13,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748296231] [2022-07-21 13:55:13,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748296231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:55:13,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:55:13,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 13:55:13,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24897052] [2022-07-21 13:55:13,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:55:13,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 13:55:13,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:55:13,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 13:55:13,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 13:55:13,249 INFO L87 Difference]: Start difference. First operand 12832 states and 18581 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-21 13:55:18,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:55:18,834 INFO L93 Difference]: Finished difference Result 25813 states and 37407 transitions. [2022-07-21 13:55:18,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 13:55:18,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2022-07-21 13:55:18,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:55:18,970 INFO L225 Difference]: With dead ends: 25813 [2022-07-21 13:55:18,970 INFO L226 Difference]: Without dead ends: 19268 [2022-07-21 13:55:19,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 13:55:19,030 INFO L413 NwaCegarLoop]: 4916 mSDtfsCounter, 2630 mSDsluCounter, 2566 mSDsCounter, 0 mSdLazyCounter, 3114 mSolverCounterSat, 1755 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3245 SdHoareTripleChecker+Valid, 7482 SdHoareTripleChecker+Invalid, 4869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1755 IncrementalHoareTripleChecker+Valid, 3114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-21 13:55:19,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3245 Valid, 7482 Invalid, 4869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1755 Valid, 3114 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-21 13:55:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19268 states. [2022-07-21 13:55:19,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19268 to 19148. [2022-07-21 13:55:20,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19148 states, 11951 states have (on average 1.2585557693916827) internal successors, (15041), 12249 states have internal predecessors, (15041), 6275 states have call successors, (6275), 932 states have call predecessors, (6275), 919 states have return successors, (6410), 6074 states have call predecessors, (6410), 6272 states have call successors, (6410) [2022-07-21 13:55:20,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19148 states to 19148 states and 27726 transitions. [2022-07-21 13:55:20,276 INFO L78 Accepts]: Start accepts. Automaton has 19148 states and 27726 transitions. Word has length 134 [2022-07-21 13:55:20,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:55:20,277 INFO L495 AbstractCegarLoop]: Abstraction has 19148 states and 27726 transitions. [2022-07-21 13:55:20,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-21 13:55:20,277 INFO L276 IsEmpty]: Start isEmpty. Operand 19148 states and 27726 transitions. [2022-07-21 13:55:20,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-21 13:55:20,282 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:55:20,282 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 13:55:20,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 13:55:20,282 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-21 13:55:20,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:55:20,283 INFO L85 PathProgramCache]: Analyzing trace with hash 858215535, now seen corresponding path program 1 times [2022-07-21 13:55:20,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:55:20,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948770108] [2022-07-21 13:55:20,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:55:20,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:55:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:55:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:55:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:55:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:55:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:55:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:55:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 13:55:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 13:55:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 13:55:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 13:55:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 13:55:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 13:55:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 13:55:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-07-21 13:55:20,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:55:20,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948770108] [2022-07-21 13:55:20,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948770108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:55:20,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:55:20,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 13:55:20,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896553977] [2022-07-21 13:55:20,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:55:20,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 13:55:20,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:55:20,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 13:55:20,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 13:55:20,612 INFO L87 Difference]: Start difference. First operand 19148 states and 27726 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 13:55:26,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:55:26,453 INFO L93 Difference]: Finished difference Result 19250 states and 27922 transitions. [2022-07-21 13:55:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 13:55:26,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2022-07-21 13:55:26,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:55:26,567 INFO L225 Difference]: With dead ends: 19250 [2022-07-21 13:55:26,567 INFO L226 Difference]: Without dead ends: 19248 [2022-07-21 13:55:26,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 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-21 13:55:26,591 INFO L413 NwaCegarLoop]: 2498 mSDtfsCounter, 2664 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1753 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2918 SdHoareTripleChecker+Valid, 5473 SdHoareTripleChecker+Invalid, 5976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1753 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-21 13:55:26,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2918 Valid, 5473 Invalid, 5976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1753 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-07-21 13:55:26,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19248 states. [2022-07-21 13:55:27,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19248 to 19152. [2022-07-21 13:55:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19152 states, 11954 states have (on average 1.258490881713234) internal successors, (15044), 12252 states have internal predecessors, (15044), 6275 states have call successors, (6275), 933 states have call predecessors, (6275), 920 states have return successors, (6410), 6074 states have call predecessors, (6410), 6272 states have call successors, (6410) [2022-07-21 13:55:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19152 states to 19152 states and 27729 transitions. [2022-07-21 13:55:27,643 INFO L78 Accepts]: Start accepts. Automaton has 19152 states and 27729 transitions. Word has length 134 [2022-07-21 13:55:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:55:27,645 INFO L495 AbstractCegarLoop]: Abstraction has 19152 states and 27729 transitions. [2022-07-21 13:55:27,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 13:55:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 19152 states and 27729 transitions. [2022-07-21 13:55:27,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-21 13:55:27,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:55:27,649 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 13:55:27,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 13:55:27,650 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-21 13:55:27,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:55:27,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1459207571, now seen corresponding path program 1 times [2022-07-21 13:55:27,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:55:27,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996838437] [2022-07-21 13:55:27,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:55:27,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:55:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:27,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:55:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:27,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:27,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:55:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:27,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:27,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:55:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:27,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:27,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:55:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:27,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:27,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:55:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:27,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:27,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:55:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:27,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 13:55:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:27,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 13:55:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:27,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 13:55:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:27,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 13:55:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:27,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:27,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 13:55:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:27,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 13:55:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:27,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 13:55:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:28,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 13:55:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:28,015 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-07-21 13:55:28,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:55:28,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996838437] [2022-07-21 13:55:28,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996838437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:55:28,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:55:28,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 13:55:28,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946061079] [2022-07-21 13:55:28,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:55:28,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 13:55:28,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:55:28,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 13:55:28,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 13:55:28,019 INFO L87 Difference]: Start difference. First operand 19152 states and 27729 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 13:55:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:55:33,799 INFO L93 Difference]: Finished difference Result 19254 states and 27925 transitions. [2022-07-21 13:55:33,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 13:55:33,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2022-07-21 13:55:33,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:55:33,986 INFO L225 Difference]: With dead ends: 19254 [2022-07-21 13:55:33,986 INFO L226 Difference]: Without dead ends: 19252 [2022-07-21 13:55:33,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 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-21 13:55:33,999 INFO L413 NwaCegarLoop]: 2501 mSDtfsCounter, 2656 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1752 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2910 SdHoareTripleChecker+Valid, 5476 SdHoareTripleChecker+Invalid, 5975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1752 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-21 13:55:33,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2910 Valid, 5476 Invalid, 5975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1752 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-21 13:55:34,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19252 states. [2022-07-21 13:55:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19252 to 19156. [2022-07-21 13:55:34,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19156 states, 11957 states have (on average 1.2584260265952998) internal successors, (15047), 12255 states have internal predecessors, (15047), 6275 states have call successors, (6275), 934 states have call predecessors, (6275), 921 states have return successors, (6410), 6074 states have call predecessors, (6410), 6272 states have call successors, (6410) [2022-07-21 13:55:34,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19156 states to 19156 states and 27732 transitions. [2022-07-21 13:55:34,985 INFO L78 Accepts]: Start accepts. Automaton has 19156 states and 27732 transitions. Word has length 139 [2022-07-21 13:55:34,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:55:34,986 INFO L495 AbstractCegarLoop]: Abstraction has 19156 states and 27732 transitions. [2022-07-21 13:55:34,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 13:55:34,986 INFO L276 IsEmpty]: Start isEmpty. Operand 19156 states and 27732 transitions. [2022-07-21 13:55:34,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-21 13:55:34,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:55:34,990 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 13:55:34,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 13:55:34,991 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-21 13:55:34,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:55:34,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1275034351, now seen corresponding path program 1 times [2022-07-21 13:55:34,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:55:34,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597941459] [2022-07-21 13:55:34,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:55:34,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:55:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:55:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:55:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:55:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:55:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:55:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:55:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 13:55:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 13:55:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 13:55:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 13:55:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 13:55:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 13:55:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 13:55:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 13:55:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 13:55:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:35,249 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2022-07-21 13:55:35,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:55:35,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597941459] [2022-07-21 13:55:35,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597941459] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:55:35,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:55:35,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 13:55:35,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980524948] [2022-07-21 13:55:35,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:55:35,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 13:55:35,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:55:35,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 13:55:35,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 13:55:35,252 INFO L87 Difference]: Start difference. First operand 19156 states and 27732 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 13:55:40,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:55:40,968 INFO L93 Difference]: Finished difference Result 19258 states and 27928 transitions. [2022-07-21 13:55:40,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 13:55:40,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2022-07-21 13:55:40,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:55:41,083 INFO L225 Difference]: With dead ends: 19258 [2022-07-21 13:55:41,084 INFO L226 Difference]: Without dead ends: 19256 [2022-07-21 13:55:41,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 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-21 13:55:41,106 INFO L413 NwaCegarLoop]: 2502 mSDtfsCounter, 2656 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1751 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2909 SdHoareTripleChecker+Valid, 5480 SdHoareTripleChecker+Invalid, 5974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1751 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-21 13:55:41,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2909 Valid, 5480 Invalid, 5974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1751 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-21 13:55:41,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19256 states. [2022-07-21 13:55:42,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19256 to 19160. [2022-07-21 13:55:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19160 states, 11960 states have (on average 1.258361204013378) internal successors, (15050), 12258 states have internal predecessors, (15050), 6275 states have call successors, (6275), 935 states have call predecessors, (6275), 922 states have return successors, (6410), 6074 states have call predecessors, (6410), 6272 states have call successors, (6410) [2022-07-21 13:55:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19160 states to 19160 states and 27735 transitions. [2022-07-21 13:55:42,182 INFO L78 Accepts]: Start accepts. Automaton has 19160 states and 27735 transitions. Word has length 144 [2022-07-21 13:55:42,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:55:42,183 INFO L495 AbstractCegarLoop]: Abstraction has 19160 states and 27735 transitions. [2022-07-21 13:55:42,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 13:55:42,183 INFO L276 IsEmpty]: Start isEmpty. Operand 19160 states and 27735 transitions. [2022-07-21 13:55:42,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-21 13:55:42,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:55:42,189 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 13:55:42,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 13:55:42,189 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-21 13:55:42,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:55:42,190 INFO L85 PathProgramCache]: Analyzing trace with hash 167533421, now seen corresponding path program 1 times [2022-07-21 13:55:42,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:55:42,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860734273] [2022-07-21 13:55:42,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:55:42,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:55:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:55:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:55:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:55:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:55:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:55:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:55:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 13:55:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 13:55:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 13:55:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 13:55:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 13:55:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 13:55:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 13:55:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 13:55:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 13:55:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 13:55:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-07-21 13:55:42,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:55:42,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860734273] [2022-07-21 13:55:42,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860734273] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:55:42,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:55:42,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 13:55:42,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071748034] [2022-07-21 13:55:42,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:55:42,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 13:55:42,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:55:42,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 13:55:42,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 13:55:42,419 INFO L87 Difference]: Start difference. First operand 19160 states and 27735 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (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-21 13:55:48,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:55:48,205 INFO L93 Difference]: Finished difference Result 19262 states and 27931 transitions. [2022-07-21 13:55:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 13:55:48,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (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 149 [2022-07-21 13:55:48,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:55:48,338 INFO L225 Difference]: With dead ends: 19262 [2022-07-21 13:55:48,339 INFO L226 Difference]: Without dead ends: 19260 [2022-07-21 13:55:48,363 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-21 13:55:48,364 INFO L413 NwaCegarLoop]: 2501 mSDtfsCounter, 2656 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1750 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2910 SdHoareTripleChecker+Valid, 5476 SdHoareTripleChecker+Invalid, 5973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1750 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-21 13:55:48,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2910 Valid, 5476 Invalid, 5973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1750 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-07-21 13:55:48,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19260 states. [2022-07-21 13:55:49,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19260 to 19164. [2022-07-21 13:55:49,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19164 states, 11963 states have (on average 1.2582964139429909) internal successors, (15053), 12261 states have internal predecessors, (15053), 6275 states have call successors, (6275), 936 states have call predecessors, (6275), 923 states have return successors, (6410), 6074 states have call predecessors, (6410), 6272 states have call successors, (6410) [2022-07-21 13:55:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19164 states to 19164 states and 27738 transitions. [2022-07-21 13:55:49,415 INFO L78 Accepts]: Start accepts. Automaton has 19164 states and 27738 transitions. Word has length 149 [2022-07-21 13:55:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:55:49,416 INFO L495 AbstractCegarLoop]: Abstraction has 19164 states and 27738 transitions. [2022-07-21 13:55:49,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (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-21 13:55:49,417 INFO L276 IsEmpty]: Start isEmpty. Operand 19164 states and 27738 transitions. [2022-07-21 13:55:49,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-21 13:55:49,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:55:49,422 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 13:55:49,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 13:55:49,422 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-21 13:55:49,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:55:49,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1104465553, now seen corresponding path program 1 times [2022-07-21 13:55:49,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:55:49,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109243621] [2022-07-21 13:55:49,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:55:49,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:55:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:55:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:55:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:55:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:55:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:55:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:55:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 13:55:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 13:55:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 13:55:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 13:55:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 13:55:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 13:55:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 13:55:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 13:55:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 13:55:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 13:55:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 13:55:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-07-21 13:55:49,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:55:49,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109243621] [2022-07-21 13:55:49,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109243621] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:55:49,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:55:49,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 13:55:49,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928677399] [2022-07-21 13:55:49,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:55:49,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 13:55:49,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:55:49,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 13:55:49,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 13:55:49,725 INFO L87 Difference]: Start difference. First operand 19164 states and 27738 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (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-21 13:55:56,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:55:56,084 INFO L93 Difference]: Finished difference Result 19266 states and 27934 transitions. [2022-07-21 13:55:56,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 13:55:56,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (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 154 [2022-07-21 13:55:56,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:55:56,179 INFO L225 Difference]: With dead ends: 19266 [2022-07-21 13:55:56,179 INFO L226 Difference]: Without dead ends: 19264 [2022-07-21 13:55:56,195 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-21 13:55:56,195 INFO L413 NwaCegarLoop]: 2502 mSDtfsCounter, 2656 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2909 SdHoareTripleChecker+Valid, 5480 SdHoareTripleChecker+Invalid, 5972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1749 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-21 13:55:56,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2909 Valid, 5480 Invalid, 5972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1749 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-21 13:55:56,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19264 states. [2022-07-21 13:55:57,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19264 to 19168. [2022-07-21 13:55:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19168 states, 11966 states have (on average 1.2582316563596858) internal successors, (15056), 12264 states have internal predecessors, (15056), 6275 states have call successors, (6275), 937 states have call predecessors, (6275), 924 states have return successors, (6410), 6074 states have call predecessors, (6410), 6272 states have call successors, (6410) [2022-07-21 13:55:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19168 states to 19168 states and 27741 transitions. [2022-07-21 13:55:57,213 INFO L78 Accepts]: Start accepts. Automaton has 19168 states and 27741 transitions. Word has length 154 [2022-07-21 13:55:57,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:55:57,214 INFO L495 AbstractCegarLoop]: Abstraction has 19168 states and 27741 transitions. [2022-07-21 13:55:57,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (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-21 13:55:57,215 INFO L276 IsEmpty]: Start isEmpty. Operand 19168 states and 27741 transitions. [2022-07-21 13:55:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-21 13:55:57,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:55:57,221 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 13:55:57,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 13:55:57,221 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-21 13:55:57,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:55:57,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1487346579, now seen corresponding path program 1 times [2022-07-21 13:55:57,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:55:57,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420483581] [2022-07-21 13:55:57,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:55:57,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:55:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:55:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:55:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:55:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:55:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:55:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:55:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 13:55:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 13:55:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 13:55:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 13:55:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:55:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 13:55:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 13:55:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 13:55:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 13:55:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 13:55:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 13:55:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 13:55:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 13:55:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:55:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-07-21 13:55:57,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:55:57,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420483581] [2022-07-21 13:55:57,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420483581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:55:57,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:55:57,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 13:55:57,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716585328] [2022-07-21 13:55:57,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:55:57,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 13:55:57,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:55:57,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 13:55:57,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 13:55:57,478 INFO L87 Difference]: Start difference. First operand 19168 states and 27741 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (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-21 13:55:59,458 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 13:56:04,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:56:04,349 INFO L93 Difference]: Finished difference Result 19270 states and 27937 transitions. [2022-07-21 13:56:04,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 13:56:04,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (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 159 [2022-07-21 13:56:04,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:56:04,459 INFO L225 Difference]: With dead ends: 19270 [2022-07-21 13:56:04,460 INFO L226 Difference]: Without dead ends: 19268 [2022-07-21 13:56:04,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-21 13:56:04,480 INFO L413 NwaCegarLoop]: 2502 mSDtfsCounter, 2656 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1748 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2909 SdHoareTripleChecker+Valid, 5480 SdHoareTripleChecker+Invalid, 5971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1748 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-21 13:56:04,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2909 Valid, 5480 Invalid, 5971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1748 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-21 13:56:04,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19268 states. [2022-07-21 13:56:05,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19268 to 19172. [2022-07-21 13:56:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19172 states, 11969 states have (on average 1.2581669312390342) internal successors, (15059), 12267 states have internal predecessors, (15059), 6275 states have call successors, (6275), 938 states have call predecessors, (6275), 925 states have return successors, (6410), 6074 states have call predecessors, (6410), 6272 states have call successors, (6410) [2022-07-21 13:56:05,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19172 states to 19172 states and 27744 transitions. [2022-07-21 13:56:05,401 INFO L78 Accepts]: Start accepts. Automaton has 19172 states and 27744 transitions. Word has length 159 [2022-07-21 13:56:05,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:56:05,402 INFO L495 AbstractCegarLoop]: Abstraction has 19172 states and 27744 transitions. [2022-07-21 13:56:05,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (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-21 13:56:05,402 INFO L276 IsEmpty]: Start isEmpty. Operand 19172 states and 27744 transitions. [2022-07-21 13:56:05,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-21 13:56:05,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:56:05,409 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 13:56:05,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 13:56:05,410 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-21 13:56:05,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:56:05,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1153065481, now seen corresponding path program 1 times [2022-07-21 13:56:05,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:56:05,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995942292] [2022-07-21 13:56:05,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:56:05,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:56:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:56:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:56:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:56:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:56:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:56:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:56:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 13:56:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 13:56:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:56:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 13:56:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 13:56:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 13:56:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 13:56:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 13:56:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 13:56:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-21 13:56:05,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:56:05,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995942292] [2022-07-21 13:56:05,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995942292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:56:05,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:56:05,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 13:56:05,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047214291] [2022-07-21 13:56:05,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:56:05,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 13:56:05,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:56:05,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 13:56:05,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 13:56:05,678 INFO L87 Difference]: Start difference. First operand 19172 states and 27744 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-21 13:56:08,916 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 13:56:17,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:56:17,282 INFO L93 Difference]: Finished difference Result 39170 states and 56799 transitions. [2022-07-21 13:56:17,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 13:56:17,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 156 [2022-07-21 13:56:17,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:56:17,383 INFO L225 Difference]: With dead ends: 39170 [2022-07-21 13:56:17,384 INFO L226 Difference]: Without dead ends: 20013 [2022-07-21 13:56:17,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-21 13:56:17,460 INFO L413 NwaCegarLoop]: 3020 mSDtfsCounter, 3375 mSDsluCounter, 1885 mSDsCounter, 0 mSdLazyCounter, 3402 mSolverCounterSat, 3462 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3874 SdHoareTripleChecker+Valid, 4905 SdHoareTripleChecker+Invalid, 6865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3462 IncrementalHoareTripleChecker+Valid, 3402 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-07-21 13:56:17,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3874 Valid, 4905 Invalid, 6865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3462 Valid, 3402 Invalid, 1 Unknown, 0 Unchecked, 10.5s Time] [2022-07-21 13:56:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20013 states. [2022-07-21 13:56:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20013 to 19687. [2022-07-21 13:56:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19687 states, 12243 states have (on average 1.2579433145470882) internal successors, (15401), 12523 states have internal predecessors, (15401), 6460 states have call successors, (6460), 982 states have call predecessors, (6460), 981 states have return successors, (6565), 6289 states have call predecessors, (6565), 6457 states have call successors, (6565) [2022-07-21 13:56:18,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19687 states to 19687 states and 28426 transitions. [2022-07-21 13:56:18,515 INFO L78 Accepts]: Start accepts. Automaton has 19687 states and 28426 transitions. Word has length 156 [2022-07-21 13:56:18,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:56:18,516 INFO L495 AbstractCegarLoop]: Abstraction has 19687 states and 28426 transitions. [2022-07-21 13:56:18,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-21 13:56:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 19687 states and 28426 transitions. [2022-07-21 13:56:18,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-07-21 13:56:18,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:56:18,519 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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] [2022-07-21 13:56:18,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 13:56:18,520 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-21 13:56:18,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:56:18,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1363557908, now seen corresponding path program 1 times [2022-07-21 13:56:18,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:56:18,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037427579] [2022-07-21 13:56:18,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:56:18,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:56:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:56:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:56:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:56:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:56:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:56:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:56:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 13:56:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 13:56:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 13:56:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 13:56:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 13:56:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 13:56:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 13:56:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 13:56:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 13:56:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 13:56:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 13:56:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 13:56:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 13:56:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-21 13:56:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-21 13:56:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2022-07-21 13:56:18,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:56:18,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037427579] [2022-07-21 13:56:18,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037427579] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:56:18,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:56:18,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 13:56:18,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324983079] [2022-07-21 13:56:18,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:56:18,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 13:56:18,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:56:18,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 13:56:18,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 13:56:18,796 INFO L87 Difference]: Start difference. First operand 19687 states and 28426 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 13:56:25,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:56:25,148 INFO L93 Difference]: Finished difference Result 19801 states and 28632 transitions. [2022-07-21 13:56:25,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 13:56:25,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 184 [2022-07-21 13:56:25,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:56:25,236 INFO L225 Difference]: With dead ends: 19801 [2022-07-21 13:56:25,236 INFO L226 Difference]: Without dead ends: 19799 [2022-07-21 13:56:25,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 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-21 13:56:25,254 INFO L413 NwaCegarLoop]: 2501 mSDtfsCounter, 2645 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2897 SdHoareTripleChecker+Valid, 5476 SdHoareTripleChecker+Invalid, 5970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1747 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-21 13:56:25,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2897 Valid, 5476 Invalid, 5970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1747 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-21 13:56:25,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19799 states. [2022-07-21 13:56:26,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19799 to 19691. [2022-07-21 13:56:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19691 states, 12246 states have (on average 1.2578801241221624) internal successors, (15404), 12526 states have internal predecessors, (15404), 6460 states have call successors, (6460), 983 states have call predecessors, (6460), 982 states have return successors, (6565), 6289 states have call predecessors, (6565), 6457 states have call successors, (6565) [2022-07-21 13:56:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19691 states to 19691 states and 28429 transitions. [2022-07-21 13:56:26,246 INFO L78 Accepts]: Start accepts. Automaton has 19691 states and 28429 transitions. Word has length 184 [2022-07-21 13:56:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:56:26,247 INFO L495 AbstractCegarLoop]: Abstraction has 19691 states and 28429 transitions. [2022-07-21 13:56:26,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 13:56:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 19691 states and 28429 transitions. [2022-07-21 13:56:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-21 13:56:26,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:56:26,250 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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] [2022-07-21 13:56:26,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 13:56:26,250 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-21 13:56:26,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:56:26,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1860979088, now seen corresponding path program 1 times [2022-07-21 13:56:26,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:56:26,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825637095] [2022-07-21 13:56:26,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:56:26,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:56:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:56:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:56:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:56:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:56:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:56:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:56:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 13:56:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 13:56:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 13:56:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 13:56:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 13:56:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 13:56:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 13:56:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 13:56:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 13:56:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 13:56:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 13:56:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 13:56:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 13:56:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-21 13:56:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-21 13:56:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-21 13:56:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2022-07-21 13:56:26,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:56:26,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825637095] [2022-07-21 13:56:26,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825637095] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:56:26,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:56:26,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 13:56:26,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018348374] [2022-07-21 13:56:26,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:56:26,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 13:56:26,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:56:26,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 13:56:26,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 13:56:26,519 INFO L87 Difference]: Start difference. First operand 19691 states and 28429 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 13:56:34,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:56:34,646 INFO L93 Difference]: Finished difference Result 19805 states and 28635 transitions. [2022-07-21 13:56:34,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 13:56:34,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 189 [2022-07-21 13:56:34,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:56:34,724 INFO L225 Difference]: With dead ends: 19805 [2022-07-21 13:56:34,725 INFO L226 Difference]: Without dead ends: 19803 [2022-07-21 13:56:34,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 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-21 13:56:34,734 INFO L413 NwaCegarLoop]: 2501 mSDtfsCounter, 2645 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2897 SdHoareTripleChecker+Valid, 5476 SdHoareTripleChecker+Invalid, 5969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1746 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-21 13:56:34,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2897 Valid, 5476 Invalid, 5969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1746 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-07-21 13:56:34,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19803 states. [2022-07-21 13:56:35,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19803 to 19695. [2022-07-21 13:56:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19695 states, 12249 states have (on average 1.2578169646501756) internal successors, (15407), 12529 states have internal predecessors, (15407), 6460 states have call successors, (6460), 984 states have call predecessors, (6460), 983 states have return successors, (6565), 6289 states have call predecessors, (6565), 6457 states have call successors, (6565) [2022-07-21 13:56:35,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19695 states to 19695 states and 28432 transitions. [2022-07-21 13:56:35,762 INFO L78 Accepts]: Start accepts. Automaton has 19695 states and 28432 transitions. Word has length 189 [2022-07-21 13:56:35,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:56:35,763 INFO L495 AbstractCegarLoop]: Abstraction has 19695 states and 28432 transitions. [2022-07-21 13:56:35,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 13:56:35,763 INFO L276 IsEmpty]: Start isEmpty. Operand 19695 states and 28432 transitions. [2022-07-21 13:56:35,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-21 13:56:35,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:56:35,767 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 13:56:35,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 13:56:35,767 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-21 13:56:35,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:56:35,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2102571409, now seen corresponding path program 1 times [2022-07-21 13:56:35,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:56:35,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007486547] [2022-07-21 13:56:35,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:56:35,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:56:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:56:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:56:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:56:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:56:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:56:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:56:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 13:56:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 13:56:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 13:56:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 13:56:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 13:56:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 13:56:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 13:56:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 13:56:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 13:56:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 13:56:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 13:56:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 13:56:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:35,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 13:56:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:36,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 13:56:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:36,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 13:56:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2022-07-21 13:56:36,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:56:36,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007486547] [2022-07-21 13:56:36,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007486547] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:56:36,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:56:36,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 13:56:36,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513214128] [2022-07-21 13:56:36,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:56:36,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 13:56:36,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:56:36,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 13:56:36,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 13:56:36,013 INFO L87 Difference]: Start difference. First operand 19695 states and 28432 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 13:56:38,423 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 13:56:40,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 13:56:42,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 13:56:49,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:56:49,692 INFO L93 Difference]: Finished difference Result 25657 states and 37242 transitions. [2022-07-21 13:56:49,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 13:56:49,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 174 [2022-07-21 13:56:49,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:56:49,823 INFO L225 Difference]: With dead ends: 25657 [2022-07-21 13:56:49,823 INFO L226 Difference]: Without dead ends: 25655 [2022-07-21 13:56:49,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-21 13:56:49,845 INFO L413 NwaCegarLoop]: 3121 mSDtfsCounter, 2208 mSDsluCounter, 3377 mSDsCounter, 0 mSdLazyCounter, 7493 mSolverCounterSat, 1614 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2673 SdHoareTripleChecker+Valid, 6498 SdHoareTripleChecker+Invalid, 9107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1614 IncrementalHoareTripleChecker+Valid, 7493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-07-21 13:56:49,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2673 Valid, 6498 Invalid, 9107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1614 Valid, 7493 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2022-07-21 13:56:49,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25655 states. [2022-07-21 13:56:51,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25655 to 25539. [2022-07-21 13:56:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25539 states, 15492 states have (on average 1.2541957139168602) internal successors, (19430), 15826 states have internal predecessors, (19430), 8750 states have call successors, (8750), 1295 states have call predecessors, (8750), 1294 states have return successors, (8855), 8549 states have call predecessors, (8855), 8747 states have call successors, (8855) [2022-07-21 13:56:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25539 states to 25539 states and 37035 transitions. [2022-07-21 13:56:51,280 INFO L78 Accepts]: Start accepts. Automaton has 25539 states and 37035 transitions. Word has length 174 [2022-07-21 13:56:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:56:51,281 INFO L495 AbstractCegarLoop]: Abstraction has 25539 states and 37035 transitions. [2022-07-21 13:56:51,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 13:56:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 25539 states and 37035 transitions. [2022-07-21 13:56:51,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-21 13:56:51,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:56:51,286 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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-21 13:56:51,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 13:56:51,286 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-21 13:56:51,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:56:51,287 INFO L85 PathProgramCache]: Analyzing trace with hash 736043728, now seen corresponding path program 1 times [2022-07-21 13:56:51,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:56:51,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509916489] [2022-07-21 13:56:51,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:56:51,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:56:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:56:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:56:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:56:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:56:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:56:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:56:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 13:56:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 13:56:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 13:56:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 13:56:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:56:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 13:56:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 13:56:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 13:56:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 13:56:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 13:56:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 13:56:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 13:56:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 13:56:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 13:56:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-21 13:56:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-21 13:56:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-21 13:56:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-21 13:56:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-21 13:56:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:56:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-21 13:56:51,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:56:51,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509916489] [2022-07-21 13:56:51,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509916489] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:56:51,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:56:51,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 13:56:51,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354199017] [2022-07-21 13:56:51,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:56:51,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 13:56:51,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:56:51,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 13:56:51,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 13:56:51,585 INFO L87 Difference]: Start difference. First operand 25539 states and 37035 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 13:56:54,919 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 13:57:00,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:57:00,049 INFO L93 Difference]: Finished difference Result 25661 states and 37245 transitions. [2022-07-21 13:57:00,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 13:57:00,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 199 [2022-07-21 13:57:00,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:57:00,351 INFO L225 Difference]: With dead ends: 25661 [2022-07-21 13:57:00,351 INFO L226 Difference]: Without dead ends: 25659 [2022-07-21 13:57:00,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-21 13:57:00,366 INFO L413 NwaCegarLoop]: 2500 mSDtfsCounter, 2645 mSDsluCounter, 2972 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1744 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2898 SdHoareTripleChecker+Valid, 5472 SdHoareTripleChecker+Invalid, 5967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1744 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-21 13:57:00,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2898 Valid, 5472 Invalid, 5967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1744 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-07-21 13:57:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25659 states. [2022-07-21 13:57:01,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25659 to 25543. [2022-07-21 13:57:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25543 states, 15495 states have (on average 1.2541464988706035) internal successors, (19433), 15829 states have internal predecessors, (19433), 8750 states have call successors, (8750), 1296 states have call predecessors, (8750), 1295 states have return successors, (8855), 8549 states have call predecessors, (8855), 8747 states have call successors, (8855) [2022-07-21 13:57:01,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25543 states to 25543 states and 37038 transitions. [2022-07-21 13:57:01,731 INFO L78 Accepts]: Start accepts. Automaton has 25543 states and 37038 transitions. Word has length 199 [2022-07-21 13:57:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:57:01,732 INFO L495 AbstractCegarLoop]: Abstraction has 25543 states and 37038 transitions. [2022-07-21 13:57:01,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 13:57:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 25543 states and 37038 transitions. [2022-07-21 13:57:01,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-07-21 13:57:01,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:57:01,736 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 13:57:01,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 13:57:01,737 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-21 13:57:01,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:57:01,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1717848849, now seen corresponding path program 1 times [2022-07-21 13:57:01,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:57:01,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969884255] [2022-07-21 13:57:01,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:57:01,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:57:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:01,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:57:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:01,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:01,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:57:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:01,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:01,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:57:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:01,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:01,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:57:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:01,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:01,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:57:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:01,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:01,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:57:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:01,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 13:57:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:01,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 13:57:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:01,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 13:57:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:01,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 13:57:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:01,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:01,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 13:57:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:01,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 13:57:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:01,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 13:57:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:02,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 13:57:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:02,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 13:57:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:02,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 13:57:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:02,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 13:57:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:02,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 13:57:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:02,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 13:57:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:02,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 13:57:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:02,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 13:57:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:02,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-21 13:57:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:02,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-21 13:57:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:02,059 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2022-07-21 13:57:02,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:57:02,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969884255] [2022-07-21 13:57:02,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969884255] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:57:02,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:57:02,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 13:57:02,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939541286] [2022-07-21 13:57:02,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:57:02,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 13:57:02,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:57:02,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 13:57:02,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 13:57:02,064 INFO L87 Difference]: Start difference. First operand 25543 states and 37038 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 13:57:09,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:57:09,760 INFO L93 Difference]: Finished difference Result 25665 states and 37248 transitions. [2022-07-21 13:57:09,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 13:57:09,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2022-07-21 13:57:09,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:57:09,886 INFO L225 Difference]: With dead ends: 25665 [2022-07-21 13:57:09,886 INFO L226 Difference]: Without dead ends: 25663 [2022-07-21 13:57:09,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 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-21 13:57:09,911 INFO L413 NwaCegarLoop]: 2501 mSDtfsCounter, 2656 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1743 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2910 SdHoareTripleChecker+Valid, 5476 SdHoareTripleChecker+Invalid, 5966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1743 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-21 13:57:09,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2910 Valid, 5476 Invalid, 5966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1743 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-07-21 13:57:09,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25663 states. [2022-07-21 13:57:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25663 to 25547. [2022-07-21 13:57:11,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25547 states, 15498 states have (on average 1.2540973028777906) internal successors, (19436), 15832 states have internal predecessors, (19436), 8750 states have call successors, (8750), 1297 states have call predecessors, (8750), 1296 states have return successors, (8855), 8549 states have call predecessors, (8855), 8747 states have call successors, (8855) [2022-07-21 13:57:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25547 states to 25547 states and 37041 transitions. [2022-07-21 13:57:11,372 INFO L78 Accepts]: Start accepts. Automaton has 25547 states and 37041 transitions. Word has length 184 [2022-07-21 13:57:11,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:57:11,372 INFO L495 AbstractCegarLoop]: Abstraction has 25547 states and 37041 transitions. [2022-07-21 13:57:11,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 13:57:11,372 INFO L276 IsEmpty]: Start isEmpty. Operand 25547 states and 37041 transitions. [2022-07-21 13:57:11,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-07-21 13:57:11,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:57:11,377 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 9, 9, 6, 6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 13:57:11,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 13:57:11,378 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-21 13:57:11,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:57:11,378 INFO L85 PathProgramCache]: Analyzing trace with hash 427105296, now seen corresponding path program 1 times [2022-07-21 13:57:11,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:57:11,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537574155] [2022-07-21 13:57:11,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:57:11,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:57:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:57:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:57:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:57:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:57:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:57:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:57:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 13:57:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 13:57:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 13:57:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 13:57:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 13:57:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 13:57:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 13:57:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 13:57:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 13:57:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 13:57:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 13:57:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 13:57:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 13:57:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-21 13:57:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-21 13:57:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-21 13:57:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-21 13:57:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-21 13:57:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-21 13:57:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-21 13:57:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2022-07-21 13:57:11,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:57:11,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537574155] [2022-07-21 13:57:11,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537574155] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:57:11,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:57:11,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 13:57:11,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115586982] [2022-07-21 13:57:11,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:57:11,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 13:57:11,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:57:11,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 13:57:11,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 13:57:11,650 INFO L87 Difference]: Start difference. First operand 25547 states and 37041 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-21 13:57:20,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:57:20,325 INFO L93 Difference]: Finished difference Result 25669 states and 37251 transitions. [2022-07-21 13:57:20,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 13:57:20,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 209 [2022-07-21 13:57:20,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:57:20,423 INFO L225 Difference]: With dead ends: 25669 [2022-07-21 13:57:20,423 INFO L226 Difference]: Without dead ends: 25667 [2022-07-21 13:57:20,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 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-21 13:57:20,435 INFO L413 NwaCegarLoop]: 2500 mSDtfsCounter, 2645 mSDsluCounter, 2972 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1742 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2898 SdHoareTripleChecker+Valid, 5472 SdHoareTripleChecker+Invalid, 5965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1742 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-21 13:57:20,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2898 Valid, 5472 Invalid, 5965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1742 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-07-21 13:57:20,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25667 states. [2022-07-21 13:57:21,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25667 to 25551. [2022-07-21 13:57:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25551 states, 15501 states have (on average 1.2540481259273595) internal successors, (19439), 15835 states have internal predecessors, (19439), 8750 states have call successors, (8750), 1298 states have call predecessors, (8750), 1297 states have return successors, (8855), 8549 states have call predecessors, (8855), 8747 states have call successors, (8855) [2022-07-21 13:57:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25551 states to 25551 states and 37044 transitions. [2022-07-21 13:57:21,862 INFO L78 Accepts]: Start accepts. Automaton has 25551 states and 37044 transitions. Word has length 209 [2022-07-21 13:57:21,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:57:21,862 INFO L495 AbstractCegarLoop]: Abstraction has 25551 states and 37044 transitions. [2022-07-21 13:57:21,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-21 13:57:21,863 INFO L276 IsEmpty]: Start isEmpty. Operand 25551 states and 37044 transitions. [2022-07-21 13:57:21,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-21 13:57:21,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:57:21,867 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 9, 9, 6, 6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 13:57:21,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 13:57:21,867 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-21 13:57:21,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:57:21,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1396251820, now seen corresponding path program 1 times [2022-07-21 13:57:21,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:57:21,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023055791] [2022-07-21 13:57:21,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:57:21,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:57:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:57:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:57:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:57:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:57:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:57:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:57:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 13:57:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 13:57:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 13:57:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 13:57:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 13:57:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 13:57:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 13:57:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 13:57:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 13:57:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 13:57:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 13:57:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 13:57:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 13:57:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-21 13:57:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-21 13:57:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-21 13:57:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-21 13:57:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-21 13:57:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-21 13:57:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-21 13:57:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-21 13:57:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2022-07-21 13:57:22,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:57:22,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023055791] [2022-07-21 13:57:22,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023055791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:57:22,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:57:22,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 13:57:22,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120107761] [2022-07-21 13:57:22,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:57:22,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 13:57:22,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:57:22,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 13:57:22,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 13:57:22,132 INFO L87 Difference]: Start difference. First operand 25551 states and 37044 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-21 13:57:29,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:57:29,796 INFO L93 Difference]: Finished difference Result 25673 states and 37254 transitions. [2022-07-21 13:57:29,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 13:57:29,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 214 [2022-07-21 13:57:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:57:29,909 INFO L225 Difference]: With dead ends: 25673 [2022-07-21 13:57:29,909 INFO L226 Difference]: Without dead ends: 25669 [2022-07-21 13:57:29,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 67 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-21 13:57:29,925 INFO L413 NwaCegarLoop]: 2501 mSDtfsCounter, 2645 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 4223 mSolverCounterSat, 1741 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2897 SdHoareTripleChecker+Valid, 5476 SdHoareTripleChecker+Invalid, 5964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1741 IncrementalHoareTripleChecker+Valid, 4223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-21 13:57:29,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2897 Valid, 5476 Invalid, 5964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1741 Valid, 4223 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-21 13:57:29,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25669 states. [2022-07-21 13:57:31,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25669 to 25553. [2022-07-21 13:57:31,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25553 states, 15503 states have (on average 1.2539508482229247) internal successors, (19440), 15836 states have internal predecessors, (19440), 8750 states have call successors, (8750), 1299 states have call predecessors, (8750), 1297 states have return successors, (8855), 8549 states have call predecessors, (8855), 8747 states have call successors, (8855) [2022-07-21 13:57:31,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25553 states to 25553 states and 37045 transitions. [2022-07-21 13:57:31,422 INFO L78 Accepts]: Start accepts. Automaton has 25553 states and 37045 transitions. Word has length 214 [2022-07-21 13:57:31,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:57:31,422 INFO L495 AbstractCegarLoop]: Abstraction has 25553 states and 37045 transitions. [2022-07-21 13:57:31,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-21 13:57:31,423 INFO L276 IsEmpty]: Start isEmpty. Operand 25553 states and 37045 transitions. [2022-07-21 13:57:31,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-21 13:57:31,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:57:31,428 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 9, 9, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 13:57:31,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 13:57:31,428 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-21 13:57:31,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:57:31,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1071343725, now seen corresponding path program 1 times [2022-07-21 13:57:31,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:57:31,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325907508] [2022-07-21 13:57:31,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:57:31,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:57:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:57:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:57:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:57:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:57:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:57:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:57:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 13:57:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 13:57:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 13:57:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 13:57:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 13:57:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 13:57:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 13:57:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 13:57:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 13:57:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 13:57:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 13:57:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 13:57:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 13:57:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-21 13:57:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 13:57:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-21 13:57:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-21 13:57:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-21 13:57:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-21 13:57:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-21 13:57:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2022-07-21 13:57:31,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:57:31,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325907508] [2022-07-21 13:57:31,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325907508] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:57:31,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:57:31,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 13:57:31,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961592046] [2022-07-21 13:57:31,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:57:31,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 13:57:31,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:57:31,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 13:57:31,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 13:57:31,697 INFO L87 Difference]: Start difference. First operand 25553 states and 37045 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-21 13:57:39,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:57:39,142 INFO L93 Difference]: Finished difference Result 25669 states and 37250 transitions. [2022-07-21 13:57:39,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 13:57:39,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 199 [2022-07-21 13:57:39,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:57:39,431 INFO L225 Difference]: With dead ends: 25669 [2022-07-21 13:57:39,432 INFO L226 Difference]: Without dead ends: 25451 [2022-07-21 13:57:39,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 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-21 13:57:39,445 INFO L413 NwaCegarLoop]: 2499 mSDtfsCounter, 2650 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 4218 mSolverCounterSat, 1740 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2903 SdHoareTripleChecker+Valid, 5477 SdHoareTripleChecker+Invalid, 5958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1740 IncrementalHoareTripleChecker+Valid, 4218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-21 13:57:39,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2903 Valid, 5477 Invalid, 5958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1740 Valid, 4218 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-21 13:57:39,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25451 states. [2022-07-21 13:57:40,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25451 to 25335. [2022-07-21 13:57:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25335 states, 15355 states have (on average 1.253663301856073) internal successors, (19250), 15672 states have internal predecessors, (19250), 8697 states have call successors, (8697), 1281 states have call predecessors, (8697), 1281 states have return successors, (8805), 8513 states have call predecessors, (8805), 8697 states have call successors, (8805) [2022-07-21 13:57:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25335 states to 25335 states and 36752 transitions. [2022-07-21 13:57:40,845 INFO L78 Accepts]: Start accepts. Automaton has 25335 states and 36752 transitions. Word has length 199 [2022-07-21 13:57:40,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:57:40,846 INFO L495 AbstractCegarLoop]: Abstraction has 25335 states and 36752 transitions. [2022-07-21 13:57:40,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-21 13:57:40,846 INFO L276 IsEmpty]: Start isEmpty. Operand 25335 states and 36752 transitions. [2022-07-21 13:57:40,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-07-21 13:57:40,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:57:40,852 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 13:57:40,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 13:57:40,853 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-21 13:57:40,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:57:40,853 INFO L85 PathProgramCache]: Analyzing trace with hash 842221792, now seen corresponding path program 1 times [2022-07-21 13:57:40,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:57:40,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168425423] [2022-07-21 13:57:40,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:57:40,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:57:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:40,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:57:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:40,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:40,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:57:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:40,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:40,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:57:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:40,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:57:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:57:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:57:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 13:57:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 13:57:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 13:57:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 13:57:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 13:57:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 13:57:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 13:57:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 13:57:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 13:57:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:57:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 13:57:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 13:57:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 13:57:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 13:57:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 13:57:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-21 13:57:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:41,125 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-07-21 13:57:41,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:57:41,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168425423] [2022-07-21 13:57:41,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168425423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:57:41,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:57:41,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 13:57:41,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786431385] [2022-07-21 13:57:41,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:57:41,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 13:57:41,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:57:41,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 13:57:41,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 13:57:41,128 INFO L87 Difference]: Start difference. First operand 25335 states and 36752 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-21 13:57:45,879 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 13:57:56,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:57:56,488 INFO L93 Difference]: Finished difference Result 60198 states and 87519 transitions. [2022-07-21 13:57:56,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 13:57:56,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 219 [2022-07-21 13:57:56,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:57:56,722 INFO L225 Difference]: With dead ends: 60198 [2022-07-21 13:57:56,723 INFO L226 Difference]: Without dead ends: 34919 [2022-07-21 13:57:56,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-21 13:57:56,846 INFO L413 NwaCegarLoop]: 3975 mSDtfsCounter, 2627 mSDsluCounter, 2155 mSDsCounter, 0 mSdLazyCounter, 3507 mSolverCounterSat, 2784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3110 SdHoareTripleChecker+Valid, 6130 SdHoareTripleChecker+Invalid, 6291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2784 IncrementalHoareTripleChecker+Valid, 3507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-07-21 13:57:56,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3110 Valid, 6130 Invalid, 6291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2784 Valid, 3507 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time] [2022-07-21 13:57:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34919 states. [2022-07-21 13:57:59,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34919 to 34557. [2022-07-21 13:57:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34557 states, 20835 states have (on average 1.2529877609791216) internal successors, (26106), 21240 states have internal predecessors, (26106), 11959 states have call successors, (11959), 1761 states have call predecessors, (11959), 1761 states have return successors, (12067), 11733 states have call predecessors, (12067), 11959 states have call successors, (12067) [2022-07-21 13:57:59,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34557 states to 34557 states and 50132 transitions. [2022-07-21 13:57:59,549 INFO L78 Accepts]: Start accepts. Automaton has 34557 states and 50132 transitions. Word has length 219 [2022-07-21 13:57:59,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 13:57:59,550 INFO L495 AbstractCegarLoop]: Abstraction has 34557 states and 50132 transitions. [2022-07-21 13:57:59,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-21 13:57:59,550 INFO L276 IsEmpty]: Start isEmpty. Operand 34557 states and 50132 transitions. [2022-07-21 13:57:59,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-07-21 13:57:59,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 13:57:59,726 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 10, 10, 10, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:57:59,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 13:57:59,727 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-21 13:57:59,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 13:57:59,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1259218469, now seen corresponding path program 1 times [2022-07-21 13:57:59,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 13:57:59,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348152565] [2022-07-21 13:57:59,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 13:57:59,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 13:57:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:57:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 13:57:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 13:57:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-21 13:57:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 13:57:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 13:57:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 13:57:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 13:57:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 13:57:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 13:57:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 13:57:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 13:57:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 13:57:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 13:57:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 13:57:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 13:57:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-21 13:57:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 13:57:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 13:57:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 13:57:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-21 13:57:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:57:59,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-21 13:57:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:58:00,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-21 13:58:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:58:00,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 13:58:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:58:00,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 13:58:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:58:00,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 13:58:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:58:00,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 13:58:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:58:00,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 13:58:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:58:00,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 13:58:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:58:00,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2022-07-21 13:58:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:58:00,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-21 13:58:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 13:58:00,085 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2022-07-21 13:58:00,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 13:58:00,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348152565] [2022-07-21 13:58:00,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348152565] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 13:58:00,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 13:58:00,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 13:58:00,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318933730] [2022-07-21 13:58:00,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 13:58:00,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 13:58:00,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 13:58:00,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 13:58:00,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 13:58:00,088 INFO L87 Difference]: Start difference. First operand 34557 states and 50132 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (32), 4 states have call predecessors, (32), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-21 13:58:02,959 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 13:58:06,363 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 13:58:16,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 13:58:16,697 INFO L93 Difference]: Finished difference Result 78437 states and 113975 transitions. [2022-07-21 13:58:16,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 13:58:16,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 3 states have internal predecessors, (139), 3 states have call successors, (32), 4 states have call predecessors, (32), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 293 [2022-07-21 13:58:16,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 13:58:17,023 INFO L225 Difference]: With dead ends: 78437 [2022-07-21 13:58:17,023 INFO L226 Difference]: Without dead ends: 43893 [2022-07-21 13:58:17,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-21 13:58:17,327 INFO L413 NwaCegarLoop]: 3956 mSDtfsCounter, 2614 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 3462 mSolverCounterSat, 2737 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3097 SdHoareTripleChecker+Valid, 6130 SdHoareTripleChecker+Invalid, 6200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2737 IncrementalHoareTripleChecker+Valid, 3462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2022-07-21 13:58:17,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3097 Valid, 6130 Invalid, 6200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2737 Valid, 3462 Invalid, 1 Unknown, 0 Unchecked, 13.9s Time] [2022-07-21 13:58:17,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43893 states.