./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c --full-output --preprocessor.use.memory.slicer false --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 35f93fcf0553b803fc65353b86dc813b9233afa8b90d2b549dfbdaa7cee26a59 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 21:24:35,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:24:35,305 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-22 21:24:35,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:24:35,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:24:35,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:24:35,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:24:35,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:24:35,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:24:35,338 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:24:35,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:24:35,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:24:35,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:24:35,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:24:35,340 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:24:35,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:24:35,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:24:35,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 21:24:35,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:24:35,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:24:35,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:24:35,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:24:35,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:24:35,343 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:24:35,344 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:24:35,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:24:35,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:24:35,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:24:35,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:24:35,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:24:35,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:24:35,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:24:35,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 21:24:35,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 21:24:35,346 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:24:35,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:24:35,347 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:24:35,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:24:35,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:24:35,348 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 35f93fcf0553b803fc65353b86dc813b9233afa8b90d2b549dfbdaa7cee26a59 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 21:24:35,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:24:35,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:24:35,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:24:35,598 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:24:35,598 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:24:35,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c [2023-11-22 21:24:36,734 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:24:37,337 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:24:37,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c [2023-11-22 21:24:37,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/757aafccf/19a1996d78ee489498f574ab5dc564d5/FLAGe921d86a8 [2023-11-22 21:24:37,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/757aafccf/19a1996d78ee489498f574ab5dc564d5 [2023-11-22 21:24:37,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:24:37,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:24:37,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:24:37,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:24:37,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:24:37,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:24:37" (1/1) ... [2023-11-22 21:24:37,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1af11c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:37, skipping insertion in model container [2023-11-22 21:24:37,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:24:37" (1/1) ... [2023-11-22 21:24:37,583 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:24:40,933 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[483203,483216] [2023-11-22 21:24:40,940 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[483777,483790] [2023-11-22 21:24:40,943 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[484976,484989] [2023-11-22 21:24:40,945 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[485684,485697] [2023-11-22 21:24:40,947 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[486125,486138] [2023-11-22 21:24:40,949 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[486357,486370] [2023-11-22 21:24:40,952 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[486935,486948] [2023-11-22 21:24:40,955 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[487525,487538] [2023-11-22 21:24:40,958 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[487942,487955] [2023-11-22 21:24:40,960 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[488339,488352] [2023-11-22 21:24:40,963 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[488574,488587] [2023-11-22 21:24:40,966 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[489322,489335] [2023-11-22 21:24:40,969 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[489743,489756] [2023-11-22 21:24:40,972 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[490370,490383] [2023-11-22 21:24:40,974 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[490785,490798] [2023-11-22 21:24:40,977 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[491429,491442] [2023-11-22 21:24:40,980 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[492159,492172] [2023-11-22 21:24:40,983 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[492995,493008] [2023-11-22 21:24:40,986 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[494341,494354] [2023-11-22 21:24:40,989 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[494739,494752] [2023-11-22 21:24:40,991 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[495296,495309] [2023-11-22 21:24:40,993 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[495679,495692] [2023-11-22 21:24:40,995 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[496295,496308] [2023-11-22 21:24:40,997 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[496869,496882] [2023-11-22 21:24:41,000 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[497782,497795] [2023-11-22 21:24:41,003 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[498173,498186] [2023-11-22 21:24:41,005 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[498402,498415] [2023-11-22 21:24:41,008 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[498808,498821] [2023-11-22 21:24:41,011 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[499665,499678] [2023-11-22 21:24:41,013 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[500072,500085] [2023-11-22 21:24:41,013 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:24:41,044 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:24:41,158 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"); [7342] [2023-11-22 21:24:41,160 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)); [7351] [2023-11-22 21:24:41,160 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("":); [7360] [2023-11-22 21:24:41,162 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 *)"./arch/x86/include/asm/paravirt.h"), "i" (804), "i" (12UL)); [7416-7417] [2023-11-22 21:24:41,162 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"); [7423-7425] [2023-11-22 21:24:41,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("movl %1,%0": "=r" (ret): "m" (*((unsigned int volatile *)addr)): "memory"); [7523] [2023-11-22 21:24:41,165 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("movl %0,%1": : "r" (val), "m" (*((unsigned int volatile *)addr)): "memory"); [7532] [2023-11-22 21:24:41,173 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 *)"include/asm-generic/dma-mapping-common.h"), "i" (19), "i" (12UL)); [7666-7667] [2023-11-22 21:24:41,175 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 *)"include/asm-generic/dma-mapping-common.h"), "i" (36), "i" (12UL)); [7702-7703] [2023-11-22 21:24:41,175 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 *)"include/asm-generic/dma-mapping-common.h"), "i" (103), "i" (12UL)); [7742-7743] [2023-11-22 21:24:41,176 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 *)"include/asm-generic/dma-mapping-common.h"), "i" (115), "i" (12UL)); [7782-7783] [2023-11-22 21:24:41,201 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [8255] [2023-11-22 21:24:41,438 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [10174] [2023-11-22 21:24:41,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [10177] [2023-11-22 21:24:41,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [10180] [2023-11-22 21:24:41,439 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [10183] [2023-11-22 21:24:41,440 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [10186] [2023-11-22 21:24:41,441 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((int *)arg): "ebx"); [10225-10226] [2023-11-22 21:24:41,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((int *)arg): "ebx"); [10229-10230] [2023-11-22 21:24:41,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((int *)arg): "ebx"); [10233-10234] [2023-11-22 21:24:41,446 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((int *)arg): "ebx"); [10237-10238] [2023-11-22 21:24:41,446 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" ((int *)arg): "ebx"); [10241-10242] [2023-11-22 21:24:41,446 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((int *)arg): "ebx"); [10276-10277] [2023-11-22 21:24:41,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((int *)arg): "ebx"); [10280-10281] [2023-11-22 21:24:41,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((int *)arg): "ebx"); [10284-10285] [2023-11-22 21:24:41,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((int *)arg): "ebx"); [10288-10289] [2023-11-22 21:24:41,448 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" ((int *)arg): "ebx"); [10292-10293] [2023-11-22 21:24:41,638 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[483203,483216] [2023-11-22 21:24:41,639 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[483777,483790] [2023-11-22 21:24:41,639 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[484976,484989] [2023-11-22 21:24:41,640 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[485684,485697] [2023-11-22 21:24:41,640 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[486125,486138] [2023-11-22 21:24:41,641 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[486357,486370] [2023-11-22 21:24:41,642 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[486935,486948] [2023-11-22 21:24:41,642 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[487525,487538] [2023-11-22 21:24:41,643 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[487942,487955] [2023-11-22 21:24:41,643 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[488339,488352] [2023-11-22 21:24:41,644 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[488574,488587] [2023-11-22 21:24:41,645 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[489322,489335] [2023-11-22 21:24:41,646 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[489743,489756] [2023-11-22 21:24:41,646 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[490370,490383] [2023-11-22 21:24:41,646 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[490785,490798] [2023-11-22 21:24:41,647 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[491429,491442] [2023-11-22 21:24:41,647 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[492159,492172] [2023-11-22 21:24:41,648 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[492995,493008] [2023-11-22 21:24:41,648 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[494341,494354] [2023-11-22 21:24:41,649 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[494739,494752] [2023-11-22 21:24:41,650 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[495296,495309] [2023-11-22 21:24:41,650 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[495679,495692] [2023-11-22 21:24:41,650 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[496295,496308] [2023-11-22 21:24:41,651 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[496869,496882] [2023-11-22 21:24:41,652 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[497782,497795] [2023-11-22 21:24:41,652 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[498173,498186] [2023-11-22 21:24:41,652 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[498402,498415] [2023-11-22 21:24:41,653 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[498808,498821] [2023-11-22 21:24:41,655 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[499665,499678] [2023-11-22 21:24:41,655 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-multiproperty/linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c[500072,500085] [2023-11-22 21:24:41,656 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:24:41,889 WARN L675 CHandler]: The function debug_dma_sync_single_for_device is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,890 WARN L675 CHandler]: The function atm_charge is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,890 WARN L675 CHandler]: The function debug_dma_alloc_coherent is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,890 WARN L675 CHandler]: The function kfree is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,890 WARN L675 CHandler]: The function __raw_spin_lock_init is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,890 WARN L675 CHandler]: The function free_irq is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,891 WARN L675 CHandler]: The function debug_dma_map_page is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,891 WARN L675 CHandler]: The function might_fault is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,891 WARN L675 CHandler]: The function tasklet_init is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,891 WARN L675 CHandler]: The function printk is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,891 WARN L675 CHandler]: The function warn_slowpath_null is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,891 WARN L675 CHandler]: The function dma_set_mask is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,892 WARN L675 CHandler]: The function capable is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,892 WARN L675 CHandler]: The function pci_enable_device is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,892 WARN L675 CHandler]: The function __const_udelay is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,892 WARN L675 CHandler]: The function ldv_pre_probe is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,893 WARN L675 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,894 WARN L675 CHandler]: The function skb_put is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,894 WARN L675 CHandler]: The function __pci_register_driver is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,894 WARN L675 CHandler]: The function pci_disable_device is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,894 WARN L675 CHandler]: The function msecs_to_jiffies is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,894 WARN L675 CHandler]: The function pci_unregister_driver is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,895 WARN L675 CHandler]: The function __mutex_init is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,895 WARN L675 CHandler]: The function _copy_to_user is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,895 WARN L675 CHandler]: The function request_firmware is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,895 WARN L675 CHandler]: The function pci_set_master is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,896 WARN L675 CHandler]: The function _raw_spin_unlock_irqrestore is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,896 WARN L675 CHandler]: The function __copy_to_user_overflow is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,896 WARN L675 CHandler]: The function __phys_addr is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,896 WARN L675 CHandler]: The function ldv_after_alloc is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,897 WARN L675 CHandler]: The function ldv_assert is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,897 WARN L675 CHandler]: The function debug_dma_sync_single_for_cpu is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,897 WARN L675 CHandler]: The function __ldv_linux_kernel_locking_spinlock_spin_lock is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,897 WARN L675 CHandler]: The function atm_dev_register is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,897 WARN L675 CHandler]: The function release_firmware is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,897 WARN L675 CHandler]: The function dma_supported is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,898 WARN L675 CHandler]: The function __tasklet_schedule is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,898 WARN L675 CHandler]: The function pci_bus_write_config_byte is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,898 WARN L675 CHandler]: The function panic is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,898 WARN L675 CHandler]: The function debug_dma_free_coherent is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,899 WARN L675 CHandler]: The function pci_bus_read_config_byte is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,899 WARN L675 CHandler]: The function ktime_get_with_offset is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,899 WARN L675 CHandler]: The function __dev_kfree_skb_any is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,899 WARN L675 CHandler]: The function request_threaded_irq is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,899 WARN L675 CHandler]: The function debug_dma_unmap_page is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,899 WARN L675 CHandler]: The function atm_dev_deregister is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 21:24:41,906 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:24:41,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:41 WrapperNode [2023-11-22 21:24:41,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:24:41,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:24:41,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:24:41,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:24:41,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:41" (1/1) ... [2023-11-22 21:24:42,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:41" (1/1) ... [2023-11-22 21:24:42,203 INFO L138 Inliner]: procedures = 699, calls = 2855, calls flagged for inlining = 266, calls inlined = 176, statements flattened = 6101 [2023-11-22 21:24:42,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:24:42,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:24:42,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:24:42,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:24:42,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:41" (1/1) ... [2023-11-22 21:24:42,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:41" (1/1) ... [2023-11-22 21:24:42,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:41" (1/1) ... [2023-11-22 21:24:42,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:41" (1/1) ... [2023-11-22 21:24:42,396 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:41" (1/1) ... [2023-11-22 21:24:42,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:41" (1/1) ... [2023-11-22 21:24:42,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:41" (1/1) ... [2023-11-22 21:24:42,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:41" (1/1) ... [2023-11-22 21:24:42,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:24:42,526 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:24:42,526 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:24:42,526 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:24:42,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:41" (1/1) ... [2023-11-22 21:24:42,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:24:42,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:24:42,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 21:24:42,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 21:24:42,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_io_instance_callback_2_25 [2023-11-22 21:24:42,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_io_instance_callback_2_25 [2023-11-22 21:24:42,605 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_supply [2023-11-22 21:24:42,605 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_supply [2023-11-22 21:24:42,605 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_device [2023-11-22 21:24:42,605 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_device [2023-11-22 21:24:42,605 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2023-11-22 21:24:42,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~u32~0~X~$Pointer$~TO~VOID [2023-11-22 21:24:42,606 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2023-11-22 21:24:42,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2023-11-22 21:24:42,606 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_register [2023-11-22 21:24:42,606 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_register [2023-11-22 21:24:42,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-22 21:24:42,607 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-22 21:24:42,607 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_unmap [2023-11-22 21:24:42,608 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_unmap [2023-11-22 21:24:42,608 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_net_sock [2023-11-22 21:24:42,608 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_net_sock [2023-11-22 21:24:42,608 INFO L130 BoogieDeclarations]: Found specification of procedure panic [2023-11-22 21:24:42,609 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-22 21:24:42,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-22 21:24:42,611 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_read [2023-11-22 21:24:42,611 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_read [2023-11-22 21:24:42,612 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2023-11-22 21:24:42,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2023-11-22 21:24:42,612 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2023-11-22 21:24:42,613 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_activate_vcin [2023-11-22 21:24:42,613 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_activate_vcin [2023-11-22 21:24:42,613 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_remove_one [2023-11-22 21:24:42,613 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_remove_one [2023-11-22 21:24:42,613 INFO L130 BoogieDeclarations]: Found specification of procedure dma_set_mask [2023-11-22 21:24:42,618 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_io_poll [2023-11-22 21:24:42,619 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_io_poll [2023-11-22 21:24:42,619 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2023-11-22 21:24:42,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2023-11-22 21:24:42,619 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_arch_io [2023-11-22 21:24:42,619 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_arch_io [2023-11-22 21:24:42,619 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2023-11-22 21:24:42,619 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2023-11-22 21:24:42,620 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2023-11-22 21:24:42,620 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2023-11-22 21:24:42,620 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2023-11-22 21:24:42,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2023-11-22 21:24:42,620 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2023-11-22 21:24:42,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2023-11-22 21:24:42,620 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-22 21:24:42,621 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2023-11-22 21:24:42,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2023-11-22 21:24:42,621 INFO L130 BoogieDeclarations]: Found specification of procedure dma_supported [2023-11-22 21:24:42,621 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_check [2023-11-22 21:24:42,621 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_check [2023-11-22 21:24:42,621 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_getstats [2023-11-22 21:24:42,621 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_getstats [2023-11-22 21:24:42,621 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2023-11-22 21:24:42,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2023-11-22 21:24:42,622 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2023-11-22 21:24:42,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2023-11-22 21:24:42,622 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_alloc_irq [2023-11-22 21:24:42,622 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_alloc_irq [2023-11-22 21:24:42,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 21:24:42,623 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_kernel_rcu_update_lock [2023-11-22 21:24:42,623 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_kernel_rcu_update_lock [2023-11-22 21:24:42,623 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_init [2023-11-22 21:24:42,623 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2023-11-22 21:24:42,623 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_shutdown [2023-11-22 21:24:42,624 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_shutdown [2023-11-22 21:24:42,624 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_detect [2023-11-22 21:24:42,624 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_detect [2023-11-22 21:24:42,624 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2023-11-22 21:24:42,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2023-11-22 21:24:42,624 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_free_coherent [2023-11-22 21:24:42,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2023-11-22 21:24:42,625 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2023-11-22 21:24:42,625 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2023-11-22 21:24:42,625 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2023-11-22 21:24:42,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-11-22 21:24:42,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2023-11-22 21:24:42,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2023-11-22 21:24:42,625 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2023-11-22 21:24:42,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~~u32~0 [2023-11-22 21:24:42,626 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_map [2023-11-22 21:24:42,626 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_map [2023-11-22 21:24:42,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2023-11-22 21:24:42,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2023-11-22 21:24:42,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-22 21:24:42,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2023-11-22 21:24:42,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2023-11-22 21:24:42,626 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2023-11-22 21:24:42,627 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2023-11-22 21:24:42,627 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_block_queue [2023-11-22 21:24:42,627 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_block_queue [2023-11-22 21:24:42,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2023-11-22 21:24:42,627 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2023-11-22 21:24:42,627 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_proc_read [2023-11-22 21:24:42,627 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_proc_read [2023-11-22 21:24:42,627 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2023-11-22 21:24:42,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2023-11-22 21:24:42,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2023-11-22 21:24:42,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2023-11-22 21:24:42,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2023-11-22 21:24:42,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2023-11-22 21:24:42,628 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_kernel_locking_mutex [2023-11-22 21:24:42,628 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_kernel_locking_mutex [2023-11-22 21:24:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_open [2023-11-22 21:24:42,629 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_open [2023-11-22 21:24:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2023-11-22 21:24:42,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2023-11-22 21:24:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2023-11-22 21:24:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_kernel_locking_spinlock [2023-11-22 21:24:42,630 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_kernel_locking_spinlock [2023-11-22 21:24:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2023-11-22 21:24:42,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2023-11-22 21:24:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_block_genhd [2023-11-22 21:24:42,630 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_block_genhd [2023-11-22 21:24:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 21:24:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_kernel_rcu_update_lock_sched [2023-11-22 21:24:42,631 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_kernel_rcu_update_lock_sched [2023-11-22 21:24:42,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:24:42,631 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_write [2023-11-22 21:24:42,631 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_write [2023-11-22 21:24:42,631 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-11-22 21:24:42,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-11-22 21:24:42,631 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2023-11-22 21:24:42,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-22 21:24:42,632 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-11-22 21:24:42,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-11-22 21:24:42,632 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2023-11-22 21:24:42,632 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irqrestore [2023-11-22 21:24:42,632 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2023-11-22 21:24:42,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~int~X~int~TO~VOID [2023-11-22 21:24:42,632 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2023-11-22 21:24:42,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2023-11-22 21:24:42,633 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2023-11-22 21:24:42,633 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2023-11-22 21:24:42,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register [2023-11-22 21:24:42,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register [2023-11-22 21:24:42,633 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_get_esi [2023-11-22 21:24:42,633 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_get_esi [2023-11-22 21:24:42,633 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_monitor_getc [2023-11-22 21:24:42,634 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_monitor_getc [2023-11-22 21:24:42,634 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2023-11-22 21:24:42,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~TO~VOID [2023-11-22 21:24:42,634 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_map_page [2023-11-22 21:24:42,634 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2023-11-22 21:24:42,634 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_free [2023-11-22 21:24:42,634 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_free [2023-11-22 21:24:42,634 INFO L130 BoogieDeclarations]: Found specification of procedure __pci_register_driver [2023-11-22 21:24:42,635 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~~u32~0 [2023-11-22 21:24:42,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~~u32~0 [2023-11-22 21:24:42,638 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2023-11-22 21:24:42,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2023-11-22 21:24:42,639 INFO L130 BoogieDeclarations]: Found specification of procedure request_firmware [2023-11-22 21:24:42,639 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2023-11-22 21:24:42,639 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2023-11-22 21:24:42,639 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2023-11-22 21:24:42,639 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2023-11-22 21:24:42,639 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_close [2023-11-22 21:24:42,639 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_close [2023-11-22 21:24:42,641 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_reset [2023-11-22 21:24:42,641 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_reset [2023-11-22 21:24:42,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:24:42,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:24:42,641 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_sync_single_for_device [2023-11-22 21:24:42,642 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_rate_ctrl [2023-11-22 21:24:42,642 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_rate_ctrl [2023-11-22 21:24:42,642 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2023-11-22 21:24:42,642 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2023-11-22 21:24:42,642 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2023-11-22 21:24:42,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~TO~int [2023-11-22 21:24:42,642 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_kernel_rcu_update_lock_bh [2023-11-22 21:24:42,642 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_kernel_rcu_update_lock_bh [2023-11-22 21:24:42,643 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unregister_driver [2023-11-22 21:24:42,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-22 21:24:42,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-22 21:24:42,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2023-11-22 21:24:42,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2023-11-22 21:24:42,643 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_sync_single_for_cpu [2023-11-22 21:24:42,643 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_irq_itoa [2023-11-22 21:24:42,643 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_irq_itoa [2023-11-22 21:24:42,644 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_init [2023-11-22 21:24:42,644 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_init [2023-11-22 21:24:42,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_struct_atmdev_ops_io_instance_2 [2023-11-22 21:24:42,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_struct_atmdev_ops_io_instance_2 [2023-11-22 21:24:42,644 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_irq_ack [2023-11-22 21:24:42,644 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_irq_ack [2023-11-22 21:24:42,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_130 [2023-11-22 21:24:42,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_130 [2023-11-22 21:24:42,645 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2023-11-22 21:24:42,645 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2023-11-22 21:24:42,645 INFO L130 BoogieDeclarations]: Found specification of procedure atm_dev_register [2023-11-22 21:24:42,645 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-22 21:24:42,645 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-22 21:24:42,645 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_alloc_usb_lock [2023-11-22 21:24:42,645 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_alloc_usb_lock [2023-11-22 21:24:42,645 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2023-11-22 21:24:42,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2023-11-22 21:24:42,646 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_unmap_page [2023-11-22 21:24:42,646 INFO L130 BoogieDeclarations]: Found specification of procedure sk_atm [2023-11-22 21:24:42,646 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_atm [2023-11-22 21:24:42,646 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_alloc_coherent [2023-11-22 21:24:42,646 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_fs_sysfs [2023-11-22 21:24:42,646 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_fs_sysfs [2023-11-22 21:24:42,646 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2023-11-22 21:24:42,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2023-11-22 21:24:42,647 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_prom_read [2023-11-22 21:24:42,647 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_prom_read [2023-11-22 21:24:42,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 21:24:42,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2023-11-22 21:24:42,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2023-11-22 21:24:42,647 INFO L130 BoogieDeclarations]: Found specification of procedure pci_set_master [2023-11-22 21:24:42,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-22 21:24:42,648 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_usb_coherent [2023-11-22 21:24:42,648 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_usb_coherent [2023-11-22 21:24:42,648 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_sync_for_cpu [2023-11-22 21:24:42,648 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_sync_for_cpu [2023-11-22 21:24:42,648 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_kernel_locking_rwlock [2023-11-22 21:24:42,648 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_kernel_locking_rwlock [2023-11-22 21:24:42,648 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_reset [2023-11-22 21:24:42,648 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_reset [2023-11-22 21:24:42,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-22 21:24:42,649 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2023-11-22 21:24:42,649 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-22 21:24:42,649 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2023-11-22 21:24:42,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2023-11-22 21:24:42,649 INFO L130 BoogieDeclarations]: Found specification of procedure pci_write_config_byte [2023-11-22 21:24:42,649 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_write_config_byte [2023-11-22 21:24:42,649 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_pre_probe [2023-11-22 21:24:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_drivers_base_class [2023-11-22 21:24:42,650 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_drivers_base_class [2023-11-22 21:24:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2023-11-22 21:24:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2023-11-22 21:24:42,650 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2023-11-22 21:24:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_kernel_module [2023-11-22 21:24:42,650 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_kernel_module [2023-11-22 21:24:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_chunk_free [2023-11-22 21:24:42,651 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_chunk_free [2023-11-22 21:24:42,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2023-11-22 21:24:42,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2023-11-22 21:24:42,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2023-11-22 21:24:42,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2023-11-22 21:24:42,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2023-11-22 21:24:42,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rate_mtx_of_fore200e [2023-11-22 21:24:42,651 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2023-11-22 21:24:42,652 INFO L130 BoogieDeclarations]: Found specification of procedure __dev_kfree_skb_any [2023-11-22 21:24:42,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2023-11-22 21:24:42,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2023-11-22 21:24:42,652 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_map [2023-11-22 21:24:42,652 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_map [2023-11-22 21:24:42,652 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_atm2fore_aal [2023-11-22 21:24:42,652 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_atm2fore_aal [2023-11-22 21:24:42,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2023-11-22 21:24:42,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_q_lock_of_fore200e [2023-11-22 21:24:42,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2023-11-22 21:24:42,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2023-11-22 21:24:42,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2023-11-22 21:24:42,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2023-11-22 21:24:42,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2023-11-22 21:24:42,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2023-11-22 21:24:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2023-11-22 21:24:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure __tasklet_schedule [2023-11-22 21:24:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_fs_char_dev [2023-11-22 21:24:42,654 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_fs_char_dev [2023-11-22 21:24:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure pci_bus_write_config_byte [2023-11-22 21:24:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2023-11-22 21:24:42,654 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2023-11-22 21:24:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atm_dev_register_150 [2023-11-22 21:24:42,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atm_dev_register_150 [2023-11-22 21:24:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_usb_gadget [2023-11-22 21:24:42,655 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_usb_gadget [2023-11-22 21:24:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2023-11-22 21:24:42,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2023-11-22 21:24:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-22 21:24:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_net_rtnetlink [2023-11-22 21:24:42,656 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_net_rtnetlink [2023-11-22 21:24:42,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2023-11-22 21:24:42,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2023-11-22 21:24:42,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_register_8_1 [2023-11-22 21:24:42,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_register_8_1 [2023-11-22 21:24:42,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-22 21:24:42,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2023-11-22 21:24:42,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2023-11-22 21:24:42,657 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_configure [2023-11-22 21:24:42,657 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_configure [2023-11-22 21:24:42,657 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-22 21:24:42,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-22 21:24:42,657 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_block_request [2023-11-22 21:24:42,657 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_block_request [2023-11-22 21:24:42,657 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2023-11-22 21:24:42,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2023-11-22 21:24:42,658 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2023-11-22 21:24:42,658 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2023-11-22 21:24:42,658 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2023-11-22 21:24:42,658 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2023-11-22 21:24:42,658 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_lib_idr [2023-11-22 21:24:42,658 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_lib_idr [2023-11-22 21:24:42,658 INFO L130 BoogieDeclarations]: Found specification of procedure pci_enable_device [2023-11-22 21:24:42,658 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_send [2023-11-22 21:24:42,659 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_send [2023-11-22 21:24:42,659 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_usb_urb [2023-11-22 21:24:42,659 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_usb_urb [2023-11-22 21:24:42,659 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_unmap [2023-11-22 21:24:42,659 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_unmap [2023-11-22 21:24:42,659 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_dma_chunk_alloc [2023-11-22 21:24:42,659 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_dma_chunk_alloc [2023-11-22 21:24:42,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2023-11-22 21:24:42,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2023-11-22 21:24:42,660 INFO L130 BoogieDeclarations]: Found specification of procedure atm_dev_deregister [2023-11-22 21:24:42,660 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2023-11-22 21:24:42,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2023-11-22 21:24:42,660 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_mmc_sdio_func [2023-11-22 21:24:42,660 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_mmc_sdio_func [2023-11-22 21:24:42,660 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2023-11-22 21:24:42,660 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_pca_proc_read [2023-11-22 21:24:42,661 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_pca_proc_read [2023-11-22 21:24:42,661 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_poll [2023-11-22 21:24:42,661 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_poll [2023-11-22 21:24:42,661 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2023-11-22 21:24:42,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2023-11-22 21:24:42,661 INFO L130 BoogieDeclarations]: Found specification of procedure __copy_to_user_overflow [2023-11-22 21:24:42,661 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2023-11-22 21:24:42,661 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2023-11-22 21:24:42,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 21:24:42,662 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2023-11-22 21:24:42,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2023-11-22 21:24:42,662 INFO L130 BoogieDeclarations]: Found specification of procedure pci_bus_read_config_byte [2023-11-22 21:24:42,662 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2023-11-22 21:24:42,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rate_mtx_of_fore200e [2023-11-22 21:24:42,662 INFO L130 BoogieDeclarations]: Found specification of procedure request_threaded_irq [2023-11-22 21:24:42,663 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_linux_kernel_rcu_srcu [2023-11-22 21:24:42,663 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_linux_kernel_rcu_srcu [2023-11-22 21:24:42,663 INFO L130 BoogieDeclarations]: Found specification of procedure fore200e_tx_irq [2023-11-22 21:24:42,663 INFO L138 BoogieDeclarations]: Found implementation of procedure fore200e_tx_irq [2023-11-22 21:24:43,513 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:24:43,522 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:24:47,752 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:24:47,998 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:24:47,998 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-22 21:24:47,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:24:47 BoogieIcfgContainer [2023-11-22 21:24:48,000 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:24:48,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:24:48,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:24:48,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:24:48,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:24:37" (1/3) ... [2023-11-22 21:24:48,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6218fb2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:24:48, skipping insertion in model container [2023-11-22 21:24:48,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:24:41" (2/3) ... [2023-11-22 21:24:48,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6218fb2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:24:48, skipping insertion in model container [2023-11-22 21:24:48,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:24:47" (3/3) ... [2023-11-22 21:24:48,009 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--atm--fore_200e.ko.cil.c [2023-11-22 21:24:48,026 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:24:48,026 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2023-11-22 21:24:48,107 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:24:48,113 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;@a3ddf94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:24:48,113 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-11-22 21:24:48,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 1702 states, 1057 states have (on average 1.3822138126773889) internal successors, (1461), 1139 states have internal predecessors, (1461), 481 states have call successors, (481), 137 states have call predecessors, (481), 137 states have return successors, (481), 470 states have call predecessors, (481), 481 states have call successors, (481) [2023-11-22 21:24:48,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-22 21:24:48,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:24:48,135 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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-22 21:24:48,135 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_linux_arch_ioErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:24:48,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:24:48,142 INFO L85 PathProgramCache]: Analyzing trace with hash 496120257, now seen corresponding path program 1 times [2023-11-22 21:24:48,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:24:48,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057882679] [2023-11-22 21:24:48,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:24:48,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:24:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:48,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:24:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:48,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:24:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:48,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:24:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:48,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-22 21:24:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:48,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:24:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:48,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:24:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:48,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:24:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:48,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:24:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:48,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 21:24:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:24:48,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:24:48,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057882679] [2023-11-22 21:24:48,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057882679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:24:48,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:24:48,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:24:48,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183030030] [2023-11-22 21:24:48,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:24:48,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:24:48,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:24:48,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:24:48,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:24:48,949 INFO L87 Difference]: Start difference. First operand has 1702 states, 1057 states have (on average 1.3822138126773889) internal successors, (1461), 1139 states have internal predecessors, (1461), 481 states have call successors, (481), 137 states have call predecessors, (481), 137 states have return successors, (481), 470 states have call predecessors, (481), 481 states have call successors, (481) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-22 21:24:55,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:24:55,591 INFO L93 Difference]: Finished difference Result 3375 states and 5047 transitions. [2023-11-22 21:24:55,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 21:24:55,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 52 [2023-11-22 21:24:55,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:24:55,646 INFO L225 Difference]: With dead ends: 3375 [2023-11-22 21:24:55,646 INFO L226 Difference]: Without dead ends: 1667 [2023-11-22 21:24:55,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:24:55,674 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 2550 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 1660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2550 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 3990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1660 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-11-22 21:24:55,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2550 Valid, 495 Invalid, 3990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1660 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2023-11-22 21:24:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2023-11-22 21:24:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1667. [2023-11-22 21:24:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1050 states have (on average 1.339047619047619) internal successors, (1406), 1107 states have internal predecessors, (1406), 479 states have call successors, (479), 137 states have call predecessors, (479), 112 states have return successors, (449), 439 states have call predecessors, (449), 449 states have call successors, (449) [2023-11-22 21:24:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2334 transitions. [2023-11-22 21:24:55,843 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2334 transitions. Word has length 52 [2023-11-22 21:24:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:24:55,843 INFO L495 AbstractCegarLoop]: Abstraction has 1667 states and 2334 transitions. [2023-11-22 21:24:55,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-22 21:24:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2334 transitions. [2023-11-22 21:24:55,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-22 21:24:55,846 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:24:55,846 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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-22 21:24:55,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 21:24:55,846 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_linux_arch_ioErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:24:55,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:24:55,847 INFO L85 PathProgramCache]: Analyzing trace with hash 350155329, now seen corresponding path program 1 times [2023-11-22 21:24:55,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:24:55,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245295015] [2023-11-22 21:24:55,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:24:55,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:24:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:56,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:24:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:56,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:24:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:56,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:24:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:56,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-22 21:24:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:56,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:24:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:56,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:24:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:56,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:24:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:56,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:24:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:56,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 21:24:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:24:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:24:56,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:24:56,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245295015] [2023-11-22 21:24:56,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245295015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:24:56,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:24:56,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:24:56,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870887227] [2023-11-22 21:24:56,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:24:56,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:24:56,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:24:56,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:24:56,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:24:56,529 INFO L87 Difference]: Start difference. First operand 1667 states and 2334 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (11), 5 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-22 21:25:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:25:09,529 INFO L93 Difference]: Finished difference Result 3318 states and 4674 transitions. [2023-11-22 21:25:09,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 21:25:09,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (11), 5 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 52 [2023-11-22 21:25:09,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:25:09,553 INFO L225 Difference]: With dead ends: 3318 [2023-11-22 21:25:09,553 INFO L226 Difference]: Without dead ends: 3315 [2023-11-22 21:25:09,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-22 21:25:09,557 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 6114 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 7426 mSolverCounterSat, 3739 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6199 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 11165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3739 IncrementalHoareTripleChecker+Valid, 7426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2023-11-22 21:25:09,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6199 Valid, 948 Invalid, 11165 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3739 Valid, 7426 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2023-11-22 21:25:09,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states. [2023-11-22 21:25:09,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 3120. [2023-11-22 21:25:09,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3120 states, 2004 states have (on average 1.343812375249501) internal successors, (2693), 2089 states have internal predecessors, (2693), 884 states have call successors, (884), 231 states have call predecessors, (884), 206 states have return successors, (887), 832 states have call predecessors, (887), 854 states have call successors, (887) [2023-11-22 21:25:09,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 4464 transitions. [2023-11-22 21:25:09,752 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 4464 transitions. Word has length 52 [2023-11-22 21:25:09,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:25:09,753 INFO L495 AbstractCegarLoop]: Abstraction has 3120 states and 4464 transitions. [2023-11-22 21:25:09,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (11), 5 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-22 21:25:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 4464 transitions. [2023-11-22 21:25:09,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-22 21:25:09,760 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:25:09,760 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-11-22 21:25:09,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 21:25:09,761 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_linux_block_genhdErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:25:09,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:25:09,761 INFO L85 PathProgramCache]: Analyzing trace with hash -247361317, now seen corresponding path program 1 times [2023-11-22 21:25:09,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:25:09,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320194537] [2023-11-22 21:25:09,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:25:09,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:25:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:10,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:25:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:10,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:25:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:10,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:25:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:10,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-22 21:25:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:10,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:25:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:10,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:25:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:10,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:25:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:10,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:25:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:10,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 21:25:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:10,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:25:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:25:10,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:25:10,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320194537] [2023-11-22 21:25:10,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320194537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:25:10,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:25:10,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:25:10,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56279797] [2023-11-22 21:25:10,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:25:10,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:25:10,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:25:10,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:25:10,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:25:10,348 INFO L87 Difference]: Start difference. First operand 3120 states and 4464 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (12), 5 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-22 21:25:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:25:18,518 INFO L93 Difference]: Finished difference Result 3120 states and 4464 transitions. [2023-11-22 21:25:18,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:25:18,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (12), 5 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 57 [2023-11-22 21:25:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:25:18,534 INFO L225 Difference]: With dead ends: 3120 [2023-11-22 21:25:18,534 INFO L226 Difference]: Without dead ends: 3117 [2023-11-22 21:25:18,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:25:18,537 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 4037 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 4446 mSolverCounterSat, 2377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4128 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 6823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2377 IncrementalHoareTripleChecker+Valid, 4446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2023-11-22 21:25:18,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4128 Valid, 680 Invalid, 6823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2377 Valid, 4446 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2023-11-22 21:25:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3117 states. [2023-11-22 21:25:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3117 to 3117. [2023-11-22 21:25:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3117 states, 2003 states have (on average 1.3434847728407389) internal successors, (2691), 2087 states have internal predecessors, (2691), 883 states have call successors, (883), 230 states have call predecessors, (883), 206 states have return successors, (887), 832 states have call predecessors, (887), 854 states have call successors, (887) [2023-11-22 21:25:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 4461 transitions. [2023-11-22 21:25:18,679 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 4461 transitions. Word has length 57 [2023-11-22 21:25:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:25:18,679 INFO L495 AbstractCegarLoop]: Abstraction has 3117 states and 4461 transitions. [2023-11-22 21:25:18,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (12), 5 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-22 21:25:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 4461 transitions. [2023-11-22 21:25:18,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-22 21:25:18,681 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:25:18,683 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-11-22 21:25:18,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 21:25:18,684 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_linux_block_queueErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:25:18,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:25:18,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1822251989, now seen corresponding path program 1 times [2023-11-22 21:25:18,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:25:18,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434744378] [2023-11-22 21:25:18,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:25:18,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:25:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:19,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:25:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:19,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:25:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:19,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:25:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:19,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-22 21:25:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:19,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:25:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:19,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:25:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:19,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:25:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:19,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:25:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:19,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 21:25:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:19,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:25:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:19,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 21:25:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:19,198 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:25:19,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:25:19,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434744378] [2023-11-22 21:25:19,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434744378] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:25:19,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:25:19,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:25:19,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996459646] [2023-11-22 21:25:19,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:25:19,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:25:19,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:25:19,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:25:19,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:25:19,201 INFO L87 Difference]: Start difference. First operand 3117 states and 4461 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (13), 5 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-22 21:25:21,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:25:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:25:26,964 INFO L93 Difference]: Finished difference Result 3117 states and 4461 transitions. [2023-11-22 21:25:26,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:25:26,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (13), 5 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 62 [2023-11-22 21:25:26,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:25:26,982 INFO L225 Difference]: With dead ends: 3117 [2023-11-22 21:25:26,982 INFO L226 Difference]: Without dead ends: 3114 [2023-11-22 21:25:26,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:25:26,987 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 4031 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 4440 mSolverCounterSat, 2374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4121 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 6814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2374 IncrementalHoareTripleChecker+Valid, 4440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2023-11-22 21:25:26,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4121 Valid, 680 Invalid, 6814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2374 Valid, 4440 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2023-11-22 21:25:26,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2023-11-22 21:25:27,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 3114. [2023-11-22 21:25:27,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3114 states, 2002 states have (on average 1.3431568431568432) internal successors, (2689), 2085 states have internal predecessors, (2689), 882 states have call successors, (882), 229 states have call predecessors, (882), 206 states have return successors, (887), 832 states have call predecessors, (887), 854 states have call successors, (887) [2023-11-22 21:25:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 4458 transitions. [2023-11-22 21:25:27,144 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 4458 transitions. Word has length 62 [2023-11-22 21:25:27,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:25:27,146 INFO L495 AbstractCegarLoop]: Abstraction has 3114 states and 4458 transitions. [2023-11-22 21:25:27,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (13), 5 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-22 21:25:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 4458 transitions. [2023-11-22 21:25:27,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-22 21:25:27,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:25:27,148 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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-22 21:25:27,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 21:25:27,148 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_linux_block_requestErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:25:27,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:25:27,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1635153526, now seen corresponding path program 1 times [2023-11-22 21:25:27,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:25:27,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519184592] [2023-11-22 21:25:27,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:25:27,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:25:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:27,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:25:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:27,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:25:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:27,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:25:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:27,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-22 21:25:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:27,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:25:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:27,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:25:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:27,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:25:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:27,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:25:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:27,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 21:25:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:27,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:25:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:27,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 21:25:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:27,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:25:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:27,716 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:25:27,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:25:27,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519184592] [2023-11-22 21:25:27,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519184592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:25:27,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:25:27,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:25:27,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112493692] [2023-11-22 21:25:27,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:25:27,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:25:27,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:25:27,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:25:27,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:25:27,720 INFO L87 Difference]: Start difference. First operand 3114 states and 4458 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (14), 5 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-22 21:25:28,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:25:35,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:25:35,258 INFO L93 Difference]: Finished difference Result 3114 states and 4458 transitions. [2023-11-22 21:25:35,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:25:35,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (14), 5 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 67 [2023-11-22 21:25:35,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:25:35,270 INFO L225 Difference]: With dead ends: 3114 [2023-11-22 21:25:35,271 INFO L226 Difference]: Without dead ends: 3111 [2023-11-22 21:25:35,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:25:35,273 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 4025 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 4434 mSolverCounterSat, 2371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4114 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 6805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2371 IncrementalHoareTripleChecker+Valid, 4434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-11-22 21:25:35,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4114 Valid, 680 Invalid, 6805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2371 Valid, 4434 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2023-11-22 21:25:35,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2023-11-22 21:25:35,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 3111. [2023-11-22 21:25:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3111 states, 2001 states have (on average 1.3428285857071465) internal successors, (2687), 2083 states have internal predecessors, (2687), 881 states have call successors, (881), 228 states have call predecessors, (881), 206 states have return successors, (887), 832 states have call predecessors, (887), 854 states have call successors, (887) [2023-11-22 21:25:35,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 4455 transitions. [2023-11-22 21:25:35,454 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 4455 transitions. Word has length 67 [2023-11-22 21:25:35,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:25:35,456 INFO L495 AbstractCegarLoop]: Abstraction has 3111 states and 4455 transitions. [2023-11-22 21:25:35,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (14), 5 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-22 21:25:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 4455 transitions. [2023-11-22 21:25:35,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-22 21:25:35,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:25:35,459 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-11-22 21:25:35,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 21:25:35,460 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_linux_drivers_base_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:25:35,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:25:35,461 INFO L85 PathProgramCache]: Analyzing trace with hash 636845406, now seen corresponding path program 1 times [2023-11-22 21:25:35,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:25:35,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399063332] [2023-11-22 21:25:35,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:25:35,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:25:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:35,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:25:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:35,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:25:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:35,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:25:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:35,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-22 21:25:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:35,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:25:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:35,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:25:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:35,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:25:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:35,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:25:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:35,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 21:25:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:35,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:25:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:35,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 21:25:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:35,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:25:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:35,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 21:25:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:25:35,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:25:35,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399063332] [2023-11-22 21:25:35,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399063332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:25:35,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:25:35,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:25:35,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746872471] [2023-11-22 21:25:35,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:25:35,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:25:35,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:25:35,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:25:35,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:25:35,974 INFO L87 Difference]: Start difference. First operand 3111 states and 4455 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (15), 5 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-22 21:25:39,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:25:44,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:25:44,122 INFO L93 Difference]: Finished difference Result 3111 states and 4455 transitions. [2023-11-22 21:25:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:25:44,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (15), 5 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 72 [2023-11-22 21:25:44,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:25:44,136 INFO L225 Difference]: With dead ends: 3111 [2023-11-22 21:25:44,136 INFO L226 Difference]: Without dead ends: 3108 [2023-11-22 21:25:44,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:25:44,138 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 4019 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 4428 mSolverCounterSat, 2368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4107 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 6796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2368 IncrementalHoareTripleChecker+Valid, 4428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2023-11-22 21:25:44,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4107 Valid, 680 Invalid, 6796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2368 Valid, 4428 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2023-11-22 21:25:44,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3108 states. [2023-11-22 21:25:44,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3108 to 3108. [2023-11-22 21:25:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3108 states, 2000 states have (on average 1.3425) internal successors, (2685), 2081 states have internal predecessors, (2685), 880 states have call successors, (880), 227 states have call predecessors, (880), 206 states have return successors, (887), 832 states have call predecessors, (887), 854 states have call successors, (887) [2023-11-22 21:25:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 4452 transitions. [2023-11-22 21:25:44,310 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 4452 transitions. Word has length 72 [2023-11-22 21:25:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:25:44,311 INFO L495 AbstractCegarLoop]: Abstraction has 3108 states and 4452 transitions. [2023-11-22 21:25:44,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (15), 5 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-22 21:25:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 4452 transitions. [2023-11-22 21:25:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-22 21:25:44,312 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:25:44,313 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:25:44,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-22 21:25:44,313 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_linux_arch_ioErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:25:44,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:25:44,313 INFO L85 PathProgramCache]: Analyzing trace with hash 604681482, now seen corresponding path program 1 times [2023-11-22 21:25:44,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:25:44,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35604197] [2023-11-22 21:25:44,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:25:44,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:25:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:45,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:25:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:45,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:25:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:45,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:25:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:45,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-22 21:25:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:46,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:25:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:46,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:25:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:46,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:25:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:46,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:25:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:46,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 21:25:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:46,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 21:25:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:46,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 21:25:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:46,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:25:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:46,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:25:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:46,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:25:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:46,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-22 21:25:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-22 21:25:46,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:25:46,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35604197] [2023-11-22 21:25:46,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35604197] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:25:46,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588996927] [2023-11-22 21:25:46,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:25:46,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:25:46,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:25:46,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 21:25:46,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 21:25:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:25:47,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 1911 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-22 21:25:47,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:25:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-22 21:25:47,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:25:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-22 21:25:47,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588996927] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:25:47,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 21:25:47,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 18 [2023-11-22 21:25:47,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488631237] [2023-11-22 21:25:47,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 21:25:47,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-22 21:25:47,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:25:47,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-22 21:25:47,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2023-11-22 21:25:47,574 INFO L87 Difference]: Start difference. First operand 3108 states and 4452 transitions. Second operand has 18 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 7 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2023-11-22 21:25:48,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:25:53,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:26:18,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:26:18,143 INFO L93 Difference]: Finished difference Result 6354 states and 9199 transitions. [2023-11-22 21:26:18,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-22 21:26:18,143 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 7 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) Word has length 82 [2023-11-22 21:26:18,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:26:18,158 INFO L225 Difference]: With dead ends: 6354 [2023-11-22 21:26:18,158 INFO L226 Difference]: Without dead ends: 3257 [2023-11-22 21:26:18,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2023-11-22 21:26:18,170 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 3189 mSDsluCounter, 2386 mSDsCounter, 0 mSdLazyCounter, 27073 mSolverCounterSat, 2427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3208 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 29500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2427 IncrementalHoareTripleChecker+Valid, 27073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.9s IncrementalHoareTripleChecker+Time [2023-11-22 21:26:18,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3208 Valid, 2670 Invalid, 29500 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2427 Valid, 27073 Invalid, 0 Unknown, 0 Unchecked, 29.9s Time] [2023-11-22 21:26:18,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2023-11-22 21:26:18,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 3129. [2023-11-22 21:26:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3129 states, 2017 states have (on average 1.338621715418939) internal successors, (2700), 2095 states have internal predecessors, (2700), 879 states have call successors, (879), 227 states have call predecessors, (879), 211 states have return successors, (899), 837 states have call predecessors, (899), 853 states have call successors, (899) [2023-11-22 21:26:18,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 4478 transitions. [2023-11-22 21:26:18,341 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 4478 transitions. Word has length 82 [2023-11-22 21:26:18,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:26:18,342 INFO L495 AbstractCegarLoop]: Abstraction has 3129 states and 4478 transitions. [2023-11-22 21:26:18,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 7 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2023-11-22 21:26:18,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 4478 transitions. [2023-11-22 21:26:18,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-22 21:26:18,343 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:26:18,343 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-11-22 21:26:18,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 21:26:18,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:26:18,566 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_linux_fs_char_devErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:26:18,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:26:18,567 INFO L85 PathProgramCache]: Analyzing trace with hash -2136620505, now seen corresponding path program 1 times [2023-11-22 21:26:18,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:26:18,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597973147] [2023-11-22 21:26:18,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:26:18,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:26:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:18,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:26:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:18,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:26:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:18,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:26:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:18,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-22 21:26:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:18,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:26:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:19,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:26:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:19,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:26:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:19,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:26:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:19,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 21:26:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:19,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:26:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:19,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 21:26:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:19,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:26:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:19,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 21:26:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:19,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 21:26:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:26:19,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:26:19,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597973147] [2023-11-22 21:26:19,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597973147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:26:19,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:26:19,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:26:19,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485626901] [2023-11-22 21:26:19,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:26:19,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:26:19,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:26:19,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:26:19,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:26:19,083 INFO L87 Difference]: Start difference. First operand 3129 states and 4478 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (16), 5 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-22 21:26:26,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:26:26,255 INFO L93 Difference]: Finished difference Result 3129 states and 4478 transitions. [2023-11-22 21:26:26,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:26:26,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (16), 5 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 77 [2023-11-22 21:26:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:26:26,267 INFO L225 Difference]: With dead ends: 3129 [2023-11-22 21:26:26,268 INFO L226 Difference]: Without dead ends: 3126 [2023-11-22 21:26:26,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:26:26,271 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 4005 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 4410 mSolverCounterSat, 2355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4090 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 6765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2355 IncrementalHoareTripleChecker+Valid, 4410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:26:26,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4090 Valid, 662 Invalid, 6765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2355 Valid, 4410 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2023-11-22 21:26:26,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2023-11-22 21:26:26,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 3126. [2023-11-22 21:26:26,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3126 states, 2016 states have (on average 1.3382936507936507) internal successors, (2698), 2093 states have internal predecessors, (2698), 878 states have call successors, (878), 226 states have call predecessors, (878), 211 states have return successors, (899), 837 states have call predecessors, (899), 853 states have call successors, (899) [2023-11-22 21:26:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 4475 transitions. [2023-11-22 21:26:26,459 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 4475 transitions. Word has length 77 [2023-11-22 21:26:26,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:26:26,461 INFO L495 AbstractCegarLoop]: Abstraction has 3126 states and 4475 transitions. [2023-11-22 21:26:26,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (16), 5 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-22 21:26:26,461 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 4475 transitions. [2023-11-22 21:26:26,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-22 21:26:26,463 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:26:26,463 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-22 21:26:26,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-22 21:26:26,464 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:26:26,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:26:26,464 INFO L85 PathProgramCache]: Analyzing trace with hash 514441370, now seen corresponding path program 1 times [2023-11-22 21:26:26,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:26:26,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865269756] [2023-11-22 21:26:26,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:26:26,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:26:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:26:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:26:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:26:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 21:26:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:26:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:26:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:26:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:26:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:26:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:26:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:26:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:26:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:26:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:26:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:26:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-22 21:26:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 21:26:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 21:26:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-22 21:26:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:26,985 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2023-11-22 21:26:26,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:26:26,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865269756] [2023-11-22 21:26:26,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865269756] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:26:26,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:26:26,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 21:26:26,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021936134] [2023-11-22 21:26:26,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:26:26,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 21:26:26,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:26:26,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 21:26:26,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:26:26,987 INFO L87 Difference]: Start difference. First operand 3126 states and 4475 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-22 21:26:28,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:26:35,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:26:35,690 INFO L93 Difference]: Finished difference Result 6472 states and 9338 transitions. [2023-11-22 21:26:35,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:26:35,690 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 97 [2023-11-22 21:26:35,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:26:35,704 INFO L225 Difference]: With dead ends: 6472 [2023-11-22 21:26:35,705 INFO L226 Difference]: Without dead ends: 3373 [2023-11-22 21:26:35,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-22 21:26:35,713 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 5431 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 3797 mSolverCounterSat, 3742 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5529 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 7539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3742 IncrementalHoareTripleChecker+Valid, 3797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-11-22 21:26:35,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5529 Valid, 438 Invalid, 7539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3742 Valid, 3797 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2023-11-22 21:26:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2023-11-22 21:26:35,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3126. [2023-11-22 21:26:35,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3126 states, 2014 states have (on average 1.336643495531281) internal successors, (2692), 2092 states have internal predecessors, (2692), 878 states have call successors, (878), 226 states have call predecessors, (878), 214 states have return successors, (911), 838 states have call predecessors, (911), 853 states have call successors, (911) [2023-11-22 21:26:35,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 4481 transitions. [2023-11-22 21:26:35,945 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 4481 transitions. Word has length 97 [2023-11-22 21:26:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:26:35,946 INFO L495 AbstractCegarLoop]: Abstraction has 3126 states and 4481 transitions. [2023-11-22 21:26:35,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-22 21:26:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 4481 transitions. [2023-11-22 21:26:35,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-22 21:26:35,947 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:26:35,947 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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-22 21:26:35,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-22 21:26:35,947 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reach_error_linux_fs_sysfsErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:26:35,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:26:35,948 INFO L85 PathProgramCache]: Analyzing trace with hash -579786239, now seen corresponding path program 1 times [2023-11-22 21:26:35,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:26:35,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579380662] [2023-11-22 21:26:35,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:26:35,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:26:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:36,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:26:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:36,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:26:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:36,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:26:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:36,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-22 21:26:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:36,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:26:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:36,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:26:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:36,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:26:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:36,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:26:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:36,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 21:26:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:36,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:26:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:36,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 21:26:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:36,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:26:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:36,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 21:26:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:36,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 21:26:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:36,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-22 21:26:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:26:36,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:26:36,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579380662] [2023-11-22 21:26:36,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579380662] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:26:36,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:26:36,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:26:36,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588422515] [2023-11-22 21:26:36,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:26:36,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:26:36,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:26:36,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:26:36,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:26:36,379 INFO L87 Difference]: Start difference. First operand 3126 states and 4481 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (17), 5 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-22 21:26:38,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:26:44,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:26:44,413 INFO L93 Difference]: Finished difference Result 3126 states and 4481 transitions. [2023-11-22 21:26:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:26:44,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (17), 5 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 82 [2023-11-22 21:26:44,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:26:44,426 INFO L225 Difference]: With dead ends: 3126 [2023-11-22 21:26:44,426 INFO L226 Difference]: Without dead ends: 3123 [2023-11-22 21:26:44,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:26:44,428 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 3994 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 4403 mSolverCounterSat, 2352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4078 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 6755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2352 IncrementalHoareTripleChecker+Valid, 4403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-11-22 21:26:44,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4078 Valid, 643 Invalid, 6755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2352 Valid, 4403 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2023-11-22 21:26:44,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3123 states. [2023-11-22 21:26:44,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3123 to 3123. [2023-11-22 21:26:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3123 states, 2013 states have (on average 1.336313959264779) internal successors, (2690), 2090 states have internal predecessors, (2690), 877 states have call successors, (877), 225 states have call predecessors, (877), 214 states have return successors, (911), 838 states have call predecessors, (911), 853 states have call successors, (911) [2023-11-22 21:26:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 4478 transitions. [2023-11-22 21:26:44,707 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 4478 transitions. Word has length 82 [2023-11-22 21:26:44,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:26:44,708 INFO L495 AbstractCegarLoop]: Abstraction has 3123 states and 4478 transitions. [2023-11-22 21:26:44,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (17), 5 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-22 21:26:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 4478 transitions. [2023-11-22 21:26:44,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-22 21:26:44,709 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:26:44,709 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 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] [2023-11-22 21:26:44,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-22 21:26:44,709 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:26:44,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:26:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1016504492, now seen corresponding path program 1 times [2023-11-22 21:26:44,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:26:44,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797964128] [2023-11-22 21:26:44,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:26:44,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:26:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:26:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:26:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:26:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 21:26:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:26:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:26:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:26:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:26:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:26:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:26:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:26:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:26:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:26:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:26:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:26:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-22 21:26:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 21:26:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 21:26:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-22 21:26:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-22 21:26:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2023-11-22 21:26:45,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:26:45,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797964128] [2023-11-22 21:26:45,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797964128] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:26:45,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959672040] [2023-11-22 21:26:45,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:26:45,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:26:45,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:26:45,200 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 21:26:45,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 21:26:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:46,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 2081 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 21:26:46,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:26:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2023-11-22 21:26:46,143 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:26:46,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959672040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:26:46,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:26:46,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-11-22 21:26:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720752338] [2023-11-22 21:26:46,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:26:46,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:26:46,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:26:46,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:26:46,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 21:26:46,145 INFO L87 Difference]: Start difference. First operand 3123 states and 4478 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-22 21:26:47,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:26:47,251 INFO L93 Difference]: Finished difference Result 6213 states and 8908 transitions. [2023-11-22 21:26:47,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:26:47,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 102 [2023-11-22 21:26:47,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:26:47,261 INFO L225 Difference]: With dead ends: 6213 [2023-11-22 21:26:47,261 INFO L226 Difference]: Without dead ends: 3117 [2023-11-22 21:26:47,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 21:26:47,269 INFO L413 NwaCegarLoop]: 2089 mSDtfsCounter, 2281 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2281 SdHoareTripleChecker+Valid, 2089 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-22 21:26:47,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2281 Valid, 2089 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-22 21:26:47,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3117 states. [2023-11-22 21:26:47,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3117 to 3117. [2023-11-22 21:26:47,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3117 states, 2008 states have (on average 1.3351593625498008) internal successors, (2681), 2084 states have internal predecessors, (2681), 877 states have call successors, (877), 225 states have call predecessors, (877), 214 states have return successors, (911), 838 states have call predecessors, (911), 853 states have call successors, (911) [2023-11-22 21:26:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 4469 transitions. [2023-11-22 21:26:47,499 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 4469 transitions. Word has length 102 [2023-11-22 21:26:47,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:26:47,499 INFO L495 AbstractCegarLoop]: Abstraction has 3117 states and 4469 transitions. [2023-11-22 21:26:47,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-22 21:26:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 4469 transitions. [2023-11-22 21:26:47,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-22 21:26:47,501 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:26:47,501 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-11-22 21:26:47,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-22 21:26:47,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-22 21:26:47,716 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reach_error_linux_kernel_locking_rwlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:26:47,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:26:47,717 INFO L85 PathProgramCache]: Analyzing trace with hash 953590167, now seen corresponding path program 1 times [2023-11-22 21:26:47,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:26:47,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896694776] [2023-11-22 21:26:47,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:26:47,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:26:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:48,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:26:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:48,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:26:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:48,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:26:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:48,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-22 21:26:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:48,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:26:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:48,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:26:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:48,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:26:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:48,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:26:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:48,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 21:26:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:48,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:26:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:48,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 21:26:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:48,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:26:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:48,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 21:26:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:48,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 21:26:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:48,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-22 21:26:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:48,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-22 21:26:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:48,152 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:26:48,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:26:48,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896694776] [2023-11-22 21:26:48,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896694776] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:26:48,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:26:48,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:26:48,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116999502] [2023-11-22 21:26:48,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:26:48,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:26:48,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:26:48,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:26:48,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:26:48,154 INFO L87 Difference]: Start difference. First operand 3117 states and 4469 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (18), 5 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-22 21:26:49,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:26:56,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:26:56,296 INFO L93 Difference]: Finished difference Result 3119 states and 4470 transitions. [2023-11-22 21:26:56,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:26:56,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (18), 5 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 87 [2023-11-22 21:26:56,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:26:56,307 INFO L225 Difference]: With dead ends: 3119 [2023-11-22 21:26:56,307 INFO L226 Difference]: Without dead ends: 3116 [2023-11-22 21:26:56,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:26:56,309 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 3986 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 4398 mSolverCounterSat, 2349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4069 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 6747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2349 IncrementalHoareTripleChecker+Valid, 4398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-11-22 21:26:56,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4069 Valid, 624 Invalid, 6747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2349 Valid, 4398 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2023-11-22 21:26:56,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states. [2023-11-22 21:26:56,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 3116. [2023-11-22 21:26:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3116 states, 2008 states have (on average 1.3346613545816732) internal successors, (2680), 2083 states have internal predecessors, (2680), 876 states have call successors, (876), 225 states have call predecessors, (876), 214 states have return successors, (911), 838 states have call predecessors, (911), 853 states have call successors, (911) [2023-11-22 21:26:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 4467 transitions. [2023-11-22 21:26:56,629 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 4467 transitions. Word has length 87 [2023-11-22 21:26:56,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:26:56,630 INFO L495 AbstractCegarLoop]: Abstraction has 3116 states and 4467 transitions. [2023-11-22 21:26:56,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (18), 5 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-22 21:26:56,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 4467 transitions. [2023-11-22 21:26:56,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-22 21:26:56,631 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:26:56,631 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-22 21:26:56,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-22 21:26:56,632 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reach_error_linux_alloc_irqErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:26:56,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:26:56,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1184229116, now seen corresponding path program 1 times [2023-11-22 21:26:56,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:26:56,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716035873] [2023-11-22 21:26:56,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:26:56,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:26:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:26:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:26:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:26:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 21:26:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:26:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:26:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:26:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:26:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:26:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:26:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:26:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:26:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:26:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:26:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:26:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-22 21:26:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 21:26:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 21:26:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-22 21:26:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:26:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2023-11-22 21:26:57,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:26:57,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716035873] [2023-11-22 21:26:57,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716035873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:26:57,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:26:57,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-22 21:26:57,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599545259] [2023-11-22 21:26:57,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:26:57,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 21:26:57,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:26:57,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 21:26:57,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-22 21:26:57,368 INFO L87 Difference]: Start difference. First operand 3116 states and 4467 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-22 21:27:02,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:27:13,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:27:13,572 INFO L93 Difference]: Finished difference Result 7368 states and 10569 transitions. [2023-11-22 21:27:13,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 21:27:13,572 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 107 [2023-11-22 21:27:13,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:27:13,587 INFO L225 Difference]: With dead ends: 7368 [2023-11-22 21:27:13,587 INFO L226 Difference]: Without dead ends: 4279 [2023-11-22 21:27:13,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2023-11-22 21:27:13,597 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 5806 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 10720 mSolverCounterSat, 3646 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5897 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 14367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3646 IncrementalHoareTripleChecker+Valid, 10720 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2023-11-22 21:27:13,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5897 Valid, 967 Invalid, 14367 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3646 Valid, 10720 Invalid, 1 Unknown, 0 Unchecked, 15.7s Time] [2023-11-22 21:27:13,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4279 states. [2023-11-22 21:27:13,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4279 to 4070. [2023-11-22 21:27:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4070 states, 2633 states have (on average 1.3300417774401823) internal successors, (3502), 2728 states have internal predecessors, (3502), 1090 states have call successors, (1090), 337 states have call predecessors, (1090), 329 states have return successors, (1135), 1041 states have call predecessors, (1135), 1067 states have call successors, (1135) [2023-11-22 21:27:13,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4070 states to 4070 states and 5727 transitions. [2023-11-22 21:27:13,953 INFO L78 Accepts]: Start accepts. Automaton has 4070 states and 5727 transitions. Word has length 107 [2023-11-22 21:27:13,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:27:13,954 INFO L495 AbstractCegarLoop]: Abstraction has 4070 states and 5727 transitions. [2023-11-22 21:27:13,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-22 21:27:13,954 INFO L276 IsEmpty]: Start isEmpty. Operand 4070 states and 5727 transitions. [2023-11-22 21:27:13,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-22 21:27:13,955 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:27:13,955 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-22 21:27:13,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-22 21:27:13,955 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reach_error_linux_alloc_irqErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:27:13,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:27:13,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1182382074, now seen corresponding path program 1 times [2023-11-22 21:27:13,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:27:13,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658551253] [2023-11-22 21:27:13,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:27:13,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:27:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:27:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:27:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:27:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 21:27:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:27:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:27:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:27:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:27:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:27:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:27:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:27:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:27:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:27:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:27:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:27:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-22 21:27:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 21:27:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 21:27:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-22 21:27:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2023-11-22 21:27:14,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:27:14,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658551253] [2023-11-22 21:27:14,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658551253] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:27:14,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:27:14,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 21:27:14,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258031488] [2023-11-22 21:27:14,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:27:14,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 21:27:14,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:27:14,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 21:27:14,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:27:14,542 INFO L87 Difference]: Start difference. First operand 4070 states and 5727 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-22 21:27:16,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:27:26,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:27:26,844 INFO L93 Difference]: Finished difference Result 4271 states and 6049 transitions. [2023-11-22 21:27:26,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 21:27:26,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 107 [2023-11-22 21:27:26,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:27:26,854 INFO L225 Difference]: With dead ends: 4271 [2023-11-22 21:27:26,855 INFO L226 Difference]: Without dead ends: 4268 [2023-11-22 21:27:26,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2023-11-22 21:27:26,856 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 3177 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 7722 mSolverCounterSat, 2280 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3177 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 10003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2280 IncrementalHoareTripleChecker+Valid, 7722 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2023-11-22 21:27:26,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3177 Valid, 885 Invalid, 10003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2280 Valid, 7722 Invalid, 1 Unknown, 0 Unchecked, 11.9s Time] [2023-11-22 21:27:26,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2023-11-22 21:27:27,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4074. [2023-11-22 21:27:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4074 states, 2637 states have (on average 1.328782707622298) internal successors, (3504), 2732 states have internal predecessors, (3504), 1090 states have call successors, (1090), 337 states have call predecessors, (1090), 329 states have return successors, (1135), 1041 states have call predecessors, (1135), 1067 states have call successors, (1135) [2023-11-22 21:27:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4074 states to 4074 states and 5729 transitions. [2023-11-22 21:27:27,202 INFO L78 Accepts]: Start accepts. Automaton has 4074 states and 5729 transitions. Word has length 107 [2023-11-22 21:27:27,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:27:27,202 INFO L495 AbstractCegarLoop]: Abstraction has 4074 states and 5729 transitions. [2023-11-22 21:27:27,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-22 21:27:27,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4074 states and 5729 transitions. [2023-11-22 21:27:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-22 21:27:27,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:27:27,204 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-11-22 21:27:27,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-22 21:27:27,204 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reach_error_linux_kernel_locking_rwlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:27:27,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:27:27,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1513018459, now seen corresponding path program 1 times [2023-11-22 21:27:27,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:27:27,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723375357] [2023-11-22 21:27:27,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:27:27,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:27:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:27,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:27:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:27,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:27:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:27,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:27:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:27,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-22 21:27:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:27,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:27:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:27,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:27:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:27,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:27:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:27,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:27:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:27,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 21:27:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:27,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:27:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:27,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 21:27:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:27,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:27:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:27,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 21:27:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:27,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 21:27:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:27,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-22 21:27:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:27,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-22 21:27:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:27:27,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:27:27,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723375357] [2023-11-22 21:27:27,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723375357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:27:27,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:27:27,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:27:27,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156645107] [2023-11-22 21:27:27,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:27:27,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:27:27,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:27:27,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:27:27,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:27:27,701 INFO L87 Difference]: Start difference. First operand 4074 states and 5729 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (18), 5 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-22 21:27:28,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:27:36,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:27:36,113 INFO L93 Difference]: Finished difference Result 4074 states and 5729 transitions. [2023-11-22 21:27:36,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:27:36,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (18), 5 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 89 [2023-11-22 21:27:36,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:27:36,124 INFO L225 Difference]: With dead ends: 4074 [2023-11-22 21:27:36,124 INFO L226 Difference]: Without dead ends: 4071 [2023-11-22 21:27:36,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:27:36,127 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 3978 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 4392 mSolverCounterSat, 2346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4061 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 6738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2346 IncrementalHoareTripleChecker+Valid, 4392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:27:36,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4061 Valid, 624 Invalid, 6738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2346 Valid, 4392 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2023-11-22 21:27:36,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states. [2023-11-22 21:27:36,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 4071. [2023-11-22 21:27:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4071 states, 2636 states have (on average 1.3285280728376327) internal successors, (3502), 2730 states have internal predecessors, (3502), 1089 states have call successors, (1089), 336 states have call predecessors, (1089), 329 states have return successors, (1135), 1041 states have call predecessors, (1135), 1067 states have call successors, (1135) [2023-11-22 21:27:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4071 states to 4071 states and 5726 transitions. [2023-11-22 21:27:36,490 INFO L78 Accepts]: Start accepts. Automaton has 4071 states and 5726 transitions. Word has length 89 [2023-11-22 21:27:36,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:27:36,491 INFO L495 AbstractCegarLoop]: Abstraction has 4071 states and 5726 transitions. [2023-11-22 21:27:36,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (18), 5 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-22 21:27:36,491 INFO L276 IsEmpty]: Start isEmpty. Operand 4071 states and 5726 transitions. [2023-11-22 21:27:36,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-22 21:27:36,492 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:27:36,493 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-22 21:27:36,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-22 21:27:36,493 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reach_error_linux_alloc_usb_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:27:36,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:27:36,493 INFO L85 PathProgramCache]: Analyzing trace with hash -673888163, now seen corresponding path program 1 times [2023-11-22 21:27:36,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:27:36,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097590729] [2023-11-22 21:27:36,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:27:36,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:27:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:27:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:27:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:27:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 21:27:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:27:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:27:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:27:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:27:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:27:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:27:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:27:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:27:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:27:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-22 21:27:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-22 21:27:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-22 21:27:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 21:27:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 21:27:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-22 21:27:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:36,990 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2023-11-22 21:27:36,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:27:36,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097590729] [2023-11-22 21:27:36,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097590729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:27:36,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:27:36,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:27:36,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705035621] [2023-11-22 21:27:36,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:27:36,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:27:36,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:27:36,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:27:36,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:27:36,992 INFO L87 Difference]: Start difference. First operand 4071 states and 5726 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-22 21:27:39,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:27:41,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:27:46,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:27:46,964 INFO L93 Difference]: Finished difference Result 8296 states and 11807 transitions. [2023-11-22 21:27:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:27:46,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2023-11-22 21:27:46,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:27:46,974 INFO L225 Difference]: With dead ends: 8296 [2023-11-22 21:27:46,975 INFO L226 Difference]: Without dead ends: 4252 [2023-11-22 21:27:46,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:27:46,985 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 4601 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 3499 mSolverCounterSat, 2981 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4694 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 6481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2981 IncrementalHoareTripleChecker+Valid, 3499 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2023-11-22 21:27:46,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4694 Valid, 521 Invalid, 6481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2981 Valid, 3499 Invalid, 1 Unknown, 0 Unchecked, 9.6s Time] [2023-11-22 21:27:46,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4252 states. [2023-11-22 21:27:47,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4252 to 4060. [2023-11-22 21:27:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4060 states, 2627 states have (on average 1.3266082984392844) internal successors, (3485), 2720 states have internal predecessors, (3485), 1088 states have call successors, (1088), 335 states have call predecessors, (1088), 329 states have return successors, (1135), 1041 states have call predecessors, (1135), 1067 states have call successors, (1135) [2023-11-22 21:27:47,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 5708 transitions. [2023-11-22 21:27:47,308 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 5708 transitions. Word has length 110 [2023-11-22 21:27:47,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:27:47,309 INFO L495 AbstractCegarLoop]: Abstraction has 4060 states and 5708 transitions. [2023-11-22 21:27:47,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-22 21:27:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 5708 transitions. [2023-11-22 21:27:47,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-22 21:27:47,310 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:27:47,310 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-11-22 21:27:47,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-22 21:27:47,311 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_error_linux_kernel_moduleErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:27:47,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:27:47,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1329488945, now seen corresponding path program 1 times [2023-11-22 21:27:47,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:27:47,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888779513] [2023-11-22 21:27:47,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:27:47,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:27:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:47,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:27:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:47,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:27:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:47,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:27:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:47,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-22 21:27:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:47,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:27:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:47,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:27:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:47,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:27:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:47,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:27:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:47,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 21:27:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:47,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:27:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:47,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 21:27:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:47,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:27:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:47,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 21:27:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:47,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 21:27:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:47,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-22 21:27:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:47,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-22 21:27:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:47,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 21:27:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:47,825 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:27:47,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:27:47,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888779513] [2023-11-22 21:27:47,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888779513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:27:47,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:27:47,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:27:47,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489766622] [2023-11-22 21:27:47,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:27:47,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:27:47,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:27:47,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:27:47,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:27:47,828 INFO L87 Difference]: Start difference. First operand 4060 states and 5708 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (19), 5 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-22 21:27:54,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:27:54,787 INFO L93 Difference]: Finished difference Result 4060 states and 5708 transitions. [2023-11-22 21:27:54,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:27:54,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (19), 5 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 94 [2023-11-22 21:27:54,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:27:54,797 INFO L225 Difference]: With dead ends: 4060 [2023-11-22 21:27:54,797 INFO L226 Difference]: Without dead ends: 4057 [2023-11-22 21:27:54,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:27:54,798 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 3959 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 4374 mSolverCounterSat, 2340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4041 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 6714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2340 IncrementalHoareTripleChecker+Valid, 4374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-11-22 21:27:54,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4041 Valid, 624 Invalid, 6714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2340 Valid, 4374 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-11-22 21:27:54,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4057 states. [2023-11-22 21:27:55,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4057 to 4057. [2023-11-22 21:27:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4057 states, 2626 states have (on average 1.3263518659558264) internal successors, (3483), 2718 states have internal predecessors, (3483), 1087 states have call successors, (1087), 334 states have call predecessors, (1087), 329 states have return successors, (1135), 1041 states have call predecessors, (1135), 1067 states have call successors, (1135) [2023-11-22 21:27:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4057 states to 4057 states and 5705 transitions. [2023-11-22 21:27:55,174 INFO L78 Accepts]: Start accepts. Automaton has 4057 states and 5705 transitions. Word has length 94 [2023-11-22 21:27:55,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:27:55,176 INFO L495 AbstractCegarLoop]: Abstraction has 4057 states and 5705 transitions. [2023-11-22 21:27:55,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (19), 5 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-22 21:27:55,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4057 states and 5705 transitions. [2023-11-22 21:27:55,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-22 21:27:55,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:27:55,178 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-11-22 21:27:55,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-22 21:27:55,178 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:27:55,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:27:55,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2130622147, now seen corresponding path program 1 times [2023-11-22 21:27:55,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:27:55,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95400053] [2023-11-22 21:27:55,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:27:55,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:27:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:55,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:27:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:55,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:27:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:55,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:27:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:55,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-22 21:27:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:55,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:27:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:55,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:27:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:55,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:27:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:55,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:27:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:55,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 21:27:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:55,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:27:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:55,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 21:27:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:55,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:27:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:55,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 21:27:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:55,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 21:27:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:55,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-22 21:27:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:55,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-22 21:27:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:55,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 21:27:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:55,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-22 21:27:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:27:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:27:55,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:27:55,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95400053] [2023-11-22 21:27:55,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95400053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:27:55,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:27:55,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:27:55,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38072269] [2023-11-22 21:27:55,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:27:55,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:27:55,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:27:55,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:27:55,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:27:55,686 INFO L87 Difference]: Start difference. First operand 4057 states and 5705 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (20), 5 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-22 21:27:56,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:28:00,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:28:04,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:28:04,844 INFO L93 Difference]: Finished difference Result 4057 states and 5705 transitions. [2023-11-22 21:28:04,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:28:04,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (20), 5 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 99 [2023-11-22 21:28:04,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:28:04,853 INFO L225 Difference]: With dead ends: 4057 [2023-11-22 21:28:04,853 INFO L226 Difference]: Without dead ends: 4054 [2023-11-22 21:28:04,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:28:04,854 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 3953 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 4368 mSolverCounterSat, 2337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4034 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 6705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2337 IncrementalHoareTripleChecker+Valid, 4368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-11-22 21:28:04,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4034 Valid, 624 Invalid, 6705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2337 Valid, 4368 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2023-11-22 21:28:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4054 states. [2023-11-22 21:28:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4054 to 4054. [2023-11-22 21:28:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4054 states, 2625 states have (on average 1.326095238095238) internal successors, (3481), 2716 states have internal predecessors, (3481), 1086 states have call successors, (1086), 333 states have call predecessors, (1086), 329 states have return successors, (1135), 1041 states have call predecessors, (1135), 1067 states have call successors, (1135) [2023-11-22 21:28:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4054 states to 4054 states and 5702 transitions. [2023-11-22 21:28:05,150 INFO L78 Accepts]: Start accepts. Automaton has 4054 states and 5702 transitions. Word has length 99 [2023-11-22 21:28:05,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:28:05,150 INFO L495 AbstractCegarLoop]: Abstraction has 4054 states and 5702 transitions. [2023-11-22 21:28:05,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (20), 5 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-22 21:28:05,151 INFO L276 IsEmpty]: Start isEmpty. Operand 4054 states and 5702 transitions. [2023-11-22 21:28:05,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-22 21:28:05,152 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:28:05,152 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-11-22 21:28:05,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-22 21:28:05,152 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reach_error_linux_kernel_rcu_update_lock_schedErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:28:05,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:28:05,153 INFO L85 PathProgramCache]: Analyzing trace with hash -990480109, now seen corresponding path program 1 times [2023-11-22 21:28:05,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:28:05,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4260559] [2023-11-22 21:28:05,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:28:05,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:28:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:28:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:28:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:28:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-22 21:28:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:28:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:28:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:28:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:28:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 21:28:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:28:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 21:28:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:28:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 21:28:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 21:28:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-22 21:28:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-22 21:28:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 21:28:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-22 21:28:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-22 21:28:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:28:05,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:28:05,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4260559] [2023-11-22 21:28:05,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4260559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:28:05,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:28:05,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:28:05,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906257860] [2023-11-22 21:28:05,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:28:05,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:28:05,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:28:05,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:28:05,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:28:05,619 INFO L87 Difference]: Start difference. First operand 4054 states and 5702 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (21), 5 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-22 21:28:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:28:12,773 INFO L93 Difference]: Finished difference Result 4054 states and 5702 transitions. [2023-11-22 21:28:12,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:28:12,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (21), 5 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 104 [2023-11-22 21:28:12,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:28:12,781 INFO L225 Difference]: With dead ends: 4054 [2023-11-22 21:28:12,781 INFO L226 Difference]: Without dead ends: 4051 [2023-11-22 21:28:12,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:28:12,782 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 3947 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 4362 mSolverCounterSat, 2334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4027 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 6696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2334 IncrementalHoareTripleChecker+Valid, 4362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-11-22 21:28:12,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4027 Valid, 624 Invalid, 6696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2334 Valid, 4362 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2023-11-22 21:28:12,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4051 states. [2023-11-22 21:28:13,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4051 to 4051. [2023-11-22 21:28:13,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4051 states, 2624 states have (on average 1.3258384146341464) internal successors, (3479), 2714 states have internal predecessors, (3479), 1085 states have call successors, (1085), 332 states have call predecessors, (1085), 329 states have return successors, (1135), 1041 states have call predecessors, (1135), 1067 states have call successors, (1135) [2023-11-22 21:28:13,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4051 states to 4051 states and 5699 transitions. [2023-11-22 21:28:13,195 INFO L78 Accepts]: Start accepts. Automaton has 4051 states and 5699 transitions. Word has length 104 [2023-11-22 21:28:13,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:28:13,196 INFO L495 AbstractCegarLoop]: Abstraction has 4051 states and 5699 transitions. [2023-11-22 21:28:13,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (21), 5 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-22 21:28:13,196 INFO L276 IsEmpty]: Start isEmpty. Operand 4051 states and 5699 transitions. [2023-11-22 21:28:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-22 21:28:13,198 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:28:13,198 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-11-22 21:28:13,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-22 21:28:13,198 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting reach_error_linux_kernel_rcu_update_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:28:13,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:28:13,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1267627268, now seen corresponding path program 1 times [2023-11-22 21:28:13,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:28:13,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565463870] [2023-11-22 21:28:13,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:28:13,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:28:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:28:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:28:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:28:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-22 21:28:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:28:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:28:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:28:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:28:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 21:28:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:28:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 21:28:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:28:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 21:28:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 21:28:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-22 21:28:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-22 21:28:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 21:28:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-22 21:28:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-22 21:28:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 21:28:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:28:13,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:28:13,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565463870] [2023-11-22 21:28:13,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565463870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:28:13,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:28:13,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:28:13,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574616192] [2023-11-22 21:28:13,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:28:13,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:28:13,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:28:13,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:28:13,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:28:13,662 INFO L87 Difference]: Start difference. First operand 4051 states and 5699 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-22 21:28:17,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-22 21:28:22,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:28:22,308 INFO L93 Difference]: Finished difference Result 4051 states and 5699 transitions. [2023-11-22 21:28:22,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:28:22,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 109 [2023-11-22 21:28:22,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:28:22,317 INFO L225 Difference]: With dead ends: 4051 [2023-11-22 21:28:22,317 INFO L226 Difference]: Without dead ends: 4048 [2023-11-22 21:28:22,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:28:22,319 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 3941 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 4356 mSolverCounterSat, 2331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4020 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 6687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2331 IncrementalHoareTripleChecker+Valid, 4356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-11-22 21:28:22,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4020 Valid, 624 Invalid, 6687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2331 Valid, 4356 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2023-11-22 21:28:22,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4048 states. [2023-11-22 21:28:22,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4048 to 4048. [2023-11-22 21:28:22,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4048 states, 2623 states have (on average 1.3255813953488371) internal successors, (3477), 2712 states have internal predecessors, (3477), 1084 states have call successors, (1084), 331 states have call predecessors, (1084), 329 states have return successors, (1135), 1041 states have call predecessors, (1135), 1067 states have call successors, (1135) [2023-11-22 21:28:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4048 states to 4048 states and 5696 transitions. [2023-11-22 21:28:22,658 INFO L78 Accepts]: Start accepts. Automaton has 4048 states and 5696 transitions. Word has length 109 [2023-11-22 21:28:22,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:28:22,659 INFO L495 AbstractCegarLoop]: Abstraction has 4048 states and 5696 transitions. [2023-11-22 21:28:22,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-22 21:28:22,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4048 states and 5696 transitions. [2023-11-22 21:28:22,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-22 21:28:22,660 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:28:22,660 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:28:22,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-22 21:28:22,661 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reach_error_linux_kernel_rcu_srcuErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_linux_kernel_rcu_update_lock_bhErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_linux_net_sockErr0ASSERT_VIOLATIONERROR_FUNCTION (and 24 more)] === [2023-11-22 21:28:22,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:28:22,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2168840, now seen corresponding path program 1 times [2023-11-22 21:28:22,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:28:22,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518156462] [2023-11-22 21:28:22,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:28:22,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:28:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:28:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:28:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:28:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-22 21:28:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:28:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:28:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:28:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:28:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 21:28:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:28:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 21:28:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:28:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 21:28:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 21:28:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-22 21:28:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-22 21:28:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 21:28:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-22 21:28:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-22 21:28:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 21:28:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-22 21:28:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:28:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:28:23,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:28:23,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518156462] [2023-11-22 21:28:23,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518156462] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:28:23,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:28:23,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:28:23,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244610955] [2023-11-22 21:28:23,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:28:23,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:28:23,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:28:23,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:28:23,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:28:23,204 INFO L87 Difference]: Start difference. First operand 4048 states and 5696 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Killed by 15