./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-irda-via-ircc.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-irda-via-ircc.cil.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --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 6c1be66de5de44f99e184f931232a9d8bcb0b8fd4712efbcede070913355a2c0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:12:32,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:12:32,849 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-12 02:12:32,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:12:32,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:12:32,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:12:32,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:12:32,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:12:32,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:12:32,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:12:32,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:12:32,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:12:32,910 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:12:32,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:12:32,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:12:32,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:12:32,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:12:32,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:12:32,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:12:32,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:12:32,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:12:32,915 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:12:32,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:12:32,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:12:32,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:12:32,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:12:32,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:12:32,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:12:32,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:12:32,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:12:32,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:12:32,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:12:32,920 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:12:32,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:12:32,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:12:32,921 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:12:32,921 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/bin/uautomizer-verify-uTZkv6EMXl/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 6c1be66de5de44f99e184f931232a9d8bcb0b8fd4712efbcede070913355a2c0 [2023-11-12 02:12:33,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:12:33,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:12:33,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:12:33,243 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:12:33,244 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:12:33,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-irda-via-ircc.cil.i [2023-11-12 02:12:36,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:12:37,127 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:12:37,128 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-irda-via-ircc.cil.i [2023-11-12 02:12:37,183 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/bin/uautomizer-verify-uTZkv6EMXl/data/e666acd5d/89bd32cd5b9b4248bc74b7c89f26467f/FLAG7a4618e8b [2023-11-12 02:12:37,205 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/bin/uautomizer-verify-uTZkv6EMXl/data/e666acd5d/89bd32cd5b9b4248bc74b7c89f26467f [2023-11-12 02:12:37,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:12:37,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:12:37,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:12:37,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:12:37,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:12:37,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:12:37" (1/1) ... [2023-11-12 02:12:37,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ea8ae30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:37, skipping insertion in model container [2023-11-12 02:12:37,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:12:37" (1/1) ... [2023-11-12 02:12:37,402 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:12:40,444 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-irda-via-ircc.cil.i[324559,324572] [2023-11-12 02:12:40,453 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-irda-via-ircc.cil.i[324728,324741] [2023-11-12 02:12:40,456 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-irda-via-ircc.cil.i[324895,324908] [2023-11-12 02:12:40,465 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-irda-via-ircc.cil.i[325063,325076] [2023-11-12 02:12:40,482 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:12:40,518 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:12:40,686 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5761] [2023-11-12 02:12:40,688 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [5768] [2023-11-12 02:12:40,688 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("":); [5775] [2023-11-12 02:12:40,690 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/home/debian/klever-work/native-scheduler-work-dir/scheduler/jobs/7cdfae59d3ac602223400f61d8829e28/klever-core-work-dir/520b8de/linux-kernel-locking-spinlock/lkbce/arch/x86/include/asm/paravirt.h"), "i" (804), "i" (12UL)); [5805-5806] [2023-11-12 02:12:40,690 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (44UL), [paravirt_opptr] "i" (& pv_irq_ops.save_fl.func), [paravirt_clobber] "i" (1): "memory", "cc"); [5811-5813] [2023-11-12 02:12:40,693 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("outb %b0, %w1": : "a" (value), "Nd" (port)); [5894] [2023-11-12 02:12:40,694 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("inb %w1, %b0": "=a" (value): "Nd" (port)); [5902] [2023-11-12 02:12:40,983 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-irda-via-ircc.cil.i[324559,324572] [2023-11-12 02:12:40,984 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-irda-via-ircc.cil.i[324728,324741] [2023-11-12 02:12:40,984 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-irda-via-ircc.cil.i[324895,324908] [2023-11-12 02:12:40,986 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/sv-benchmarks/c/ldv-linux-3.14/linux-3.14_linux-kernel-locking-spinlock_drivers-net-irda-via-ircc.cil.i[325063,325076] [2023-11-12 02:12:41,002 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:12:41,159 WARN L672 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:12:41,166 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:12:41,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:41 WrapperNode [2023-11-12 02:12:41,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:12:41,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:12:41,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:12:41,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:12:41,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:41" (1/1) ... [2023-11-12 02:12:41,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:41" (1/1) ... [2023-11-12 02:12:41,549 INFO L138 Inliner]: procedures = 386, calls = 2104, calls flagged for inlining = 151, calls inlined = 130, statements flattened = 4671 [2023-11-12 02:12:41,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:12:41,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:12:41,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:12:41,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:12:41,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:41" (1/1) ... [2023-11-12 02:12:41,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:41" (1/1) ... [2023-11-12 02:12:41,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:41" (1/1) ... [2023-11-12 02:12:41,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:41" (1/1) ... [2023-11-12 02:12:41,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:41" (1/1) ... [2023-11-12 02:12:41,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:41" (1/1) ... [2023-11-12 02:12:41,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:41" (1/1) ... [2023-11-12 02:12:41,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:41" (1/1) ... [2023-11-12 02:12:41,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:12:41,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:12:41,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:12:41,874 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:12:41,875 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:41" (1/1) ... [2023-11-12 02:12:41,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:12:41,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:12:41,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:12:41,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64fe6f76-34a3-4e63-b1d5-34070d9bbf19/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:12:42,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-12 02:12:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-12 02:12:42,017 INFO L130 BoogieDeclarations]: Found specification of procedure RxCurCount [2023-11-12 02:12:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure RxCurCount [2023-11-12 02:12:42,017 INFO L130 BoogieDeclarations]: Found specification of procedure irda_setup_dma [2023-11-12 02:12:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure irda_setup_dma [2023-11-12 02:12:42,018 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2023-11-12 02:12:42,018 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2023-11-12 02:12:42,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-12 02:12:42,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-12 02:12:42,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_73 [2023-11-12 02:12:42,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_73 [2023-11-12 02:12:42,019 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2023-11-12 02:12:42,019 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2023-11-12 02:12:42,020 INFO L130 BoogieDeclarations]: Found specification of procedure CheckRegBit [2023-11-12 02:12:42,020 INFO L138 BoogieDeclarations]: Found implementation of procedure CheckRegBit [2023-11-12 02:12:42,020 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2023-11-12 02:12:42,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2023-11-12 02:12:42,020 INFO L130 BoogieDeclarations]: Found specification of procedure via_remove_one [2023-11-12 02:12:42,021 INFO L138 BoogieDeclarations]: Found implementation of procedure via_remove_one [2023-11-12 02:12:42,021 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_change_speed [2023-11-12 02:12:42,022 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_change_speed [2023-11-12 02:12:42,022 INFO L130 BoogieDeclarations]: Found specification of procedure dma_zalloc_coherent [2023-11-12 02:12:42,024 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_zalloc_coherent [2023-11-12 02:12:42,024 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-12 02:12:42,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2023-11-12 02:12:42,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2023-11-12 02:12:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure SetPulseWidth [2023-11-12 02:12:42,025 INFO L138 BoogieDeclarations]: Found implementation of procedure SetPulseWidth [2023-11-12 02:12:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure Tdelay [2023-11-12 02:12:42,025 INFO L138 BoogieDeclarations]: Found implementation of procedure Tdelay [2023-11-12 02:12:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2023-11-12 02:12:42,025 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2023-11-12 02:12:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2023-11-12 02:12:42,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2023-11-12 02:12:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:12:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure ClkTx [2023-11-12 02:12:42,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ClkTx [2023-11-12 02:12:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure WriteLPCReg [2023-11-12 02:12:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure WriteLPCReg [2023-11-12 02:12:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2023-11-12 02:12:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2023-11-12 02:12:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure CommonInit [2023-11-12 02:12:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure CommonInit [2023-11-12 02:12:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2023-11-12 02:12:42,027 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2023-11-12 02:12:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_change_dongle_speed [2023-11-12 02:12:42,028 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_change_dongle_speed [2023-11-12 02:12:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure ReadLPCReg [2023-11-12 02:12:42,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadLPCReg [2023-11-12 02:12:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2023-11-12 02:12:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure free_dma [2023-11-12 02:12:42,029 INFO L138 BoogieDeclarations]: Found implementation of procedure free_dma [2023-11-12 02:12:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_lock_of_via_ircc_cb [2023-11-12 02:12:42,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_lock_of_via_ircc_cb [2023-11-12 02:12:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_dma_receive [2023-11-12 02:12:42,031 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_dma_receive [2023-11-12 02:12:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2023-11-12 02:12:42,031 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2023-11-12 02:12:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-12 02:12:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2023-11-12 02:12:42,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2023-11-12 02:12:42,033 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_net_close [2023-11-12 02:12:42,033 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_net_close [2023-11-12 02:12:42,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:12:42,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2023-11-12 02:12:42,033 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2023-11-12 02:12:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure CkRxRecv [2023-11-12 02:12:42,034 INFO L138 BoogieDeclarations]: Found implementation of procedure CkRxRecv [2023-11-12 02:12:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2023-11-12 02:12:42,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2023-11-12 02:12:42,035 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2023-11-12 02:12:42,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2023-11-12 02:12:42,035 INFO L130 BoogieDeclarations]: Found specification of procedure irda_get_next_speed [2023-11-12 02:12:42,035 INFO L138 BoogieDeclarations]: Found implementation of procedure irda_get_next_speed [2023-11-12 02:12:42,035 INFO L130 BoogieDeclarations]: Found specification of procedure ReadReg [2023-11-12 02:12:42,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ReadReg [2023-11-12 02:12:42,036 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_open [2023-11-12 02:12:42,036 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_open [2023-11-12 02:12:42,036 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2023-11-12 02:12:42,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exit [2023-11-12 02:12:42,037 INFO L130 BoogieDeclarations]: Found specification of procedure WriteRegBit [2023-11-12 02:12:42,037 INFO L138 BoogieDeclarations]: Found implementation of procedure WriteRegBit [2023-11-12 02:12:42,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 02:12:42,037 INFO L130 BoogieDeclarations]: Found specification of procedure Wr_Indx [2023-11-12 02:12:42,037 INFO L138 BoogieDeclarations]: Found implementation of procedure Wr_Indx [2023-11-12 02:12:42,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:12:42,038 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-11-12 02:12:42,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-11-12 02:12:42,038 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2023-11-12 02:12:42,038 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2023-11-12 02:12:42,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 02:12:42,039 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-11-12 02:12:42,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-11-12 02:12:42,039 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2023-11-12 02:12:42,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2023-11-12 02:12:42,039 INFO L130 BoogieDeclarations]: Found specification of procedure WriteReg [2023-11-12 02:12:42,039 INFO L138 BoogieDeclarations]: Found implementation of procedure WriteReg [2023-11-12 02:12:42,039 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_spin_lock [2023-11-12 02:12:42,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_spin_lock [2023-11-12 02:12:42,040 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2023-11-12 02:12:42,040 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2023-11-12 02:12:42,040 INFO L130 BoogieDeclarations]: Found specification of procedure SetBaudRate [2023-11-12 02:12:42,041 INFO L138 BoogieDeclarations]: Found implementation of procedure SetBaudRate [2023-11-12 02:12:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure Wr_Byte [2023-11-12 02:12:42,041 INFO L138 BoogieDeclarations]: Found implementation of procedure Wr_Byte [2023-11-12 02:12:42,041 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2023-11-12 02:12:42,042 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2023-11-12 02:12:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2023-11-12 02:12:42,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2023-11-12 02:12:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_net_open [2023-11-12 02:12:42,043 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_net_open [2023-11-12 02:12:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:12:42,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:12:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure ResetChip [2023-11-12 02:12:42,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ResetChip [2023-11-12 02:12:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-12 02:12:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-12 02:12:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-12 02:12:42,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-12 02:12:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure irda_device_txqueue_empty [2023-11-12 02:12:42,045 INFO L138 BoogieDeclarations]: Found implementation of procedure irda_device_txqueue_empty [2023-11-12 02:12:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2023-11-12 02:12:42,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2023-11-12 02:12:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure pci_read_config_byte [2023-11-12 02:12:42,046 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_read_config_byte [2023-11-12 02:12:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure Sdelay [2023-11-12 02:12:42,046 INFO L138 BoogieDeclarations]: Found implementation of procedure Sdelay [2023-11-12 02:12:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure SetSIR [2023-11-12 02:12:42,046 INFO L138 BoogieDeclarations]: Found implementation of procedure SetSIR [2023-11-12 02:12:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2023-11-12 02:12:42,047 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2023-11-12 02:12:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure SetMaxRxPacketSize [2023-11-12 02:12:42,047 INFO L138 BoogieDeclarations]: Found implementation of procedure SetMaxRxPacketSize [2023-11-12 02:12:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure GetRecvByte [2023-11-12 02:12:42,047 INFO L138 BoogieDeclarations]: Found implementation of procedure GetRecvByte [2023-11-12 02:12:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2023-11-12 02:12:42,048 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2023-11-12 02:12:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:12:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 02:12:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure hwreset [2023-11-12 02:12:42,050 INFO L138 BoogieDeclarations]: Found implementation of procedure hwreset [2023-11-12 02:12:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 02:12:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-12 02:12:42,054 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-11-12 02:12:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2023-11-12 02:12:42,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2023-11-12 02:12:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_byte [2023-11-12 02:12:42,056 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_byte [2023-11-12 02:12:42,056 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2023-11-12 02:12:42,056 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2023-11-12 02:12:42,062 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2023-11-12 02:12:42,062 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2023-11-12 02:12:42,062 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2023-11-12 02:12:42,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2023-11-12 02:12:42,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2023-11-12 02:12:42,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2023-11-12 02:12:42,063 INFO L130 BoogieDeclarations]: Found specification of procedure via_ircc_dma_xmit [2023-11-12 02:12:42,063 INFO L138 BoogieDeclarations]: Found implementation of procedure via_ircc_dma_xmit [2023-11-12 02:12:42,063 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2023-11-12 02:12:42,063 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2023-11-12 02:12:42,063 INFO L130 BoogieDeclarations]: Found specification of procedure dma_free_attrs [2023-11-12 02:12:42,063 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_free_attrs [2023-11-12 02:12:42,064 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2023-11-12 02:12:42,064 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2023-11-12 02:12:42,064 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2023-11-12 02:12:42,064 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2023-11-12 02:12:42,064 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2023-11-12 02:12:42,065 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2023-11-12 02:12:42,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:12:42,065 INFO L130 BoogieDeclarations]: Found specification of procedure net_ratelimit [2023-11-12 02:12:42,065 INFO L138 BoogieDeclarations]: Found implementation of procedure net_ratelimit [2023-11-12 02:12:42,065 INFO L130 BoogieDeclarations]: Found specification of procedure SetSendByte [2023-11-12 02:12:42,065 INFO L138 BoogieDeclarations]: Found implementation of procedure SetSendByte [2023-11-12 02:12:42,065 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2023-11-12 02:12:42,066 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2023-11-12 02:12:42,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-12 02:12:42,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-12 02:12:42,066 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_lock_of_via_ircc_cb [2023-11-12 02:12:42,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_lock_of_via_ircc_cb [2023-11-12 02:12:42,066 INFO L130 BoogieDeclarations]: Found specification of procedure SetSendPreambleCount [2023-11-12 02:12:42,066 INFO L138 BoogieDeclarations]: Found implementation of procedure SetSendPreambleCount [2023-11-12 02:12:42,066 INFO L130 BoogieDeclarations]: Found specification of procedure InitCard [2023-11-12 02:12:42,067 INFO L138 BoogieDeclarations]: Found implementation of procedure InitCard [2023-11-12 02:12:42,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2023-11-12 02:12:42,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2023-11-12 02:12:42,067 INFO L130 BoogieDeclarations]: Found specification of procedure SetTimer [2023-11-12 02:12:42,067 INFO L138 BoogieDeclarations]: Found implementation of procedure SetTimer [2023-11-12 02:12:42,067 INFO L130 BoogieDeclarations]: Found specification of procedure ActClk [2023-11-12 02:12:42,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ActClk [2023-11-12 02:12:42,068 INFO L130 BoogieDeclarations]: Found specification of procedure request_dma [2023-11-12 02:12:42,068 INFO L138 BoogieDeclarations]: Found implementation of procedure request_dma [2023-11-12 02:12:42,068 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2023-11-12 02:12:42,068 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2023-11-12 02:12:42,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:12:42,068 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2023-11-12 02:12:42,068 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2023-11-12 02:12:42,068 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2023-11-12 02:12:42,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2023-11-12 02:12:42,069 INFO L130 BoogieDeclarations]: Found specification of procedure skb_copy_to_linear_data [2023-11-12 02:12:42,069 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_copy_to_linear_data [2023-11-12 02:12:42,759 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:12:42,773 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:12:43,073 INFO L770 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-12 02:12:48,298 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:12:48,326 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:12:48,326 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:12:48,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:12:48 BoogieIcfgContainer [2023-11-12 02:12:48,332 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:12:48,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:12:48,335 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:12:48,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:12:48,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:12:37" (1/3) ... [2023-11-12 02:12:48,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285cf369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:12:48, skipping insertion in model container [2023-11-12 02:12:48,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:41" (2/3) ... [2023-11-12 02:12:48,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285cf369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:12:48, skipping insertion in model container [2023-11-12 02:12:48,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:12:48" (3/3) ... [2023-11-12 02:12:48,343 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.14_linux-kernel-locking-spinlock_drivers-net-irda-via-ircc.cil.i [2023-11-12 02:12:48,363 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:12:48,364 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-12 02:12:48,490 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:12:48,499 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=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@206c17ad, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:12:48,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-12 02:12:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 2100 states, 1318 states have (on average 1.3141122913505312) internal successors, (1732), 1350 states have internal predecessors, (1732), 687 states have call successors, (687), 92 states have call predecessors, (687), 91 states have return successors, (684), 673 states have call predecessors, (684), 684 states have call successors, (684) [2023-11-12 02:12:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-12 02:12:48,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:48,530 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-11-12 02:12:48,530 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)] === [2023-11-12 02:12:48,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:48,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1141058057, now seen corresponding path program 1 times [2023-11-12 02:12:48,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:48,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028577836] [2023-11-12 02:12:48,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:48,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:49,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:12:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:49,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:12:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:49,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:12:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:49,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:12:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:49,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:12:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:49,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:12:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-12 02:12:49,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:49,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028577836] [2023-11-12 02:12:49,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028577836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:49,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:49,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:12:49,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605149291] [2023-11-12 02:12:49,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:49,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:12:49,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:49,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:12:49,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:12:49,738 INFO L87 Difference]: Start difference. First operand has 2100 states, 1318 states have (on average 1.3141122913505312) internal successors, (1732), 1350 states have internal predecessors, (1732), 687 states have call successors, (687), 92 states have call predecessors, (687), 91 states have return successors, (684), 673 states have call predecessors, (684), 684 states have call successors, (684) Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-12 02:12:50,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:50,252 INFO L93 Difference]: Finished difference Result 4171 states and 6253 transitions. [2023-11-12 02:12:50,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:12:50,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 51 [2023-11-12 02:12:50,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:50,288 INFO L225 Difference]: With dead ends: 4171 [2023-11-12 02:12:50,288 INFO L226 Difference]: Without dead ends: 2092 [2023-11-12 02:12:50,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:12:50,313 INFO L413 NwaCegarLoop]: 3082 mSDtfsCounter, 3056 mSDsluCounter, 6148 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3070 SdHoareTripleChecker+Valid, 9230 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:12:50,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3070 Valid, 9230 Invalid, 23 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:12:50,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2023-11-12 02:12:50,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 2092. [2023-11-12 02:12:50,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 1314 states have (on average 1.3028919330289193) internal successors, (1712), 1346 states have internal predecessors, (1712), 684 states have call successors, (684), 92 states have call predecessors, (684), 91 states have return successors, (681), 670 states have call predecessors, (681), 681 states have call successors, (681) [2023-11-12 02:12:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 3077 transitions. [2023-11-12 02:12:50,600 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 3077 transitions. Word has length 51 [2023-11-12 02:12:50,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:50,600 INFO L495 AbstractCegarLoop]: Abstraction has 2092 states and 3077 transitions. [2023-11-12 02:12:50,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-12 02:12:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 3077 transitions. [2023-11-12 02:12:50,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-12 02:12:50,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:50,605 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-12 02:12:50,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:12:50,606 INFO L420 AbstractCegarLoop]: === Iteration 2 === 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)] === [2023-11-12 02:12:50,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:50,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2042454588, now seen corresponding path program 1 times [2023-11-12 02:12:50,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:50,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534307618] [2023-11-12 02:12:50,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:50,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:12:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:12:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:12:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:12:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:12:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:12:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:12:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-12 02:12:51,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:51,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534307618] [2023-11-12 02:12:51,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534307618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:51,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:51,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:12:51,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989178188] [2023-11-12 02:12:51,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:51,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:12:51,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:51,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:12:51,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:12:51,238 INFO L87 Difference]: Start difference. First operand 2092 states and 3077 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-12 02:12:51,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:51,540 INFO L93 Difference]: Finished difference Result 2098 states and 3082 transitions. [2023-11-12 02:12:51,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:12:51,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 56 [2023-11-12 02:12:51,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:51,569 INFO L225 Difference]: With dead ends: 2098 [2023-11-12 02:12:51,569 INFO L226 Difference]: Without dead ends: 2096 [2023-11-12 02:12:51,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:12:51,574 INFO L413 NwaCegarLoop]: 3074 mSDtfsCounter, 3041 mSDsluCounter, 6126 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3053 SdHoareTripleChecker+Valid, 9200 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:12:51,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3053 Valid, 9200 Invalid, 23 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:12:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2023-11-12 02:12:51,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 2096. [2023-11-12 02:12:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2096 states, 1317 states have (on average 1.302201974183751) internal successors, (1715), 1349 states have internal predecessors, (1715), 684 states have call successors, (684), 93 states have call predecessors, (684), 92 states have return successors, (681), 670 states have call predecessors, (681), 681 states have call successors, (681) [2023-11-12 02:12:51,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 3080 transitions. [2023-11-12 02:12:51,837 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 3080 transitions. Word has length 56 [2023-11-12 02:12:51,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:51,838 INFO L495 AbstractCegarLoop]: Abstraction has 2096 states and 3080 transitions. [2023-11-12 02:12:51,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-12 02:12:51,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 3080 transitions. [2023-11-12 02:12:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-12 02:12:51,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:51,849 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2023-11-12 02:12:51,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:12:51,850 INFO L420 AbstractCegarLoop]: === Iteration 3 === 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)] === [2023-11-12 02:12:51,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:51,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1340759721, now seen corresponding path program 1 times [2023-11-12 02:12:51,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:51,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521681473] [2023-11-12 02:12:51,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:51,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:52,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:12:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:52,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:12:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:52,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:12:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:52,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:12:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:52,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:12:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:52,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:12:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:52,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:12:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:52,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-12 02:12:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-12 02:12:52,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:52,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521681473] [2023-11-12 02:12:52,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521681473] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:52,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:52,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:12:52,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913282300] [2023-11-12 02:12:52,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:52,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:12:52,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:52,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:12:52,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:12:52,436 INFO L87 Difference]: Start difference. First operand 2096 states and 3080 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-12 02:12:52,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:52,754 INFO L93 Difference]: Finished difference Result 2102 states and 3085 transitions. [2023-11-12 02:12:52,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:12:52,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2023-11-12 02:12:52,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:52,782 INFO L225 Difference]: With dead ends: 2102 [2023-11-12 02:12:52,782 INFO L226 Difference]: Without dead ends: 2100 [2023-11-12 02:12:52,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:12:52,793 INFO L413 NwaCegarLoop]: 3074 mSDtfsCounter, 3041 mSDsluCounter, 6126 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3052 SdHoareTripleChecker+Valid, 9200 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:12:52,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3052 Valid, 9200 Invalid, 23 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:12:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2023-11-12 02:12:53,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2023-11-12 02:12:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 1320 states have (on average 1.3015151515151515) internal successors, (1718), 1352 states have internal predecessors, (1718), 684 states have call successors, (684), 94 states have call predecessors, (684), 93 states have return successors, (681), 670 states have call predecessors, (681), 681 states have call successors, (681) [2023-11-12 02:12:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 3083 transitions. [2023-11-12 02:12:53,059 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 3083 transitions. Word has length 61 [2023-11-12 02:12:53,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:53,061 INFO L495 AbstractCegarLoop]: Abstraction has 2100 states and 3083 transitions. [2023-11-12 02:12:53,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-12 02:12:53,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 3083 transitions. [2023-11-12 02:12:53,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-12 02:12:53,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:53,068 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2023-11-12 02:12:53,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:12:53,068 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)] === [2023-11-12 02:12:53,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:53,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1332405221, now seen corresponding path program 1 times [2023-11-12 02:12:53,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:53,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440368859] [2023-11-12 02:12:53,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:53,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:53,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:12:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:53,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:12:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:53,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:12:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:53,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:12:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:53,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:12:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:53,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:12:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:53,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:12:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:53,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:12:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:53,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-12 02:12:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:53,598 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-12 02:12:53,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:53,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440368859] [2023-11-12 02:12:53,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440368859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:53,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:53,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:12:53,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242437032] [2023-11-12 02:12:53,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:53,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:12:53,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:53,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:12:53,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:12:53,602 INFO L87 Difference]: Start difference. First operand 2100 states and 3083 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-12 02:12:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:53,875 INFO L93 Difference]: Finished difference Result 2106 states and 3088 transitions. [2023-11-12 02:12:53,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:12:53,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 75 [2023-11-12 02:12:53,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:53,902 INFO L225 Difference]: With dead ends: 2106 [2023-11-12 02:12:53,903 INFO L226 Difference]: Without dead ends: 2104 [2023-11-12 02:12:53,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:12:53,908 INFO L413 NwaCegarLoop]: 3074 mSDtfsCounter, 3032 mSDsluCounter, 6126 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3042 SdHoareTripleChecker+Valid, 9200 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:12:53,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3042 Valid, 9200 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:12:53,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2023-11-12 02:12:54,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 2104. [2023-11-12 02:12:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2104 states, 1323 states have (on average 1.3008314436885866) internal successors, (1721), 1355 states have internal predecessors, (1721), 684 states have call successors, (684), 95 states have call predecessors, (684), 94 states have return successors, (681), 670 states have call predecessors, (681), 681 states have call successors, (681) [2023-11-12 02:12:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 2104 states and 3086 transitions. [2023-11-12 02:12:54,156 INFO L78 Accepts]: Start accepts. Automaton has 2104 states and 3086 transitions. Word has length 75 [2023-11-12 02:12:54,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:54,158 INFO L495 AbstractCegarLoop]: Abstraction has 2104 states and 3086 transitions. [2023-11-12 02:12:54,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-12 02:12:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2104 states and 3086 transitions. [2023-11-12 02:12:54,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-12 02:12:54,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:54,161 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 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] [2023-11-12 02:12:54,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:12:54,162 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)] === [2023-11-12 02:12:54,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1933444279, now seen corresponding path program 1 times [2023-11-12 02:12:54,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:54,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438413090] [2023-11-12 02:12:54,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:54,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:54,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:12:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:54,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:12:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:54,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:12:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:54,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:12:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:54,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:12:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:54,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:12:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:54,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:12:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:54,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-12 02:12:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:54,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:12:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:54,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:12:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:54,623 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-12 02:12:54,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:54,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438413090] [2023-11-12 02:12:54,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438413090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:54,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:54,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:12:54,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68827848] [2023-11-12 02:12:54,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:54,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:12:54,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:54,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:12:54,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:12:54,627 INFO L87 Difference]: Start difference. First operand 2104 states and 3086 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-12 02:12:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:54,913 INFO L93 Difference]: Finished difference Result 2110 states and 3091 transitions. [2023-11-12 02:12:54,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:12:54,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2023-11-12 02:12:54,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:54,936 INFO L225 Difference]: With dead ends: 2110 [2023-11-12 02:12:54,936 INFO L226 Difference]: Without dead ends: 2108 [2023-11-12 02:12:54,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:12:54,941 INFO L413 NwaCegarLoop]: 3074 mSDtfsCounter, 3041 mSDsluCounter, 6126 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3050 SdHoareTripleChecker+Valid, 9200 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:12:54,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3050 Valid, 9200 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:12:54,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2023-11-12 02:12:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 2108. [2023-11-12 02:12:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2108 states, 1326 states have (on average 1.3001508295625943) internal successors, (1724), 1358 states have internal predecessors, (1724), 684 states have call successors, (684), 96 states have call predecessors, (684), 95 states have return successors, (681), 670 states have call predecessors, (681), 681 states have call successors, (681) [2023-11-12 02:12:55,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 3089 transitions. [2023-11-12 02:12:55,187 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 3089 transitions. Word has length 71 [2023-11-12 02:12:55,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:55,187 INFO L495 AbstractCegarLoop]: Abstraction has 2108 states and 3089 transitions. [2023-11-12 02:12:55,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-12 02:12:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 3089 transitions. [2023-11-12 02:12:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-12 02:12:55,189 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:55,189 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 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] [2023-11-12 02:12:55,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:12:55,190 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)] === [2023-11-12 02:12:55,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:55,190 INFO L85 PathProgramCache]: Analyzing trace with hash -671815109, now seen corresponding path program 1 times [2023-11-12 02:12:55,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:55,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801085248] [2023-11-12 02:12:55,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:55,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:55,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:12:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:55,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:12:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:55,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:12:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:55,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:12:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:55,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:12:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:55,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:12:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:55,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:12:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:55,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:12:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:55,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-12 02:12:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:55,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:12:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:55,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:12:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-12 02:12:55,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:55,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801085248] [2023-11-12 02:12:55,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801085248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:55,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:55,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:12:55,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155527730] [2023-11-12 02:12:55,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:55,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:12:55,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:55,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:12:55,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:12:55,601 INFO L87 Difference]: Start difference. First operand 2108 states and 3089 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-12 02:12:55,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:55,911 INFO L93 Difference]: Finished difference Result 2114 states and 3094 transitions. [2023-11-12 02:12:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:12:55,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 85 [2023-11-12 02:12:55,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:55,933 INFO L225 Difference]: With dead ends: 2114 [2023-11-12 02:12:55,933 INFO L226 Difference]: Without dead ends: 2112 [2023-11-12 02:12:55,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:12:55,936 INFO L413 NwaCegarLoop]: 3074 mSDtfsCounter, 3032 mSDsluCounter, 6126 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3040 SdHoareTripleChecker+Valid, 9200 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:12:55,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3040 Valid, 9200 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:12:55,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2023-11-12 02:12:56,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 2112. [2023-11-12 02:12:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2112 states, 1329 states have (on average 1.2994732881866065) internal successors, (1727), 1361 states have internal predecessors, (1727), 684 states have call successors, (684), 97 states have call predecessors, (684), 96 states have return successors, (681), 670 states have call predecessors, (681), 681 states have call successors, (681) [2023-11-12 02:12:56,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 3092 transitions. [2023-11-12 02:12:56,244 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 3092 transitions. Word has length 85 [2023-11-12 02:12:56,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:56,244 INFO L495 AbstractCegarLoop]: Abstraction has 2112 states and 3092 transitions. [2023-11-12 02:12:56,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-12 02:12:56,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 3092 transitions. [2023-11-12 02:12:56,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-12 02:12:56,247 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:56,247 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 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] [2023-11-12 02:12:56,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:12:56,248 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)] === [2023-11-12 02:12:56,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:56,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1999110121, now seen corresponding path program 1 times [2023-11-12 02:12:56,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:56,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015503403] [2023-11-12 02:12:56,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:56,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:56,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:12:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:56,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:12:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:56,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:12:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:56,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:12:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:56,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:12:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:56,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:12:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:56,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:12:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:56,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-12 02:12:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:56,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:12:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:56,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:12:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:56,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:12:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:56,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:12:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-12 02:12:56,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:56,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015503403] [2023-11-12 02:12:56,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015503403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:56,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:56,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:12:56,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58435414] [2023-11-12 02:12:56,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:56,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:12:56,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:56,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:12:56,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:12:56,673 INFO L87 Difference]: Start difference. First operand 2112 states and 3092 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-12 02:12:56,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:56,958 INFO L93 Difference]: Finished difference Result 2118 states and 3097 transitions. [2023-11-12 02:12:56,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:12:56,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2023-11-12 02:12:56,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:56,979 INFO L225 Difference]: With dead ends: 2118 [2023-11-12 02:12:56,979 INFO L226 Difference]: Without dead ends: 2116 [2023-11-12 02:12:56,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:12:56,983 INFO L413 NwaCegarLoop]: 3074 mSDtfsCounter, 3041 mSDsluCounter, 6126 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3048 SdHoareTripleChecker+Valid, 9200 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:12:56,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3048 Valid, 9200 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:12:56,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2023-11-12 02:12:57,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 2116. [2023-11-12 02:12:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 1332 states have (on average 1.2987987987987988) internal successors, (1730), 1364 states have internal predecessors, (1730), 684 states have call successors, (684), 98 states have call predecessors, (684), 97 states have return successors, (681), 670 states have call predecessors, (681), 681 states have call successors, (681) [2023-11-12 02:12:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 3095 transitions. [2023-11-12 02:12:57,244 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 3095 transitions. Word has length 81 [2023-11-12 02:12:57,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:57,245 INFO L495 AbstractCegarLoop]: Abstraction has 2116 states and 3095 transitions. [2023-11-12 02:12:57,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-12 02:12:57,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 3095 transitions. [2023-11-12 02:12:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-12 02:12:57,247 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:57,247 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 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] [2023-11-12 02:12:57,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:12:57,248 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)] === [2023-11-12 02:12:57,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:57,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1534279771, now seen corresponding path program 1 times [2023-11-12 02:12:57,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:57,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084773358] [2023-11-12 02:12:57,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:57,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:57,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:12:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:57,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:12:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:57,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:12:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:57,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:12:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:57,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:12:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:57,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:12:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:57,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:12:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:57,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:12:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:57,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-12 02:12:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:57,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:12:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:57,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:12:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:57,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-12 02:12:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:57,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:12:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-11-12 02:12:57,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:57,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084773358] [2023-11-12 02:12:57,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084773358] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:57,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:57,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:12:57,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175107040] [2023-11-12 02:12:57,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:57,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:12:57,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:57,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:12:57,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:12:57,724 INFO L87 Difference]: Start difference. First operand 2116 states and 3095 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-12 02:12:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:58,034 INFO L93 Difference]: Finished difference Result 2122 states and 3100 transitions. [2023-11-12 02:12:58,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:12:58,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 95 [2023-11-12 02:12:58,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:58,056 INFO L225 Difference]: With dead ends: 2122 [2023-11-12 02:12:58,056 INFO L226 Difference]: Without dead ends: 2120 [2023-11-12 02:12:58,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:12:58,061 INFO L413 NwaCegarLoop]: 3074 mSDtfsCounter, 3032 mSDsluCounter, 6126 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3038 SdHoareTripleChecker+Valid, 9200 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:12:58,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3038 Valid, 9200 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:12:58,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2023-11-12 02:12:58,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 2120. [2023-11-12 02:12:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2120 states, 1335 states have (on average 1.29812734082397) internal successors, (1733), 1367 states have internal predecessors, (1733), 684 states have call successors, (684), 99 states have call predecessors, (684), 98 states have return successors, (681), 670 states have call predecessors, (681), 681 states have call successors, (681) [2023-11-12 02:12:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3098 transitions. [2023-11-12 02:12:58,347 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3098 transitions. Word has length 95 [2023-11-12 02:12:58,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:58,347 INFO L495 AbstractCegarLoop]: Abstraction has 2120 states and 3098 transitions. [2023-11-12 02:12:58,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-12 02:12:58,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3098 transitions. [2023-11-12 02:12:58,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-12 02:12:58,350 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:58,351 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 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] [2023-11-12 02:12:58,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:12:58,351 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)] === [2023-11-12 02:12:58,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:58,352 INFO L85 PathProgramCache]: Analyzing trace with hash -566596471, now seen corresponding path program 1 times [2023-11-12 02:12:58,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:58,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157288477] [2023-11-12 02:12:58,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:58,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:58,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:12:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:58,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:12:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:58,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:12:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:58,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:12:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:58,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:12:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:58,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:12:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:58,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:12:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:58,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-12 02:12:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:58,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:12:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:58,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:12:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:58,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:12:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:58,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:12:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:58,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:12:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:58,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:12:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-11-12 02:12:58,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:58,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157288477] [2023-11-12 02:12:58,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157288477] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:58,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:58,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:12:58,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259744089] [2023-11-12 02:12:58,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:58,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:12:58,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:58,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:12:58,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:12:58,796 INFO L87 Difference]: Start difference. First operand 2120 states and 3098 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-12 02:12:59,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:59,245 INFO L93 Difference]: Finished difference Result 2855 states and 4197 transitions. [2023-11-12 02:12:59,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:12:59,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (16), 3 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 91 [2023-11-12 02:12:59,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:59,280 INFO L225 Difference]: With dead ends: 2855 [2023-11-12 02:12:59,280 INFO L226 Difference]: Without dead ends: 2853 [2023-11-12 02:12:59,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:12:59,285 INFO L413 NwaCegarLoop]: 4018 mSDtfsCounter, 2219 mSDsluCounter, 9922 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2224 SdHoareTripleChecker+Valid, 13940 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:12:59,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2224 Valid, 13940 Invalid, 37 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:12:59,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2023-11-12 02:12:59,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 2853. [2023-11-12 02:12:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 1769 states have (on average 1.3035613340870549) internal successors, (2306), 1806 states have internal predecessors, (2306), 946 states have call successors, (946), 136 states have call predecessors, (946), 135 states have return successors, (943), 930 states have call predecessors, (943), 943 states have call successors, (943) [2023-11-12 02:12:59,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4195 transitions. [2023-11-12 02:12:59,709 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4195 transitions. Word has length 91 [2023-11-12 02:12:59,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:59,710 INFO L495 AbstractCegarLoop]: Abstraction has 2853 states and 4195 transitions. [2023-11-12 02:12:59,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-12 02:12:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4195 transitions. [2023-11-12 02:12:59,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-12 02:12:59,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:59,712 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 3, 3, 3, 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] [2023-11-12 02:12:59,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:12:59,712 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)] === [2023-11-12 02:12:59,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:59,713 INFO L85 PathProgramCache]: Analyzing trace with hash 832153924, now seen corresponding path program 1 times [2023-11-12 02:12:59,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:59,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463726711] [2023-11-12 02:12:59,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:59,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:13:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:13:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:13:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:13:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:13:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:13:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:13:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-12 02:13:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:13:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:13:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:13:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:13:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:13:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:13:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:13:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-11-12 02:13:00,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:00,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463726711] [2023-11-12 02:13:00,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463726711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:00,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:00,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:13:00,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066825978] [2023-11-12 02:13:00,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:00,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:13:00,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:00,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:13:00,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:13:00,254 INFO L87 Difference]: Start difference. First operand 2853 states and 4195 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-12 02:13:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:13:00,738 INFO L93 Difference]: Finished difference Result 2859 states and 4200 transitions. [2023-11-12 02:13:00,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:13:00,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (17), 3 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 96 [2023-11-12 02:13:00,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:13:00,775 INFO L225 Difference]: With dead ends: 2859 [2023-11-12 02:13:00,775 INFO L226 Difference]: Without dead ends: 2857 [2023-11-12 02:13:00,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:13:00,779 INFO L413 NwaCegarLoop]: 3074 mSDtfsCounter, 3041 mSDsluCounter, 6126 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3045 SdHoareTripleChecker+Valid, 9200 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:13:00,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3045 Valid, 9200 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:13:00,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2023-11-12 02:13:01,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2857. [2023-11-12 02:13:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2857 states, 1772 states have (on average 1.3030474040632054) internal successors, (2309), 1809 states have internal predecessors, (2309), 946 states have call successors, (946), 137 states have call predecessors, (946), 136 states have return successors, (943), 930 states have call predecessors, (943), 943 states have call successors, (943) [2023-11-12 02:13:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 4198 transitions. [2023-11-12 02:13:01,296 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 4198 transitions. Word has length 96 [2023-11-12 02:13:01,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:13:01,297 INFO L495 AbstractCegarLoop]: Abstraction has 2857 states and 4198 transitions. [2023-11-12 02:13:01,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-12 02:13:01,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 4198 transitions. [2023-11-12 02:13:01,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-12 02:13:01,299 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:13:01,299 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 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] [2023-11-12 02:13:01,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:13:01,299 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-12 02:13:01,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:01,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1013497559, now seen corresponding path program 1 times [2023-11-12 02:13:01,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:01,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402209025] [2023-11-12 02:13:01,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:01,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:01,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:13:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:01,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:13:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:01,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:13:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:01,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:13:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:01,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:13:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:01,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:13:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:01,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:13:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:01,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-12 02:13:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:01,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:13:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:01,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:13:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:01,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:13:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:01,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:13:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:01,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:13:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:01,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:13:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:01,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:13:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:01,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:13:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2023-11-12 02:13:01,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:01,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402209025] [2023-11-12 02:13:01,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402209025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:01,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:01,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:13:01,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561441798] [2023-11-12 02:13:01,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:01,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:13:01,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:01,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:13:01,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:13:01,729 INFO L87 Difference]: Start difference. First operand 2857 states and 4198 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-12 02:13:02,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:13:02,178 INFO L93 Difference]: Finished difference Result 2863 states and 4203 transitions. [2023-11-12 02:13:02,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:13:02,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (18), 3 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 101 [2023-11-12 02:13:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:13:02,203 INFO L225 Difference]: With dead ends: 2863 [2023-11-12 02:13:02,203 INFO L226 Difference]: Without dead ends: 2861 [2023-11-12 02:13:02,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:13:02,206 INFO L413 NwaCegarLoop]: 3074 mSDtfsCounter, 3041 mSDsluCounter, 6126 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3044 SdHoareTripleChecker+Valid, 9200 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:13:02,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3044 Valid, 9200 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:13:02,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2023-11-12 02:13:02,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 2861. [2023-11-12 02:13:02,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 1775 states have (on average 1.3025352112676056) internal successors, (2312), 1812 states have internal predecessors, (2312), 946 states have call successors, (946), 138 states have call predecessors, (946), 137 states have return successors, (943), 930 states have call predecessors, (943), 943 states have call successors, (943) [2023-11-12 02:13:02,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 4201 transitions. [2023-11-12 02:13:02,602 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 4201 transitions. Word has length 101 [2023-11-12 02:13:02,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:13:02,603 INFO L495 AbstractCegarLoop]: Abstraction has 2861 states and 4201 transitions. [2023-11-12 02:13:02,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-12 02:13:02,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 4201 transitions. [2023-11-12 02:13:02,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-12 02:13:02,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:13:02,605 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 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] [2023-11-12 02:13:02,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:13:02,606 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)] === [2023-11-12 02:13:02,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:02,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1629717659, now seen corresponding path program 1 times [2023-11-12 02:13:02,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:02,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059227642] [2023-11-12 02:13:02,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:02,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:02,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:13:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:02,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:13:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:02,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:13:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:02,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:13:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:02,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:13:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:02,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:13:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:02,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:13:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:02,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:13:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:02,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-12 02:13:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:02,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:13:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:02,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:13:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:02,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-12 02:13:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:02,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:13:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:03,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-12 02:13:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:03,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-12 02:13:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:03,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:13:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:03,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-12 02:13:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-11-12 02:13:03,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:03,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059227642] [2023-11-12 02:13:03,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059227642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:03,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:03,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:13:03,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101897004] [2023-11-12 02:13:03,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:03,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:13:03,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:03,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:13:03,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:13:03,032 INFO L87 Difference]: Start difference. First operand 2861 states and 4201 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-12 02:13:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:13:03,470 INFO L93 Difference]: Finished difference Result 2867 states and 4206 transitions. [2023-11-12 02:13:03,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:13:03,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 115 [2023-11-12 02:13:03,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:13:03,501 INFO L225 Difference]: With dead ends: 2867 [2023-11-12 02:13:03,502 INFO L226 Difference]: Without dead ends: 2865 [2023-11-12 02:13:03,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:13:03,506 INFO L413 NwaCegarLoop]: 3074 mSDtfsCounter, 3032 mSDsluCounter, 6126 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3034 SdHoareTripleChecker+Valid, 9200 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:13:03,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3034 Valid, 9200 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:13:03,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2023-11-12 02:13:03,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2865. [2023-11-12 02:13:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2865 states, 1778 states have (on average 1.3020247469066366) internal successors, (2315), 1815 states have internal predecessors, (2315), 946 states have call successors, (946), 139 states have call predecessors, (946), 138 states have return successors, (943), 930 states have call predecessors, (943), 943 states have call successors, (943) [2023-11-12 02:13:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4204 transitions. [2023-11-12 02:13:03,896 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4204 transitions. Word has length 115 [2023-11-12 02:13:03,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:13:03,897 INFO L495 AbstractCegarLoop]: Abstraction has 2865 states and 4204 transitions. [2023-11-12 02:13:03,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-12 02:13:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4204 transitions. [2023-11-12 02:13:03,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-12 02:13:03,899 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:13:03,899 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 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] [2023-11-12 02:13:03,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:13:03,900 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_locked_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-12 02:13:03,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:03,900 INFO L85 PathProgramCache]: Analyzing trace with hash 995917257, now seen corresponding path program 1 times [2023-11-12 02:13:03,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:03,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197480201] [2023-11-12 02:13:03,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:03,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:13:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:13:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:13:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:13:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:13:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:13:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:13:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-12 02:13:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-12 02:13:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-12 02:13:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:13:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:13:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:13:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:13:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-12 02:13:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:13:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-12 02:13:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-12 02:13:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2023-11-12 02:13:04,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:04,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197480201] [2023-11-12 02:13:04,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197480201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:04,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:04,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:13:04,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008266590] [2023-11-12 02:13:04,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:04,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:13:04,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:04,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:13:04,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:13:04,333 INFO L87 Difference]: Start difference. First operand 2865 states and 4204 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-12 02:13:04,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:13:04,799 INFO L93 Difference]: Finished difference Result 2871 states and 4209 transitions. [2023-11-12 02:13:04,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:13:04,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (20), 3 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 111 [2023-11-12 02:13:04,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:13:04,817 INFO L225 Difference]: With dead ends: 2871 [2023-11-12 02:13:04,817 INFO L226 Difference]: Without dead ends: 2867 [2023-11-12 02:13:04,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:13:04,822 INFO L413 NwaCegarLoop]: 3074 mSDtfsCounter, 3041 mSDsluCounter, 6126 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3042 SdHoareTripleChecker+Valid, 9200 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:13:04,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3042 Valid, 9200 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:13:04,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2023-11-12 02:13:05,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 2867. [2023-11-12 02:13:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2867 states, 1780 states have (on average 1.301123595505618) internal successors, (2316), 1816 states have internal predecessors, (2316), 946 states have call successors, (946), 140 states have call predecessors, (946), 138 states have return successors, (943), 930 states have call predecessors, (943), 943 states have call successors, (943) [2023-11-12 02:13:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2867 states to 2867 states and 4205 transitions. [2023-11-12 02:13:05,216 INFO L78 Accepts]: Start accepts. Automaton has 2867 states and 4205 transitions. Word has length 111 [2023-11-12 02:13:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:13:05,216 INFO L495 AbstractCegarLoop]: Abstraction has 2867 states and 4205 transitions. [2023-11-12 02:13:05,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-12 02:13:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2867 states and 4205 transitions. [2023-11-12 02:13:05,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-12 02:13:05,219 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:13:05,219 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 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] [2023-11-12 02:13:05,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:13:05,220 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)] === [2023-11-12 02:13:05,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:05,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1816038725, now seen corresponding path program 1 times [2023-11-12 02:13:05,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:05,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902029641] [2023-11-12 02:13:05,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:05,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:13:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:13:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:13:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:13:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:13:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:13:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:13:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:13:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-12 02:13:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:13:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-12 02:13:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-12 02:13:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:13:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-12 02:13:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-12 02:13:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:13:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-12 02:13:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-12 02:13:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:13:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:05,678 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2023-11-12 02:13:05,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:05,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902029641] [2023-11-12 02:13:05,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902029641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:05,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:05,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:13:05,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376263820] [2023-11-12 02:13:05,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:05,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:13:05,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:05,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:13:05,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:13:05,682 INFO L87 Difference]: Start difference. First operand 2867 states and 4205 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-12 02:13:06,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:13:06,333 INFO L93 Difference]: Finished difference Result 2867 states and 4205 transitions. [2023-11-12 02:13:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:13:06,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (21), 3 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 125 [2023-11-12 02:13:06,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:13:06,355 INFO L225 Difference]: With dead ends: 2867 [2023-11-12 02:13:06,356 INFO L226 Difference]: Without dead ends: 2762 [2023-11-12 02:13:06,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:13:06,361 INFO L413 NwaCegarLoop]: 3072 mSDtfsCounter, 3028 mSDsluCounter, 6125 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3028 SdHoareTripleChecker+Valid, 9197 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:13:06,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3028 Valid, 9197 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:13:06,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2023-11-12 02:13:06,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2762. [2023-11-12 02:13:06,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2762 states, 1714 states have (on average 1.3098016336056009) internal successors, (2245), 1748 states have internal predecessors, (2245), 921 states have call successors, (921), 125 states have call predecessors, (921), 125 states have return successors, (921), 908 states have call predecessors, (921), 921 states have call successors, (921) [2023-11-12 02:13:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 4087 transitions. [2023-11-12 02:13:06,796 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 4087 transitions. Word has length 125 [2023-11-12 02:13:06,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:13:06,796 INFO L495 AbstractCegarLoop]: Abstraction has 2762 states and 4087 transitions. [2023-11-12 02:13:06,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-12 02:13:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 4087 transitions. [2023-11-12 02:13:06,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-11-12 02:13:06,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:13:06,806 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2023-11-12 02:13:06,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:13:06,807 INFO L420 AbstractCegarLoop]: === Iteration 15 === 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)] === [2023-11-12 02:13:06,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:13:06,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1400854272, now seen corresponding path program 1 times [2023-11-12 02:13:06,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:13:06,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692507391] [2023-11-12 02:13:06,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:13:06,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:13:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:13:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:13:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-12 02:13:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:13:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:13:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:13:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-12 02:13:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:13:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:13:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:13:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:13:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:13:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:13:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:13:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-12 02:13:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-12 02:13:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-12 02:13:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:13:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-12 02:13:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-12 02:13:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-12 02:13:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:07,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-12 02:13:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:13:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:13:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-12 02:13:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:13:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:13:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-11-12 02:13:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-11-12 02:13:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-11-12 02:13:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-12 02:13:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-12 02:13:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-12 02:13:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:13:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-11-12 02:13:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:13:08,102 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2023-11-12 02:13:08,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:13:08,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692507391] [2023-11-12 02:13:08,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692507391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:13:08,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:13:08,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:13:08,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697254094] [2023-11-12 02:13:08,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:13:08,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:13:08,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:13:08,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:13:08,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:13:08,106 INFO L87 Difference]: Start difference. First operand 2762 states and 4087 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-12 02:13:12,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-12 02:13:13,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []